Hybrid imperialist competitive algorithm, variable neighborhood search, and simulated annealing for dynamic facility layout problem.
Seyedmohsen HosseiniAbdullah Al KhaledSatish VadlamaniPublished in: Neural Comput. Appl. (2014)
Keyphrases
- imperialist competitive algorithm
- simulated annealing
- hybrid algorithm
- variable neighborhood search
- tabu search
- metaheuristic
- neighborhood search
- search procedure
- hybrid method
- evolutionary algorithm
- global optimization
- path relinking
- benchmark instances
- single machine scheduling problem
- optimization method
- particle swarm optimization pso
- combinatorial optimization
- traveling salesman problem
- memetic algorithm
- solution quality
- benchmark problems
- genetic algorithm
- feasible solution
- ant colony optimization
- vehicle routing problem
- heuristic methods
- solution space
- minimum spanning tree
- test problems
- genetic algorithm ga
- particle swarm optimization
- special case
- search space
- artificial neural networks