A Location Based Heuristic for General Routing Problems

Julien Bramel and David Simchi-Levi
Additional contact information
Julien Bramel: Columbia University, New York, New York
David Simchi-Levi: Northwestern University, Evanston, Illinois

Operations Research, 1995, vol. 43, issue 4, 649-660

Abstract: We present a general framework for modeling routing problems based on formulating them as a traditional location problem called the capacitated concentrator location problem. We apply this framework to two classical routing problems: the capacitated vehicle routing problem and the inventory routing problem. In the former case, the heuristic is proven to be asymptotically optimal for any distribution of customer demands and locations. Computational experiments show that the heuristic performs well for both problems and, in most cases, outperforms all published heuristics on a set of standard test problems.

Keywords: analysis of algorithms; suboptimal algorithms; programming; integer; relaxation; subgradient; transportation; vehicle routing (search for similar items in EconPapers)
Date: 1995
References: Add references at CitEc
Citations: View citations in EconPapers (49)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.43.4.649 (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:43:y:1995:i:4:p:649-660

Access Statistics for this article

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