A Hybrid Metaheuristic for the Quadratic Assignment Problem.
Lin-Yu TsengShyi-Ching LiangPublished in: Comput. Optim. Appl. (2006)
Keyphrases
- quadratic assignment problem
- hybrid metaheuristic
- tabu search
- vehicle routing problem
- metaheuristic
- scatter search
- combinatorial optimization
- test instances
- variable neighborhood search
- multi objective
- simulated annealing
- benchmark instances
- genetic algorithm
- ant colony optimization
- lower bound
- routing problem
- feasible solution
- combinatorial optimization problems
- memetic algorithm
- initial population
- search space
- traveling salesman problem
- scheduling problem
- mathematical programming
- combinatorial problems
- branch and bound algorithm
- hybrid algorithm
- particle swarm optimization
- benchmark problems
- test problems
- search methods
- heuristic methods
- optimization problems
- dynamic programming
- search algorithm
- solution space
- k nearest neighbor
- job shop scheduling problem
- upper bound
- stochastic local search
- cost function
- artificial neural networks