Improved bounds for vehicle routing solutions

DOI10.1016/J.DISOPT.2006.04.002MaRDI QIDQ865747zbMATH OpenOpenAlexDBLPWikidataFDO

Authors A. Bompadre, Moshe Dror, James B. Orlin

Publication date 20 February 2007

Published in Discrete Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.disopt.2006.04.002

zbMATH Keywords

approximation algorithmlower boundvehicle routing problem

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Traffic problems in operations research (90B20) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Improved lower bounds for the split delivery vehicle routing problem
• Improving the approximation ratio for capacitated vehicle routing
• Improving the approximation ratio for capacitated vehicle routing
• Vehicle routing with split deliveries
• On the vehicle routing problem with lower bound capacities

Cites work

• Bounds and Heuristics for Capacitated Routing Problems
• Faster scaling algorithms for general graph matching problems
• Heuristics for unequal weight delivery problems with a fixed error guarantee
• scientific article; zbMATH DE number 5542185 (Why is no real title available?)
• scientific article; zbMATH DE number 4057252 (Why is no real title available?)
• scientific article; zbMATH DE number 4066603 (Why is no real title available?)
• scientific article; zbMATH DE number 1016966 (Why is no real title available?)
• scientific article; zbMATH DE number 1559543 (Why is no real title available?)
• scientific article; zbMATH DE number 871938 (Why is no real title available?)
• Savings by Split Delivery Routing
• Technical Note—Heuristics for Delivery Problems with Constant Error Guarantees
• Worst-Case Analysis of Heuristics for Multidepot Capacitated Vehicle Routing Problems

Cited in

(24)

• Minimizing customers' waiting time in a vehicle routing problem with unit demands
• Approximation algorithms for the load-balanced capacitated vehicle routing problem
• A fast \((2 + \frac{2}{7})\)-approximation algorithm for capacitated cycle covering
• An analytical bound on the fleet size in vehicle routing problems: a dynamic programming approach
• Compact, provably-good LPs for orienteering and regret-bounded vehicle routing
• Differential approximation algorithm of FSMVRP
• Capacitated vehicle routing with nonuniform speeds
• scientific article; zbMATH DE number 5343224 (Why is no real title available?)
• A fast (2 + 2/7)-approximation algorithm for capacitated cycle covering
• Extensions of the Petal Method for Vehicle Routeing
• Analyses of advanced iterated tour partitioning heuristics for generalized vehicle routing problems
• Reverse multistar inequalities and vehicle routing problems with a lower bound on the number of customers per route
• Probabilistic Analysis of Unit-Demand Vehicle Routeing Problems
• Improving the approximation ratio for capacitated vehicle routing
• Improving the approximation ratio for capacitated vehicle routing
• A PTAS for Capacitated Vehicle Routing on Trees
• Iterated tour partitioning for Euclidean capacitated vehicle routing
• Lower and upper bounds for the m-peripatetic vehicle routing problem
• Improved approximation algorithms for multidepot capacitated vehicle routing
• Improved approximations for the capacitated vehicle routing problem with fixed capacity
• Multidepot capacitated vehicle routing with improved approximation guarantees
• Euclidean capacitated vehicle routing in the random setting: a 1.55-approximation algorithm
• A constant approximation algorithm for the uniform a priori capacitated vehicle routing problem with unit demands
• Improved lower bounds for the split delivery vehicle routing problem

This page was built for publication: Improved bounds for vehicle routing solutions

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