Vehicle routing problems with time windows and stochastic travel and service times: Models and algorithm

This paper studies a version of stochastic vehicle routing problems, in which travel and service times are stochastic, and a time window constraint is associated with each customer. This problem is originally formulated as a chance constrained programming model and a stochastic programming model wit...

Full description

Saved in:
Bibliographic Details
Published in:International journal of production economics 2010-05, Vol.125 (1), p.137-145
Main Authors: Li, Xiangyong, Tian, Peng, Leung, Stephen C.H.
Format: Article
Language:English
Subjects:
Algorithms
Economics
Heuristic
Mathematical models
Optimization
Optimization algorithms
Programming
Routing
Stochastic models
Stochastic service time
Stochastic travel time
Stochasticity
Studies
Tabu search
Time windows
Transportation problem (Operations research)
Vehicle routing problem
Vehicle routing problem Stochastic travel time Stochastic service time Time windows Tabu search
Vehicles
Windows (intervals)
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:This paper studies a version of stochastic vehicle routing problems, in which travel and service times are stochastic, and a time window constraint is associated with each customer. This problem is originally formulated as a chance constrained programming model and a stochastic programming model with recourse in terms of different optimization criteria. To efficiently solve these two models, a heuristic based on tabu search, which takes into account the stochastic nature of this problem, is then proposed. Finally, some testing instances with different properties are established to investigate the algorithmic performance, and the computational results are then reported.
ISSN:0925-5273
1873-7579
DOI:10.1016/j.ijpe.2010.01.013