4.3 Article

Ant colony optimization for the arc routing problem with intermediate facilities under capacity and length restrictions

期刊

JOURNAL OF HEURISTICS
卷 16, 期 2, 页码 211-233

出版社

SPRINGER
DOI: 10.1007/s10732-008-9097-8

关键词

Capacitated arc routing problem; Ant colony optimization; Intermediate facilities; Capacity and distance restrictions

资金

  1. Ministero dell' Istruzione, dell' Universitae della Ricerca Scientifica (MIUR)
  2. Center of Excellence on High Performance Computing, University of Calabria, Italy
  3. Canadian Natural Sciences and Engineering Research Council [05-39682]

向作者/读者索取更多资源

The aim of this paper is to introduce a new ant colony optimization procedure for the Arc Routing Problem with Intermediate Facilities under Capacity and Length Restrictions (CLARPIF), a variant of the Capacitated Arc Routing Problem (CARP) and of the Capacitated Arc Routing Problem with Intermediate Facilities (CARPIF). Computational results show that this algorithm is capable of providing substantial improvements over other known heuristics.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.3
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据