Probabilistic analysis for a multiple depot vehicle routing problem

DOI10.1002/rsa.20156zbMath1148.90001OpenAlexW4245556861MaRDI QIDQ3419619

Anand Srivastav, Andreas Baltz, Libertad Tansini, Devdatt P. Dubhashi, Sören Werth

Publication date: 7 February 2007

Published in: Random Structures & Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/rsa.20156

zbMATH Keywords

vehicle routingprobabilistic analysisMDVRP

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Transportation, logistics and supply chain management (90B06) Strong limit theorems (60F15)

Related Items (4)

Limit Theorems in Discrete Stochastic Geometry ⋮ Iterated tour partitioning for Euclidean capacitated vehicle routing ⋮ Approximate algorithms with estimates for routing problems on random inputs with a bounded number of customers per route ⋮ Probabilistic Analysis of the Degree Bounded Minimum Spanning Tree Problem

Cites Work

• Probability theory of classical Euclidean optimization problems
• Worst-Case Analysis of Heuristics for Multidepot Capacitated Vehicle Routing Problems
• A New Heuristic for the Multi-Depot Vehicle Routing Problem that Improves upon Best-Known Solutions

This page was built for publication: Probabilistic analysis for a multiple depot vehicle routing problem