Improved lower bounds for the split delivery vehicle routing problem

DOI10.1016/J.ORL.2010.04.008MaRDI QIDQ991469zbMATH OpenOpenAlexFDO

Authors 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

zbMATH Keywords

column generationextended formulationsplit deliverycutting-plane algorithm

Mathematics Subject Classification ID

Traffic problems in operations research (90B20)

Recommendations

• Improved bounds for vehicle routing solutions
• Branch-and-cut algorithms for the split delivery vehicle routing problem
• Vehicle routing with split deliveries
• Split delivery routing
• A column generation approach for the split delivery vehicle routing problem

Cites work

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

Cited in

(14)

• New exact solution approaches for the split delivery vehicle routing problem
• Improved bounds for vehicle routing solutions
• Vehicle routing problems with split deliveries
• Branch-and-cut algorithms for the split delivery vehicle routing problem
• The split delivery vehicle routing problem: Applications, algorithms, test problems, and computational results
• Simultaneously exploiting two formulations: an exact Benders decomposition approach
• An iterated local search heuristic for the split delivery vehicle routing problem
• Technical note: Split algorithm in O(n) for the capacitated vehicle routing problem
• Particle swarm optimization for split delivery vehicle routing problem
• An exact approach for the green vehicle routing problem with two-dimensional loading constraints and split delivery
• A tabu search algorithm for the vehicle routing problem with discrete split deliveries and pickups
• A novel approach to solve the split delivery vehicle routing problem
• Savings by Split Delivery Routing
• The split delivery vehicle routing problem with three-dimensional loading constraints

Describes a project that uses

Uses Software

• VRP

This page was built for publication: Improved lower bounds for the split delivery vehicle routing problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q991469)