.png){kind=icon}
返回
An improved ant system algorithm for the vehicle routing problem
.png){kind=icon}
PRE
AI
DOI：10.1023/A:1018940026670.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The Ant System is a distributed metaheuristic that combines an adaptive memory with a local heuristic function to repeatedly construct solutions of hard combinatorial optimization problems. In this paper, we present an improved ant system algorithm for the Vehicle Routing Problem with one central depot and identical vehicles. Computational results on fourteen benchmark problems from the literature are reported and a comparison with five other metaheuristic approaches for solving Vehicle Routing Problems is given.
Keyword:
ant system
adaptive memory
vehicle routing
metaheuristics
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
