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

Xiangyong Li, Peng Tian and Stephen C.H. Leung

International Journal of Production Economics, 2010, vol. 125, issue 1, 137-145

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

Keywords: Vehicle; routing; problem; Stochastic; travel; time; Stochastic; service; time; Time; windows; Tabu; search (search for similar items in EconPapers)
Date: 2010
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (66)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0925-5273(10)00023-X
Full text for ScienceDirect subscribers only

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:eee:proeco:v:125:y:2010:i:1:p:137-145

Access Statistics for this article

International Journal of Production Economics is currently edited by Stefan Minner

More articles in International Journal of Production Economics from Elsevier
Bibliographic data for series maintained by Catherine Liu ().