|
Abstract
|
Article Information:
Adaptive Ant Colony Algorithm for the VRP Solution of Logistics Distribution
Yu-Ping Wang
Corresponding Author: Yu-Ping Wang
Submitted: September 13, 2012
Accepted: October 24, 2012
Published: June 25, 2013 |
Abstract:
|
In order to conquer the premature convergence problem and lower the cost of computing of the basic Ant Colony Algorithm (ACA), we present an adaptive ant colony algorithm, named AACA, coupled with a Pareto Local Search (PLS) algorithm and apply to the Vehicle Routing Problem (VRP) and Capacitated VRP (CVRP). By using the information entropy, the algorithm adjusts the pheromone updating strategy adaptively. Experiments on various aspects of the algorithm and computational results for some benchmark problems are reported. We compare our approach with some classic, powerful meta-heuristics and show that the proposed approach can obtain the better quality of the solutions.
Key words: Ant colony algorithm, information entropy, pare to local search, vehicle routing problem, , ,
|
|
Abstract
|
PDF
|
HTML |
|
Cite this Reference:
Yu-Ping Wang, . Adaptive Ant Colony Algorithm for the VRP Solution of Logistics Distribution. Research Journal of Applied Sciences, Engineering and Technology, (05): 807-811.
|
|
|
|
 |
ISSN (Online): 2040-7467
ISSN (Print): 2040-7459 |
 |
| Information |
|
|
|
|
| Sales & Services |
|
|
|
|
