Title: Hybrid ABC/PSO to solve travelling salesman problem

Authors: Weihong Yang; Zhili Pei

Addresses: Department of Computer Science, Jilin Business and Technology College, Changchun 130062, China ' College of Computer Science and Technology, Inner Mongolia University for the Nationalities, Tongliao 028000, China; College of Mathematics, Jilin University, Changchun 130012, China; Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education, Jilin University, Changchun 130012 China

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.

Keywords: artificial bee colony; ABC algorithm; particle swarm optimisation; PSO; travelling salesman problem; TSP; hybrid optimisation; simulation.

DOI: 10.1504/IJCSM.2013.057246

International Journal of Computing Science and Mathematics, 2013 Vol.4 No.3, pp.214 - 221

Received: 26 Mar 2013
Accepted: 31 Mar 2013
Published online: 10 May 2014 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article