Probabilistic analysis of a capacitated vehicle routing problem. II

DOI10.1214/AOAP/1177004969MaRDI QIDQ1336587zbMATH OpenOpenAlexFDO

Authors Wansoo T. Rhee

Publication date 30 January 1996

Published in The Annals of Applied Probability (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1214/aoap/1177004969

zbMATH Keywords

capacitated vehicle routingcommon depotfleet of vehiclesprobabilistic analysistotal distance traveled

Mathematics Subject Classification ID

Geometric probability and stochastic geometry (60D05) Sample path properties (60G17) Transportation, logistics and supply chain management (90B06) Queues and service in operations research (90B22)

Recommendations

• Probabilistic analysis of a capactiated vehicle routing problem—I
• Probabilistic Analysis of Unit-Demand Vehicle Routeing Problems
• Probabilistic Analysis of the Capacitated Vehicle Routing Problem with Unsplit Demands
• Probabilistic analysis for a multiple depot vehicle routing problem
• scientific article; zbMATH DE number 4066603

Cited in

(15)

• Approximate algorithms with estimates for routing problems on random inputs with a bounded number of customers per route
• Dividing a territory among several vehicles
• Probabilistic analysis for a multiple depot vehicle routing problem
• Probabilistic analysis of a capactiated vehicle routing problem—I
• Probabilistic Analysis of the Capacitated Vehicle Routing Problem with Unsplit Demands
• A Probabilistic Analysis of Tour Partitioning Heuristics for the Capacitated Vehicle Routing Problem with Unsplit Demands
• Locating depots for capacitated vehicle routing
• The Capacitated Traveling Salesman Location Problem
• Probabilistic analysis of a routing problem
• Probabilistic Analysis of Unit-Demand Vehicle Routeing Problems
• A Class of Euclidean Routing Problems with General Route Cost Functions
• FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
• Iterated tour partitioning for Euclidean capacitated vehicle routing
• 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

This page was built for publication: Probabilistic analysis of a capacitated vehicle routing problem. II

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