Article ID Journal Published Year Pages File Type
1142758 Operations Research Letters 2009 7 Pages PDF
Abstract

We address the Capacitated Arc Routing Problem with Stochastic Demands (CARPSD), which we formulate as a Set Partitioning Problem. The CARPSD is solved by a Branch-and-Price algorithm, which we apply without graph transformation. The demand’s stochastic nature is incorporated into the pricing problem. Computational results are reported.

Keywords
Related Topics
Physical Sciences and Engineering Mathematics Discrete Mathematics and Combinatorics
Preview
A Branch-and-Price Algorithm for the Capacitated Arc Routing Problem with Stochastic Demands
Authors
, , ,