On the tour partitioning heuristic for the unit demand capacitated vehicle routing problem

DOI10.1016/J.ORL.2006.06.002zbMATH Open1180.90054OpenAlexW1968306102MaRDI QIDQ2467480FDOQ2467480

Thomas R. Sexton, Herbert F. Lewis

Publication date: 21 January 2008

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2006.06.002

Recommendations

• A Probabilistic Analysis of Tour Partitioning Heuristics for the Capacitated Vehicle Routing Problem with Unsplit Demands
• Iterated tour partitioning for Euclidean capacitated vehicle routing
• Analyses of advanced iterated tour partitioning heuristics for generalized vehicle routing problems
• An integrated local-search/set-partitioning refinement heuristic for the capacitated vehicle routing problem
• Tour splitting algorithms for vehicle routing problems
• Heuristic procedures for the capacitated vehicle routing problem
• Chain partitioning as a key element for building vehicle routing problem heuristics
• Heuristic solution approaches for the cumulative capacitated vehicle routing problem
• A constant approximation algorithm for the uniform a priori capacitated vehicle routing problem with unit demands
• On the capacitated vehicle routing problem

zbMATH Keywords

analysis of algorithms

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Traffic problems in operations research (90B20)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Bounds and Heuristics for Capacitated Routing Problems
• Technical Note—Heuristics for Delivery Problems with Constant Error Guarantees

Cited In (6)

• Title not available (Why is that?)
• Chain partitioning as a key element for building vehicle routing problem heuristics
• Heuristics for unequal weight delivery problems with a fixed error guarantee
• Technical Note—Heuristics for Delivery Problems with Constant Error Guarantees
• The spacefilling curve with optimal partitioning heuristic for the vehicle routing problem
• A Probabilistic Analysis of Tour Partitioning Heuristics for the Capacitated Vehicle Routing Problem with Unsplit Demands

This page was built for publication: On the tour partitioning heuristic for the unit demand capacitated vehicle routing problem

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