A hybrid ACO/PSO algorithm and its applications
by Yi Zhang, Meng Zhang, Yan-chun Liang
International Journal of Modelling, Identification and Control (IJMIC), Vol. 8, No. 4, 2009

Abstract: In this paper, we present a hybrid optimisation algorithm with particle swarm optimisation (PSO) and ant colony optimisation (ACO). Unlike the conventional ACO or PSO, the new optimisation scheme makes full use of the attributes of both algorithms. In the proposed algorithm, the PSO is used to optimise the parameters in the ACO, which means that the selection of parameters does not depend on artificial experiences or trial and error, but relies on the adaptive search of the particles in the PSO. We also make an optimised implementation of ACO, by which the running time of ants routing is largely reduced. The results of the simulated experiments show that the improved algorithm not only reduces the number of routes in the ACO, but also surpasses existing algorithms in performance for solving large-scale TSP problems. Simulation results also show that the speed of convergence of ACO algorithm could be enhanced greatly.

Online publication date: Wed, 09-Dec-2009

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Modelling, Identification and Control (IJMIC):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com