A New Generation of Vehicle Routing Research: Robust Algorithms, Addressing Uncertainty

Dimitris J. Bertsimas and David Simchi-Levi
Additional contact information
Dimitris J. Bertsimas: Massachusetts Institute of Technology, Cambridge, Massachusetts
David Simchi-Levi: Northwestern University, Evanston, Illinois

Operations Research, 1996, vol. 44, issue 2, 286-304

Abstract: In recent years new insights and algorithms have been obtained for the classical, deterministic vehicle routing problem as well as for natural stochastic and dynamic variations of it. These new developments are based on theoretical analysis, combine probabilistic and combinatorial modeling, and lead to new algorithms that produce near-optimal solutions, and a deeper understanding of uncertainty issues in vehicle routing. In this paper, we survey these new developments with an emphasis on the insights gained and on the algorithms proposed.

Keywords: analysis of algorithms: worst case; probabilistic; transportation: vehicle routing (search for similar items in EconPapers)
Date: 1996
References: Add references at CitEc
Citations: View citations in EconPapers (54)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.44.2.286 (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:44:y:1996:i:2:p:286-304

Access Statistics for this article

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