The capacitated vehicle routing problem with stochastic demands and time windows

Authors:
Hongtao Lei;Gilbert Laporte;Bo Guo
Affiliations:
College of Information Systems and Management, National University of Defense Technology, Changsha, Hunan 410073, PR China;Canada Research Chair in Distribution Management, HEC Montreal, 3000 chemin de la Côte-Sainte-Catherine, Montreal, Canada H3T 2A7 and Interuniversity Research Centre on Enterprise Networks, L ...;College of Information Systems and Management, National University of Defense Technology, Changsha, Hunan 410073, PR China
Venue:
Computers and Operations Research
Year:
2011

Citing 14
Cited 4

Algorithms for the vehicle routing and scheduling problems with time window constraints

Operations Research
A vehicle routing problem with stochastic demand

Operations Research
New optimization heuristics

Journal of Computational Physics
Comparing neuro-dynamic programming algorithms for the vehicle routing problem with stochastic demands

Computers and Operations Research - Neural networks in business
Using Constraint Programming and Local Search Methods to Solve Vehicle Routing Problems

CP '98 Proceedings of the 4th International Conference on Principles and Practice of Constraint Programming
A Generalized Insertion Heuristic for the Traveling Salesman Problem with Time Windows

Operations Research
An Integer L-Shaped Algorithm for the Capacitated Vehicle Routing Problem with Stochastic Demands

Operations Research
A general heuristic for vehicle routing problems

Computers and Operations Research
An Adaptive Large Neighborhood Search Heuristic for the Pickup and Delivery Problem with Time Windows

Transportation Science
Reoptimization Approaches for the Vehicle-Routing Problem with Stochastic Demands

Operations Research
An Adaptive Large Neighbourhood Search Heuristic for the Capacitated Arc-Routing Problem with Stochastic Demands

Transportation Science
A Hybrid Monte Carlo Local Branching Algorithm for the Single Vehicle Routing Problem with Stochastic Demands

Transportation Science
A memetic algorithm for the multi-compartment vehicle routing problem with stochastic demands

Computers and Operations Research
The integer L-shaped method for stochastic integer programs with complete recourse

Operations Research Letters

Particle Swarm Optimization for the Vehicle Routing Problem with Stochastic Demands

Applied Soft Computing
Heuristics for the probabilistic traveling salesman problem with deadlines based on quasi-parallel Monte Carlo sampling

Computers and Operations Research
The consultation timetabling problem at Danish high schools

Journal of Heuristics
A multi-objective dynamic vehicle routing problem with fuzzy time windows: Model, solution and application

Applied Soft Computing

Quantified Score

Hi-index	0.01

Visualization

Abstract

The capacitated vehicle routing problem with stochastic demands and time windows is an extension of the capacitated vehicle routing problem with stochastic demands, in which demands are stochastic and a time window is imposed on each vertex. A vertex failure occurring when the realized demand exceeds the vehicle capacity may trigger a chain reaction of failures on the remaining vertices in the same route, as a result of time windows. This paper models this problem as a stochastic program with recourse, and proposes an adaptive large neighborhood search heuristic for its solution. Modified Solomon benchmark instances are used in the experiments. Computational results clearly show the superiority of the proposed heuristic over an alternative solution approach.