Very Large-Scale Neighborhood Search for the Quadratic Assignment Problem.
Ravindra K. AhujaKrishna C. JhaJames B. OrlinDushyant SharmaPublished in: INFORMS J. Comput. (2007)
Keyphrases
- quadratic assignment problem
- neighborhood search
- tabu search
- simulated annealing
- path relinking
- combinatorial optimization
- variable neighborhood search
- traveling salesman problem
- vehicle routing problem
- lower bound
- metaheuristic
- heuristic methods
- test instances
- nature inspired
- aco algorithm
- ant colony optimization
- search algorithm
- memetic algorithm
- genetic algorithm
- evolutionary algorithm
- combinatorial optimization problems
- job shop scheduling problem
- test problems
- mathematical programming
- feasible solution
- objective function
- upper bound
- decision trees