Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
477297 | European Journal of Operational Research | 2009 | 6 Pages |
Abstract
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.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
Bin Yu, Zhong-Zhen Yang, Baozhen Yao,