A fast two-level variable neighborhood search for the clustered vehicle routing problem.
Christof DefrynKenneth SörensenPublished in: Comput. Oper. Res. (2017)
Keyphrases
- vehicle routing problem
- variable neighborhood search
- metaheuristic
- tabu search
- routing problem
- benchmark instances
- traveling salesman problem
- neighborhood search
- hybrid metaheuristic
- test instances
- benchmark problems
- travel time
- np hard
- memetic algorithm
- combinatorial optimization
- simulated annealing
- combinatorial optimization problems
- search strategies
- genetic algorithm
- particle swarm optimization
- ant colony optimization
- scheduling problem
- cost function
- hybrid algorithm
- test problems
- search strategy
- feasible solution
- combinatorial problems
- path relinking
- multi objective
- search algorithm
- optimal solution