A Probabilistic Analysis of Tour Partitioning Heuristics for the Capacitated Vehicle Routing Problem with Unsplit Demands
DOI10.1287/MOOR.18.4.786zbMATH Open0801.90112OpenAlexW2016704841MaRDI QIDQ4286934FDOQ4286934
Authors: Daniel Bienstock, Julien Bramel, David Simchi-Levi 
Publication date: 12 April 1994
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/moor.18.4.786
Recommendations
- Probabilistic Analysis of the Capacitated Vehicle Routing Problem with Unsplit Demands
- scientific article; zbMATH DE number 4066603
- Probabilistic analysis of a capacitated vehicle routing problem. II
- On the tour partitioning heuristic for the unit demand capacitated vehicle routing problem
- Probabilistic analysis of a capactiated vehicle routing problem—I
Programming involving graphs or networks (90C35) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Transportation, logistics and supply chain management (90B06) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)
Cited In (6)
- Title not available (Why is that?)
- Analyses of advanced iterated tour partitioning heuristics for generalized vehicle routing problems
- Tour splitting algorithms for vehicle routing problems
- Probabilistic Analysis of the Capacitated Vehicle Routing Problem with Unsplit Demands
- Routing problems: A bibliography
- On the tour partitioning heuristic for the unit demand capacitated vehicle routing problem
This page was built for publication: A Probabilistic Analysis of Tour Partitioning Heuristics for the Capacitated Vehicle Routing Problem with Unsplit Demands
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4286934)
