期刊
COMPUTERS & OPERATIONS RESEARCH
卷 35, 期 4, 页码 1112-1126出版社
PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.cor.2006.07.007
关键词
heuristics; arc routing; tabu search
The capacitated arc routing problem (CARP) is a difficult optimisation problem in vehicle routing with applications where a service must be provided by a set of vehicles on specified roads. A heuristic algorithm based on tabu search is proposed and tested on various sets of benchmark instances. The computational results show that the proposed algorithm produces high quality results within a reasonable computing time. Some new best solutions are reported for a set of test problems used in the literature. (C) 2006 Elsevier Ltd. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据