Recent Advances for the Quadratic Assignment Problem with Special Emphasis on Instances that are Difficult for Meta-Heuristic Methods.
Zvi DreznerPeter M. HahnÉric D. TaillardPublished in: Ann. Oper. Res. (2005)
Keyphrases
- recent advances
- quadratic assignment problem
- heuristic methods
- tabu search
- integer linear programming formulation
- simulated annealing
- metaheuristic
- benchmark instances
- scheduling problem
- memetic algorithm
- lower bound
- feasible solution
- optimal solution
- exact algorithms
- test problems
- test instances
- genetic algorithm
- combinatorial optimization
- traveling salesman
- search algorithm
- field of pattern recognition
- job shop scheduling problem
- vehicle routing problem
- benchmark problems
- max sat
- optimization problems
- search space
- neural network