Improved lower bounds for the split delivery vehicle routing problem
From MaRDI portal
Publication:991469
DOI10.1016/j.orl.2010.04.008zbMath1193.90068MaRDI QIDQ991469
Lorenza Moreno, Marcus Poggi de Aragão, Eduardo Uchoa
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
90B20: Traffic problems in operations research
Related Items
Particle Swarm Optimization for Split Delivery Vehicle Routing Problem, 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, New exact solution approaches for the split delivery vehicle routing problem, A tabu search algorithm for the vehicle routing problem with discrete split deliveries and pickups, The split delivery vehicle routing problem with three-dimensional loading constraints, Simultaneously exploiting two formulations: an exact Benders decomposition approach, An exact approach for the green vehicle routing problem with two-dimensional loading constraints and split delivery, A novel approach to solve the split delivery vehicle routing problem
Uses Software
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
