An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts.
Roberto BaldacciNicos ChristofidesAristide MingozziPublished in: Math. Program. (2008)
Keyphrases
- set partitioning
- vehicle routing problem
- vehicle routing problem with time windows
- vehicle routing
- column generation
- routing problem
- integer programming
- dantzig wolfe decomposition
- metaheuristic
- tabu search
- np hard
- exact algorithms
- benchmark problems
- branch and bound
- traveling salesman problem
- travel time
- combinatorial optimization
- integer program
- linear programming
- linear program
- combinatorial optimization problems
- optimal solution
- knapsack problem
- particle swarm optimization
- cutting plane
- constraint programming
- search algorithm
- memetic algorithm
- branch and bound algorithm
- lagrangian relaxation
- exact solution
- shortest path
- special case
- search space
- lower bound
- pick up and delivery