Probabilistic Analysis of Unit-Demand Vehicle Routeing Problems

DOI10.1239/jap/1175267177zbMath1162.68830OpenAlexW2009006795WikidataQ59592433 ScholiaQ59592433MaRDI QIDQ5443715

Moshe Dror, James B. Orlin, Agustín Bompadre

Publication date: 22 February 2008

Published in: Journal of Applied Probability (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1239/jap/1175267177

zbMATH Keywords

heuristicprobabilistic analysis of algorithmsVehicle routing problem

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Transportation, logistics and supply chain management (90B06)

Related Items (5)

Iterated tour partitioning for Euclidean capacitated vehicle routing ⋮ Capacitated Vehicle Routing with Non-uniform Speeds ⋮ An empirical analysis of heuristics for solving the two-machine flow shop problem with job release times ⋮ Approximate algorithms with estimates for routing problems on random inputs with a bounded number of customers per route ⋮ Almost sure asymptotic optimality for online routing and machine scheduling problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Improved bounds for vehicle routing solutions
• The minimum latency problem
• Technical Note—Heuristics for Delivery Problems with Constant Error Guarantees
• The shortest path and the shortest road through n points
• Bounds and Heuristics for Capacitated Routing Problems
• Worst-Case Analysis of Heuristics for Multidepot Capacitated Vehicle Routing Problems

This page was built for publication: Probabilistic Analysis of Unit-Demand Vehicle Routeing Problems