An improved ant colony optimization for vehicle routing problem

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 mutat...

Full description

Saved in:
Bibliographic Details
Published in:European journal of operational research 2009-07, Vol.196 (1), p.171-176
Main Authors: Yu, Bin, Yang, Zhong-Zhen, Yao, Baozhen
Format: Article
Language:English
Subjects:
Ant-weight strategy
Applied sciences
Benchmarks
Exact sciences and technology
Flows in networks. Combinatorial problems
Heuristic
Improved ant colony optimization
Logistics
Mutation operation
Operational research and scientific management
Operational research. Management science
Optimization
Route optimization
Routing
Studies
Vehicle routing problem
Vehicle routing problem Improved ant colony optimization Ant-weight strategy Mutation operation
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:0377-2217
1872-6860
DOI:10.1016/j.ejor.2008.02.028