Comparative performance of tabu search and simulated annealing heuristics for the quadratic assignment problem.
Gerald PaulPublished in: Oper. Res. Lett. (2010)
Keyphrases
- cost function
- optimization problems
- tabu search
- quadratic assignment problem
- metaheuristic
- simulated annealing
- integer linear programming formulation
- heuristic methods
- tabu search algorithm
- evolutionary algorithm
- combinatorial optimization
- ant colony optimization
- combinatorial optimization problems
- feasible solution
- benchmark problems
- path relinking
- memetic algorithm
- test problems
- vehicle routing problem
- job shop scheduling problem
- search algorithm
- search procedure
- tabu list
- solution space
- benchmark instances
- hybrid algorithm
- knapsack problem
- genetic algorithm
- traveling salesman problem
- solution quality
- hill climbing
- max sat
- heuristic search
- genetic algorithm ga
- exact algorithms
- particle swarm optimization pso
- scheduling problem
- special case
- search space
- bayesian networks