Home           Contact us           FAQs           
     Journal Home     |     Aim & Scope    |    Author(s) Information      |     Editorial Board     |     MSP Download Statistics
2013 (Vol. 6, Issue: 05)
Article Information:

Adaptive Ant Colony Algorithm for the VRP Solution of Logistics Distribution

Yu-Ping Wang
Corresponding Author:  Yu-Ping Wang 

Key words:  Ant colony algorithm, information entropy, pare to local search, vehicle routing problem, , ,
Vol. 6 , (05): 807-811
Submitted Accepted Published
September 13, 2012 October 24, 2012 June 25, 2013

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.
Abstract PDF HTML
  Cite this Reference:
Yu-Ping Wang, 2013. Adaptive Ant Colony Algorithm for the VRP Solution of Logistics Distribution.  Research Journal of Applied Sciences, Engineering and Technology, 6(05): 807-811.
    Advertise with us
ISSN (Online):  2040-7467
ISSN (Print):   2040-7459
Submit Manuscript
   Current Information
   Sales & Services
Home  |  Contact us  |  About us  |  Privacy Policy
Copyright © 2015. MAXWELL Scientific Publication Corp., All rights reserved