Home > Research > Publications & Outputs > Exploiting sparsity in pricing routines for the...
View graph of relations

Exploiting sparsity in pricing routines for the capacitated arc routing problem

Research output: Contribution to Journal/MagazineJournal articlepeer-review

<mark>Journal publication date</mark>2009
<mark>Journal</mark>Computers and Operations Research
Issue number7
Number of pages8
Pages (from-to)2320-2327
Publication StatusPublished
<mark>Original language</mark>English


The capacitated arc routing problem (CARP) is a well-known and fundamental vehicle routing problem. A promising exact solution approach to the CARP is to model it as a set covering problem and solve it via branch-cut-and-price. The bottleneck in this approach is the pricing (column generation) routine. In this paper, we note that most CARP instances arising in practical applications are defined on sparse graphs. We show how to exploit this sparsity to yield faster pricing routines. Extensive computational results are given.