Journal
COMPUTERS & OPERATIONS RESEARCH
Volume 36, Issue 7, Pages 2320-2327Publisher
PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.cor.2008.09.008
Keywords
Arc routing; Column generation; Branch-cut-and-price
Categories
Funding
- EPSRC [EP/F033613/1, EP/D072662/1] Funding Source: UKRI
- Engineering and Physical Sciences Research Council [EP/F033613/1, EP/D072662/1] Funding Source: researchfish
Ask authors/readers for more resources
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. (C) 2008 Elsevier Ltd. All rights reserved.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available