On the Hardness of the Quadratic Assignment Problem with Metaheuristics.
Eric AngelVassilis ZissimopoulosPublished in: J. Heuristics (2002)
Keyphrases
- quadratic assignment problem
- tabu search
- combinatorial optimization
- metaheuristic
- simulated annealing
- aco algorithm
- ant colony optimization
- benchmark instances
- vehicle routing problem
- np hard
- lower bound
- memetic algorithm
- phase transition
- optimization problems
- np complete
- computational complexity
- aco algorithms
- integer linear programming formulation
- traveling salesman problem
- genetic algorithm
- search algorithm
- particle swarm optimization
- scheduling problem
- feasible solution
- test instances
- test problems
- combinatorial optimization problems
- heuristic methods
- optimal solution
- search space
- max sat
- stochastic local search
- job shop scheduling problem
- worst case
- branch and bound algorithm
- evolutionary algorithm