A branch-price-and-cut algorithm for the commodity constrained split delivery vehicle routing problem.
Claudia ArchettiNicola BianchessiM. Grazia SperanzaPublished in: Comput. Oper. Res. (2015)
Keyphrases
- vehicle routing problem
- benchmark problems
- optimization algorithm
- computational complexity
- cost function
- simulated annealing
- tabu search
- dynamic programming
- vehicle routing problem with time windows
- metaheuristic
- neighborhood search
- objective function
- vehicle routing
- memetic algorithm
- worst case
- np hard
- optimal solution