An efficient variable neighborhood search heuristic for very large scale vehicle routing problems.
Jari KytöjokiTeemu NuortioOlli BräysyMichel GendreauPublished in: Comput. Oper. Res. (2007)
Keyphrases
- variable neighborhood search
- vehicle routing problem
- metaheuristic
- tabu search
- heuristic methods
- benchmark instances
- neighborhood search
- traveling salesman problem
- routing problem
- minimum spanning tree
- hybrid method
- hybrid metaheuristic
- single machine scheduling problem
- path relinking
- combinatorial optimization
- search procedure
- optimal solution
- combinatorial optimization problems
- memetic algorithm
- simulated annealing
- search algorithm
- benchmark problems
- feasible solution
- graph theory
- test problems
- hybrid algorithm
- job shop scheduling problem
- test instances
- constraint satisfaction
- ant colony optimization
- optimization problems
- evolutionary algorithm
- neural network