Metaheuristic algorithms for the quadratic assignment problem.
Mehmet Fatih TasgetirenQuan-Ke PanPonnuthurai Nagaratnam SuganthanIkbal Ece DizbayPublished in: CIPLS (2013)
Keyphrases
- quadratic assignment problem
- metaheuristic algorithms
- metaheuristic
- ant colony optimization
- tabu search
- aco algorithm
- combinatorial optimization
- variable neighborhood search
- simulated annealing
- benchmark problems
- optimization problems
- ant colony optimisation
- benchmark instances
- lower bound
- combinatorial optimization problems
- optimal solution
- vehicle routing problem
- search space
- multi objective
- feasible solution
- particle swarm optimization
- combinatorial problems
- heuristic methods
- genetic algorithm
- hybrid algorithm
- test instances
- traveling salesman problem
- memetic algorithm
- job shop scheduling problem
- cost function
- objective function
- special case