Stronger K-tree relaxations for the vehicle routing problem.
Carlos A. J. MartinhonAbilio LucenaNelson MaculanPublished in: Eur. J. Oper. Res. (2004)
Keyphrases
- cost function
- vehicle routing problem
- tree search algorithm
- np hard
- metaheuristic
- optimization problems
- tabu search
- benchmark problems
- vehicle routing
- routing problem
- traveling salesman problem
- vehicle routing problem with time windows
- hybrid metaheuristic
- benchmark instances
- combinatorial optimization
- tree search
- travel time
- test instances
- particle swarm optimization
- iterated local search
- lower bound
- memetic algorithm
- search strategies
- linear programming
- simulated annealing
- search procedure
- genetic algorithm
- minimum spanning tree
- swarm intelligence
- variable neighborhood search
- scheduling problem
- special case
- pick up and delivery
- multi depot