Hybrid ABC/PSO to solve travelling salesman problem
by Weihong Yang; Zhili Pei
International Journal of Computing Science and Mathematics (IJCSM), Vol. 4, No. 3, 2013

Abstract: In this paper, we present a hybrid optimisation algorithm with artificial bee colony (ABC) and particle swarm optimisation (PSO). Due to the fast convergent speed, PSO is the main methodology of this hybrid algorithm, as well as ABC is used to optimise the parameters. To investigate the performance, it is applied to solve travelling salesman problem. Simulation results show it is effective.

Online publication date: Sat, 10-May-2014

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 Computing Science and Mathematics (IJCSM):
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