Tabu search vs. simulated annealing as a function of the size of quadratic assignment problem instances.
Mohamed Saifullah HussinThomas StützlePublished in: Comput. Oper. Res. (2014)
Keyphrases
- quadratic assignment problem
- tabu search
- simulated annealing
- metaheuristic
- integer linear programming formulation
- benchmark instances
- feasible solution
- combinatorial optimization
- memetic algorithm
- test problems
- genetic algorithm
- hybrid algorithm
- heuristic methods
- scheduling problem
- solution space
- solution quality
- search procedure
- genetic algorithm ga
- search algorithm
- initial solution
- evolutionary algorithm
- job shop scheduling problem
- hill climbing
- benchmark problems
- vehicle routing problem
- tabu list
- tabu search algorithm
- test instances
- neural network
- combinatorial optimization problems
- ant colony optimization
- max sat
- particle swarm optimization pso