Abstract: The Travelling Salesman Problem is a classic problem used to evaluate the effectiveness of optimization algorithms. Ion motion optimization algorithm is a newly published optimization algorithm. This algorithm was inspired by the movement of ions in nature and It is attracting the attention of many studies in the world. This paper aims to evaluate the effectiveness of IOM in Travelling Salesman Problem. It is compared to some metaheuristic search algorithms in the same class such as Genetic Algorithm, Particle Swarm optimization, Ant Colony Optimization. The results show that the Ion Motion Optimization algorithm uses fewer parameters, has a better convergence speed, faster than the rest of the algorithms..
[1]. B. Javidy, A. Hatamlou, and S. Mirjalili, Ions motion algorithm for solving optimization problems, Applied Soft Computing, vol. 32, no. 3, pp. 72-79, 2015.
[2]. Cheng-Hong Yang, Kuo-Chuan Wu, Li-Yeh Chuang, Breast Cancer Risk Prediction Using Ions Motion Optimization Algorithm, Journal of Life Sciences and Technologies Vol. 4, No. 2, December 2016, pp. 49-55
[3]. Kumar, Mohit & Dhillon, J.S.. (2018). An Experimental Study of Ion Motion Optimization for Constraint Economic Load Dispatch Problem, IEEE international conference of power energy, environment and intelligent control.
[4]. Nguyen TT., Wang MJ., Pan JS., Dao T., Ngo TG. (2020) A Load Economic Dispatch Based on Ion Motion Optimization Algorithm. In: Pan JS., Li J., Tsai PW., Jain L. (eds) Advances in Intelligent Information Hiding and Multimedia Signal Processing. Smart Innovation, Systems and Technologies, vol 157. Springer, Singapore
[5]. Sabry Ahmed Haroun, Benhra Jamal, El Hassani Hicham, A Performance Comparison of GA and ACO Applied to TSP, International Journal of Computer Applications (0975 – 8887) Volume 117 – No. 19, pp. 28-35, May 2015