On the Distance Constrained Vehicle Routing Problem

Chung-Lun Li, David Simchi-Levi and Martin Desrochers
Additional contact information
Chung-Lun Li: Washington University, St. Louis, Missouri
David Simchi-Levi: Columbia University, New York, New York
Martin Desrochers: GERAD and Ecole Polytechnique, Montreal, Canada

Operations Research, 1992, vol. 40, issue 4, 790-799

Abstract: We analyze the vehicle routing problem with constraints on the total distance traveled by each vehicle. Two objective functions are considered: minimize the total distance traveled by vehicles and minimize the number of vehicles used. We demonstrate a close relationship between the optimal solutions for the two objective functions and perform a worst case analysis for a class of heuristics. We present a heuristic that provides a good worst case result when the number of vehicles used is relatively small.

Keywords: networks/graphs; heuristics: worst case analysis; transportation; vehicle routing: distance constrained vehicle routing problem (search for similar items in EconPapers)
Date: 1992
References: Add references at CitEc
Citations: View citations in EconPapers (14)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.40.4.790 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:40:y:1992:i:4:p:790-799

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().