A branch-and-price algorithm for the capacitated vehicle routing problem with stochastic demands

Authors:
Christian H. Christiansen;Jens Lysgaard
Affiliations:
Department of Business Studies, Aarhus School of Business, University of Aarhus, Fuglesangs Allé 4, DK-8210 Aarhus V, Denmark;Department of Business Studies, Aarhus School of Business, University of Aarhus, Fuglesangs Allé 4, DK-8210 Aarhus V, Denmark
Venue:
Operations Research Letters
Year:
2007

Citing 5
Cited 10

A vehicle routing problem with stochastic demand

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

Operations Research
Robust Branch-and-Cut-and-Price for the Capacitated Vehicle Routing Problem

Mathematical Programming: Series A and B
Simulation Modeling and Analysis (McGraw-Hill Series in Industrial Engineering and Management)

Simulation Modeling and Analysis (McGraw-Hill Series in Industrial Engineering and Management)
The integer L-shaped method for stochastic integer programs with complete recourse

Operations Research Letters

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

Computers and Operations Research
Constructive Heuristics for the Multicompartment Vehicle Routing Problem with Stochastic Demands

Transportation Science
Optimization of infectious medical waste collection using RFID

ICCL'11 Proceedings of the Second international conference on Computational logistics
A Branch-and-Price Algorithm for the Capacitated Arc Routing Problem with Stochastic Demands

Operations Research Letters
Synchronization in Vehicle Routing---A Survey of VRPs with Multiple Synchronization Constraints

Transportation Science
The robust vehicle routing problem with time windows

Computers and Operations Research
SIM-RandSHARP: a hybrid algorithm for solving the Arc Routing Problem with Stochastic Demands

Proceedings of the Winter Simulation Conference
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
Combinatorial expanding neighborhood topology particle swarm optimization for the vehicle routing problem with stochastic demands

Proceedings of the 15th annual conference on Genetic and evolutionary computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

This article introduces a new exact algorithm for the capacitated vehicle routing problem with stochastic demands (CVRPSD). The CVRPSD can be formulated as a set partitioning problem and it is shown that the associated column generation subproblem can be solved using a dynamic programming scheme. Computational experiments show promising results.