A Local Search Based on Variant Variable Depth Search for the Quadratic Assignment Problem.
Takeshi OkanoKengo KatayamaKazuho KanaharaNoritaka NishiharaPublished in: GCCE (2018)
Keyphrases
- quadratic assignment problem
- search algorithm
- tabu search
- stochastic local search
- search space
- global search
- combinatorial optimization
- search strategies
- simulated annealing
- hill climbing
- aco algorithms
- tree search
- search strategy
- traveling salesman
- aco algorithm
- lower bound
- integer linear programming formulation
- search tree
- bayesian networks
- search methods
- memetic algorithm
- branch and bound
- linear programming
- classification accuracy
- np hard
- evolutionary algorithm