| Article ID: | iaor20083829 |
| Country: | Netherlands |
| Volume: | 35 |
| Issue: | 6 |
| Start Page Number: | 773 |
| End Page Number: | 781 |
| Publication Date: | Nov 2007 |
| Journal: | Operations Research Letters |
| Authors: | Lysgaard Jens, Christiansen Christian H. |
| Keywords: | stochastic processes, programming: branch and bound |
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.