Hybrid particle swarm optimisation with k-centres method and dynamic velocity range setting for travelling salesman problems

International Journal of Bio-Inspired Computation

Volumn 2, Issue 1, 2010, Pages 34-41

  Zhang, Xumei ^a   Qiu, Hanguang ^a  

^a CHONGQING UNIVERSITY   (China)

Author keywords

Bio inspired computation; Cluster analysis; K centres method; Particle swarm optimisation; PSO; Travelling salesman problem; TSP; Velocity range

Indexed keywords

BIOMIMETICS; CLUSTER ANALYSIS; TRAVELING SALESMAN PROBLEM; VELOCITY;

BIO INSPIRED COMPUTATION; CONTINUOUS OPTIMISATION; DYNAMIC VELOCITY; HYBRID PARTICLES; PARTICLE SWARM OPTIMISATION; TRAVELLING SALESMAN PROBLEM; TRAVELLING SALESMAN PROBLEM (TSP); VELOCITY RANGE;

PARTICLE SWARM OPTIMIZATION (PSO);

EID: 84859549593     PISSN: 17580366     EISSN: 17580374     Source Type: Journal    
DOI: 10.1504/IJBIC.2010.030042     Document Type: Article

References (13)

1. Clerc, M. (2004)'Discrete particle swarm optimization, illustrated by the traveling salesman problem', New Optimization Techniques in Engineering, pp.219-239, Springer.
2. Clerc, M. and Kennedy, J. (2002)'The particle swarm-explosion, stability and convergence in a multidimensional complex space', IEEE Transactions on Evolutionary Computation, Vol. 6, No. 1, pp.58-73. (Pubitemid 34404564)
3. Hendtlass, T. (2003)'Preserving diversity in particle swarm optimization', Lecture Notes in Computer Science, Vol. 27, No. 18, pp.4104-4108.
4. Kennedy J. (2000)'Stereotyping: improving particle swarm performance with cluster analysis', Proceedings of the 2000 Congress on Evolutionary Computation, pp.1507-1512, La Jolla, CA.
5. Kennedy, J. and Eberhart, R. (1995)'Particle swarm optimization', Proceedings of IEEE International Conference on Neural Networks, pp.1942-1948, IEEE Service Center, Piscataway, NJ.
6. Kennedy, J. and Eberhart, R.C. (1997)'A discrete binary version of the particle swarm algorithm', Proceedings of the IEEE International Conference on Systems, Man and Cybernetics, pp.4104-4108, IEEE, Piscataway, NJ, USA.
7. Pang, W., Wang, K.P. and Zhou, C.G. et al. (2004a)'Modified particle swarm optimization based on space transformation for solving traveling salesman problem', Proceedings of 2004 International Conference on Machine Learning and Cybernetics, pp.2342-2346, Shanghai, China.
8. Pang, W., Wang, K.P. and Zhou, C.G. et al. (2004b)'Fuzzy discrete particle swarm optimization for solving traveling salesman problem', The Fourth International Conference on Computer and Information Technology, pp.796-800, Wuhan, China.
9. Shi, X.H., Liang, Y.C. and Lee, H.P. et al. (2007)'Particle swarm optimization-based algorithms for TSP and generalized TSP', Information Processing Letters, Vol. 103, No. 5, pp.169-176. (Pubitemid 46898376)
10. Tillett, J., Rao, T.M. and Sahin, F. et al. (2005)'Darwinian particle swarm optimization', Proceedings of the 2nd Indian International Conference on Artificial Intelligence, pp.1474-1487, Pune, India.
11. Wang, C., Zhang, J.W. and Yang, J. et al. (2005)'A modified particle swarm optimization algorithm and its application for solving traveling salesman problem', International Conference on Neural Networks and Brain, pp.689-694, Beijing, China. (Pubitemid 46289051)
12. Wang, K.P., Huang, L. and Zhou, C.G. et al. (2003)'Particle swarm optimization for traveling salesman problem', International Conference on Machine Learning and Cybernetics, pp.1583-1585, IEEE, Piscataway, NJ, USA.
13. Yuan, Z.L., Yang, L.L. and Wu, Y.H. et al. (2007)'Chaotic particle swarm optimization algorithm for traveling salesman problem', Proceedings of the IEEE International Conference on Automation and Logistics, pp.1122-1125, China, Jinan.