期刊
COMPUTERS & INDUSTRIAL ENGINEERING
卷 59, 期 4, 页码 954-963出版社
PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.cie.2010.09.006
关键词
Capacitated arc routing; Time-dependent service costs; Variable neighborhood descent
资金
- Canadian Natural Sciences and Engineering Research Council (NSERC)
This paper proposes a variable neighborhood descent heuristic for solving a capacitated arc routing problem with time-dependent service costs. The problem is motivated by winter gritting applications where the timing of each intervention is crucial. The variable neighborhood descent is based on neighborhood structures that manipulate arcs or sequences of arcs. Computational results are reported on problems derived from classical capacitated arc routing problem instances. A comparison is also provided with an alternative approach where the arc routing problem is solved after being transformed into an equivalent node routing problem. (C) 2010 Elsevier Ltd. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据