Article ID Journal Published Year Pages File Type
1143154 Operations Research Letters 2007 9 Pages PDF
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.

Keywords
Related Topics
Physical Sciences and Engineering Mathematics Discrete Mathematics and Combinatorics
Preview
A branch-and-price algorithm for the capacitated vehicle routing problem with stochastic demands
Authors
, ,