An efficient implementation of the simulated annealing heuristic for the quadratic assignment problem
Gerald PaulPublished in: CoRR (2011)
Keyphrases
- quadratic assignment problem
- simulated annealing
- tabu search
- combinatorial optimization
- metaheuristic
- traveling salesman
- genetic algorithm
- feasible solution
- evolutionary algorithm
- job shop scheduling problem
- solution quality
- lower bound
- memetic algorithm
- benchmark instances
- hill climbing
- genetic algorithm ga
- heuristic methods
- test instances
- search algorithm
- test problems
- integer linear programming formulation
- benchmark problems
- vehicle routing problem
- branch and bound
- optimization problems
- scheduling problem
- dynamic programming
- search strategies
- stochastic local search
- branch and bound algorithm
- cost function
- decision trees