The capacitated vehicle routing problem with stochastic demands and time windows
- 31 December 2011
- journal article
- Published by Elsevier BV in Computers & Operations Research
- Vol. 38 (12), 1775-1783
- https://doi.org/10.1016/j.cor.2011.02.007
Abstract
No abstract availableKeywords
Funding Information
- Canadian Natural Sciences and Engineering Research Council (39682-05)
- Chinese National Natural Science Foundation (70971132)
This publication has 27 references indexed in Scilit:
- A general heuristic for vehicle routing problemsComputers & Operations Research, 2007
- Designing delivery districts for the vehicle routing problem with stochastic demandsEuropean Journal of Operational Research, 2007
- Solving multiobjective vehicle routing problem with stochastic demand via evolutionary computationEuropean Journal of Operational Research, 2007
- A vehicle routing problem with time windows and stochastic demandsJournal of the Chinese Institute of Engineers, 2005
- Comparing neuro-dynamic programming algorithms for the vehicle routing problem with stochastic demandsComputers & Operations Research, 2000
- Dynamic vehicle routing: Status and prospectsAnnals of Operations Research, 1995
- The integer L-shaped method for stochastic integer programs with complete recourseOperations Research Letters, 1993
- New Optimization Heuristics: The Great Deluge Algorithm and the Record-to-Record TravelJournal of Computational Physics, 1993
- Models and exact solutions for a class of stochastic location-routing problemsEuropean Journal of Operational Research, 1989
- Stochastic vehicle routing: A comprehensive approachEuropean Journal of Operational Research, 1983