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

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...

Full description

Saved in:
Bibliographic Details
Published in:Operations research 1996-03, Vol.44 (2), p.286-304
Main Authors: Bertsimas, Dimitris J, Simchi-Levi, David
Format: Article
Language:English
Subjects:
A priori knowledge
Algorithms
analysis of algorithms: worst case, probabilistic
Applied sciences
Cost efficiency
Exact sciences and technology
Flows in networks. Combinatorial problems
Heuristics
Integers
Itinerant sales
Operational research and scientific management
Operational research. Management science
Operations research
Optimal solutions
Probability
Routing
Stochastic models
Studies
Survey, Expository & Tutorial
Time windows
transportation: vehicle routing
Travel expenses
Uncertainty
Vehicle capacity
Vehicles
Citations: Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:0030-364X
1526-5463
DOI:10.1287/opre.44.2.286