期刊
COMPUTERS & OPERATIONS RESEARCH
卷 36, 期 7, 页码 2320-2327出版社
PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.cor.2008.09.008
关键词
Arc routing; Column generation; Branch-cut-and-price
类别
资金
- 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
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.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据