An Improvement Particle Swarm Optimization for Travelling Salesman Problem with the Mutation Operator

Abstract:

This document proposed improvement PSO with applying mutation operator for solving Travelling Salesman Problem. To PSO solve or decrease trapping in local optimum. From experiment results of this research show that results of PSO with applying mutation operator obtain better than results of normal PSO for solving TSP.

• Periodical: Applied Mechanics and Materials (Volume 781)
• Pages: 527-530
• DOI: https://doi.org/10.4028/www.scientific.net/AMM.781.527
• Online since: August 2015
• Authors: Jaturong Sriborikit, Panwit Tuwanut
• Keywords: Mutation Operator, Particle Swarm Optimization (PSO), Travelling Salesman Problem

References

[1] J. Kennedy and R. C. Eberhart, Particle Swarm Optimization, IEEE International Conference on Neural Networks. (1995) 1942 – (1948).

[2] J. Kennedy and R. C. Eberhart, A New Optimizer Using Particle Swarm Theory, Proceedings of the 6th International Symposium on Micro Machine and Human Science. (1995) 39 – 43.

DOI: 10.1109/mhs.1995.494215

[3] R. Eberhart and Y. Shi, Comparison between genetic algorithms and particle swarm optimization, The 7th Annual Conference on Evolutionary Programming. (1998).

[4] A. Stacey, M. Jancic, and I. Grundy, particle swarm optimization with mutation, Proc. of the 2003 IEEE Congr. On Evol. Comput. (2003) 1425 – 1430.

DOI: 10.1109/cec.2003.1299838

[5] Andrews P S., An investigation into mutation operators for particle swarm optimization, Proceedings of the IEEE Congress on Evolutionary Computation. (2006) 1044 – 1051.

DOI: 10.1109/cec.2006.1688424

[6] R. Chiabwoot and K. Boontee, Mutation Period Calculation for Particle Swarm Optimization, 1st International Symposium on Technology for Sustainability. (2011) 213 – 216.

[7] L. Huang, K. Wang, C. Zhou, W. Pang, L. Dong and L. Peng, particle swarm optimization for traveling salesman problems, Journal of Ji Ling university. (2003) 477 – 480.

[8] L. Zhong and H. Lei, A Mixed Discrete Particle Swarm Optimization for TSP, 3rd International Conference on Advanced Computer Theory and Engineering. (2010) 208 – 211.

DOI: 10.1109/icacte.2010.5579238

[9] A. Ratnaweera, S. K. Halgamuge, and H. C. Watson, self-organizing hierarchical particle swarm optimizer with time-varying acceleration coefficients, IEEE Transactions on Evolutionary Computation. (2004) 240 – 255.

DOI: 10.1109/tevc.2004.826071

[10] C. Hanyong, O. Shunichi, Y. Kazuho, and O. Hiroaki, Improvement of Particle Swarm Optimization Application of the Mutation Concept for the Escape from Local Minima, 8th International Conference on Supply Chain Management and Information Systems. (2010).

[11] G. Reinelt, TSPLIB - A traveling salesman problem library, ORSA Journal on Computing. (1991) 376–384.

DOI: 10.1287/ijoc.3.4.376