2008 International Conference on Computational Intelligence and Security A Two-Stage Hybrid Ant Colony Algorithm for the CVRP December 13-December 17 ISBN: 978-0-7695-3508-1
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/CIS.2008.209
Capacitated vehicle routing problem(CVRP) is an important combinatorial optimization problem which has received considerable attention in the last decades. The Ant Colony system (ACS) is a metaheuristic which is inspired by the trail following behavior of real ant colonies. This paper proposes a two-stage hybrid ACS algorithm for CVRP. The algorithm first minimizes the number ofvehicles using ACS and then minimizes travel cost using Iterated Local Search(ILS). In first stage, we revised the ACS algorithm with randomized algorithm(RA) to compute the transition probability. Experimental results forpartial benchmark problems demonstrate the effectiveness of the algorithm.
Index Terms:
Ant colony system, Capacitated Vehicle Routing Problem, Combinatorial optimization, Iterated Local Search, Randomized algorithm
Citation:
Chengming Qi, Shoumei Cui, Yunchuan Sun, "A Two-Stage Hybrid Ant Colony Algorithm for the CVRP," cis, vol. 2, pp.215-219, 2008 International Conference on Computational Intelligence and Security, 2008 Usage of this product signifies your acceptance of the Terms of Use. | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||