Hybrid particle swarm optimisation with k-centres method and dynamic velocity range setting for travelling salesman problems Online publication date: Thu, 03-Dec-2009
by Xumei Zhang, Hanguang Qiu
International Journal of Bio-Inspired Computation (IJBIC), Vol. 2, No. 1, 2010
Abstract: The particle swarm optimisation (PSO) does well in the continuous optimisation problems. To solve travelling salesman problem (TSP) with the PSO, priority coding method is presented to code the solution of the TSP. Then a method based on dynamic setting of velocity range is proposed for the PSO to remove the side effect which results from inconsistency of the search space and the solution space under the priority coding method. The experiment shows: the descending velocity range could achieve this goal and the descending rate of velocity range should match up with that of the priority range in position vector. In addition, a new approach based on cluster analysis on the swarm with the k-centres method is proposed for preventing the PSO from local optimum during solving the TSP. Through this mechanism, the diversity of the swarm could be reserved as the computation goes on, which could improve the performance of the PSO.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
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 Bio-Inspired Computation (IJBIC):
Login with your Inderscience username and 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
Our Blog 
Follow us on Twitter 
Visit us on Facebook