A Probabilistic Analysis of Tour Partitioning Heuristics for the Capacitated Vehicle Routing Problem with Unsplit Demands

DOI10.1287/moor.18.4.786zbMath0801.90112OpenAlexW2016704841MaRDI QIDQ4286934

Julien Bramel, Bienstock, Daniel, 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

zbMATH Keywords

heuristicscapacitated vehicle routing problemroute first-cluster secondunsplit demands

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Transportation, logistics and supply chain management (90B06) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (1)

Routing problems: A bibliography

This page was built for publication: A Probabilistic Analysis of Tour Partitioning Heuristics for the Capacitated Vehicle Routing Problem with Unsplit Demands