An improved particle swarm optimisation for solving generalised travelling salesman problem
by Yu-xi Gao; Yan-min Wang; Zhi-li Pei
International Journal of Computing Science and Mathematics (IJCSM), Vol. 3, No. 4, 2012

Abstract: In this paper, we present an improved algorithm based on an improved particle swarm optimisation (PSO), and we use it to solve the generalised travelling salesman problem (GTSP). We design a novel optimised implementation approach to reduce the processing costs involved with routing in the conventional PSO and we also improved the performance of the PSO. As the main work of this paper, we use the improved algorithm in TSP based on the 'generalised chromosome' coding technique of the GTSP, the above proposed method is extended for solving the GTSP. Two local search techniques are also added into the method. In order to test our methods, we use four GTSP problems for benchmarking. The results show that the method is effective for solving the GTSP problem. The proposed PSO-based algorithm could provide a suitable approach for solving the GTSP.

Online publication date: Sat, 30-Aug-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