Hybrid metaheuristics for solving the quadratic assignment problem and the generalized quadratic assignment problem.
Aldy GunawanKien Ming NgKim Leng PohHoong Chuin LauPublished in: CASE (2014)
Keyphrases
- quadratic assignment problem
- combinatorial optimization
- tabu search
- metaheuristic
- lower bound
- traveling salesman problem
- aco algorithm
- integer linear programming formulation
- branch and bound algorithm
- simulated annealing
- combinatorial optimization problems
- branch and bound
- vehicle routing problem
- stochastic local search
- ant colony optimization
- aco algorithms
- optimization problems
- test instances
- genetic algorithm
- particle swarm optimization
- scheduling problem
- search algorithm
- orders of magnitude
- solution quality
- combinatorial problems