Interpretability, Adaptability and Scalability of Variable Neighborhood Search.
Pierre HansenAidan RiordanXavier HansenPublished in: MIC (1) (2024)
Keyphrases
- variable neighborhood search
- metaheuristic
- tabu search
- traveling salesman problem
- heuristic methods
- single machine scheduling problem
- minimum spanning tree
- routing problem
- vehicle routing problem
- hybrid method
- benchmark instances
- simulated annealing
- path relinking
- search procedure
- ant colony optimization
- scheduling problem
- genetic algorithm
- combinatorial optimization
- branch and bound algorithm
- solution quality
- combinatorial optimization problems
- job shop scheduling problem
- special case
- search space