Improved lower bounds for the split delivery vehicle routing problem

DOI10.1016/j.orl.2010.04.008zbMath1193.90068MaRDI QIDQ991469

Eduardo Uchoa, Marcus Poggi de Aragão, Lorenza Moreno

Publication date: 7 September 2010

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2010.04.008

zbMATH Keywords

column generation; extended formulation; split delivery; cutting-plane algorithm

Mathematics Subject Classification ID

90B20: Traffic problems in operations research

Related Items

Vehicle routing problems with split deliveries, Branch-and-cut algorithms for the split delivery vehicle routing problem, An iterated local search heuristic for the split delivery vehicle routing problem, A novel approach to solve the split delivery vehicle routing problem

Uses Software

• VRP

Cites Work

• Vehicle routing with split deliveries
• Robust branch-cut-and-price for the capacitated minimum spanning tree problem over a large extended formulation
• Robust branch-and-cut-and-price for the capacitated vehicle routing problem
• A robust branch-cut-and-price algorithm for the heterogeneous fleet vehicle routing problem
• Savings by Split Delivery Routing
• Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations
• A Lower Bound for the Split Delivery Vehicle Routing Problem
• The split delivery vehicle routing problem: Applications, algorithms, test problems, and computational results
• A column generation approach for the split delivery vehicle routing problem