## Imperialist competitive algorithm: An algorithm for optimization inspired by imperialistic competition

- Esmaeil Atashpaz-Gargari, Caro Lucas
- 2007 IEEE Congress on Evolutionary Computation
- 2007

Highly Influential

- Published 2016 in ACALCI
DOI:10.1007/978-3-319-28270-1_19

Flexible job shop scheduling problem (FJSP) is one of the hardest combinatorial optimization problems known to be NP-hard. This paper proposes a novel hybrid imperialist competitive algorithm with simulated annealing (HICASA) for solving the FJSP. HICASA explores the search space by using imperial competitive algorithm (ICA) and use a simulated annealing… CONTINUE READING

### Presentations referencing similar topics