Using K-means Radius Particle Swarm Optimization for the Travelling Salesman Problem

References

• G. Gutin, and A. Punnen, The Traveling Salesman Problem and its Variations. Dordrecht: Kluwer Academic Publishers, 2002.
   Google Scholar
• B. C. Chatterjee, N. Sarma, and P. P. Sahu, “Review and performance analysis on routing and wavelength assignment approaches for optical networks,” IETE Tech. Rev., Vol. 30, no. 1, pp. 12–23, Sep. 2014.
   Web of Science ®Google Scholar
• Z. Ahmed, I. Younas, and M. Zahoor, “A novel genetic algorithm for GTSP,” Int. J. Comput. Theory Eng., Vol. 2, no. 6, pp. 1793–8201, Dec. 2010.
   Google Scholar
• M. Dorigo, and L. M. Gambardella, “Ant colonies for the travelling salesman problem,” BioSystems, Vol. 43, no. 2, pp. 73–81, July 1997.
   PubMed Web of Science ®Google Scholar
• X. H. Shi, Y. C. Liang, H. P. Lee, C. Lu, and Q. X. Wang, “Particle swarm optimization-based algorithms for TSP and generalized TSP,” Inform. Proc. Lett., Vol. 103, no. 5, pp. 169–76, Aug. 2007.
   Web of Science ®Google Scholar
• Y. Marinakis, M. Marinaki, and G. Dounias, “Honey bees mating optimization algorithm for the Euclidean traveling salesman problem,” Inform. Sci., Vol. 181, no. 20, pp. 4684–98, Oct. 2011.
   Web of Science ®Google Scholar
• D. Gamboa, C. Rego, and F. Glover, “Data structures and ejection chains for solving large-scale traveling salesman problems,” Eur. J. Oper. Res., Vol. 160, no. 1, pp. 154–71, Jan. 2005.
   Web of Science ®Google Scholar
• S. A. Mulder, and D. C. Wunsch, “Million city traveling salesman problem solution by divide and conquer clustering with adaptive resonance neural networks,” Neural Netw., Vol. 16, no. 5–6, 827–32, Jun.–Jul. 2003.
   PubMed Web of Science ®Google Scholar
• Md. R. Karin, C. F. Ahmed, B. J. Jeong, and H. Choi, “An efficient distributed programming model for mining useful patterns in big datasets,” IETE Tech. Rev., Vol. 30, no. 1, pp. 53–63, Jan. 2013.
   Web of Science ®Google Scholar
• H. Szu, and S. Foo, “Divide and conquer orthogonality principle for parallel optimizations in TSP,” Neurocomputing, Vol. 8, no. 3, pp. 249–61, Aug. 1995.
   Web of Science ®Google Scholar
• J. Kennedy, and R. Eberhart, “Particle swarm optimization,” in International Proceedings of the IEEE Conference on Neural Networks, Perth, WA, Vol. 4, 1995, pp. 1942–8.
   Google Scholar
• W. Fang, J. Sun, Y. Ding, X. Wu, and W. Xu, “A review of quantum-behaved particle swarm optimization,” IETE Tech. Rev., Vol. 27, no. 4, pp. 336–48, July 2010.
   Web of Science ®Google Scholar
• M. Anantathanavit, and M. Munlin, “Fusing binary particle swarm optimization with simulated annealing for Knapsack problems,” in International Proceedings of the IEEE Conference on Industrial Electronics and Applications (ICIEA), China, 2014, pp. 1995–2000.
   Google Scholar
• M. Anantathanavit, and M. Munlin, “Radius particle swarm optimization,” in International Proceedings of the Computer Science and Engineering Conference (ICSEC), Thailand, 2013, pp. 121–30.
   Google Scholar
• M. Anantathanavit, and M. Munlin, “Radius particle swarm optimization for resource constrained project scheduling problem,” in International Proceedings of the Conference on Computer and Information Technology (ICCIT), Bangladesh, 2013, pp. 24–29.
   Google Scholar
• J. Kennedy, and R. Eberchart, “Small worlds and mega-minds: Effects of neighborhood topology on particle swarm performance,” in International Proceedings of the IEEE congress on Evolutionary Computation, Washington, DC, 1999, pp. 1391–938.
   Google Scholar
• S. Lin, and B.W. Kernighan, “An effective heuristic algorithm for the traveling salesman problem,” Oper. Res., Vol. 21, no. 2, pp. 498–516, Mar.–Apr. 1973.
   Web of Science ®Google Scholar
• TSPLIB. http://www.iwr.uni-heidelberg.de/groups/comopt/software/TSPLIB95/. Apr. 2006.
   Google Scholar
• D. Bratton, and J. Kennedy, “Defining a standard for particle swarm optimization,” in International Proceedings of the IEEE Swarm Intelligence Symposium, Honolulu, HI, 2007, pp. 120–7.
   Google Scholar
• X. He, Y. Zhu, H. Hu, and B. Niu, “A new algorithm for TSP based on swarm intelligence,” in Proceedings of the 6th World Congress on Intelligent Control and Automation, Dalian, 2006, pp. 3241–4.
   Google Scholar
• W. Zhong, J. Zhang, and W. Chen, “A novel discrete particle swarm optimization to solve traveling salesman problem,” in International Proceedings of the IEEE Congress on Evolutionary Computation (CEC 2007), Singapore, 2007, pp. 3283–7.
   Google Scholar
• Z. Yuan, L. Yang, Y. Wu, L. Liao, and G. Li, “Chaotic particle swarm optimization algorithm for traveling salesman problem,” in International Proceedings of the IEEE International Conference on Automation and Logistics, Jinan, 2007, pp. 1121–4.
   Google Scholar
• W. Zhao, X. Cai, and Y. Lan, “A new ant colony algorithm for solving traveling salesman problem,” in International Proceedings of Conference on Computer Science and Electronics Engineering, Hangzhou, 2012, pp. 530–3.
   Google Scholar
• S. Labed, A. Gherboudj, and S. Chikhi, “A modified hybrid particle swarm optimization algorithm for solving the traveling salesmen problem,” J. Theor. Appl. Inform. Technol., Vol. 39, no. 2, pp. 132–8, May 2012.
   Google Scholar
• X. Yan, C. Zhang, W. Luo, W. Li, W. Chen, and H. Liu, “Solve traveling salesman problem using particle swarm optimization algorithm,” Int. J. Comput. Sci., pp. 264–1, 2012.
   Google Scholar
• M. Cunkas, and M. Y. Ozsaglam, “A comparative study on particle swarm optimization and genetic algorithm for traveling salesman problems,” Cybern. Syst., Vol. 40, pp. 490–507, 2015.
   Web of Science ®Google Scholar