.png){kind=icon}
返回
An improved ant colony optimization based algorithm for the capacitated arc routing problem
.png){kind=icon}
PRE
AI
DOI：10.1016/j.trb.2009.07.004.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The capacitated arc routing problem is a well-studied problem in the Transportation/Logistics/OR literature. The problem consists of identifying the minimum cost routes required to service (e.g., pickup or deliver) demand located along the edges of a network. Unfortunately, the problem belongs to the set of NP-Hard problems: consequently. numerous heuristic and metaheuristic solution approaches have been developed to solve it. In this article. an ant colony optimization based metaheuristic is presented. Modifications are introduced for various components of the ant colony metaheuristics: specifically for those associated with the initial population, the ant decision rule and the local search procedure. The new metaheuristic was tested on seven standard test networks for the capacitated arc routing problem. The results demonstrate that the proposed approach performs extremely well vis-A-vis the state-of-the-art metaheuristics for the problem. (C) 2009 Elsevier Ltd. All rights reserved.
Keyword:
Capacitated arc routing
Ant colony optimization
Metaheuristics
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6.3
论文数:
3.5K
被引数:
1.9W
机构
引用论文
.png){kind=icon}
查看更多内容