期刊
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
卷 196, 期 1, 页码 171-176出版社
ELSEVIER SCIENCE BV
DOI: 10.1016/j.ejor.2008.02.028
关键词
Vehicle routing problem; Improved ant colony optimization; Ant-weight strategy; Mutation operation
The vehicle routing problem (VRP), a well-known combinatorial optimization problem, holds a central place in logistics management. This paper proposes an improved ant colony optimization (IACO), which possesses a new strategy to update the increased pheromone, called ant-weight strategy, and a mutation operation, to solve VRP. The computational results for fourteen benchmark problems are reported and compared to those of other metaheuristic approaches. (C) 2008 Elsevier B.V. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据