International Journal of Computer Science & Network Security

국제컴퓨터통신보호논문지학회 (International Journal of Computer Science & Network Security)
권호 표지
DOI QR코드

DOI QR Code

Optimization of the Travelling Salesman Problem Using a New Hybrid Genetic Algorithm

  • Zakir Hussain Ahmed (Department of Mathematics and Statistics, College of Science, Imam Mohammad Ibn Saud Islamic University (IMSIU)) ;
  • Furat Fahad Altukhaim (Department of Computer Science, Science Departments at Al Quwaiiyah, Shaqra University) ;
  • Abdul Khader Jilani Saudagar (Information Systems Department, Imam Mohammad Ibn Saud Islamic University (IMSIU)) ;
  • Shakir Khan (College of Computer and Information Sciences, Imam Mohammad Ibn Saud Islamic University (IMSIU))
  • 투고 : 2024.03.05
  • 발행 : 2024.03.30
PDF 다운로드
⟨ 이전 논문 다음 논문 ⟩

초록

The travelling salesman problem is very famous and very difficult combinatorial optimization problem that has several applications in operations research, computer science and industrial engineering. As the problem is difficult, finding its optimal solution is computationally very difficult. Thus, several researchers have developed heuristic/metaheuristic algorithms for finding heuristic solutions to the problem instances. In this present study, a new hybrid genetic algorithm (HGA) is suggested to find heuristic solution to the problem. In our HGA we used comprehensive sequential constructive crossover, adaptive mutation, 2-opt search and a new local search algorithm along with a replacement method, then executed our HGA on some standard TSPLIB problem instances, and finally, we compared our HGA with simple genetic algorithm and an existing state-of-the-art method. The experimental studies show the effectiveness of our proposed HGA for the problem.

키워드

과제정보

The authors extend their appreciation to the Deanship of Scientific Research, Imam Mohammad Ibn Saud Islamic University (IMSIU), Saudi Arabia, for funding this research work through Grant No. (221412020).

참고문헌

  1. Arora S. (1998). Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems, Journal of ACM, 45(5), pp. 753-782.  https://doi.org/10.1145/290179.290180
  2. Ahmed ZH, Yousefikhoshbakht M, Saudagar AK, and Khan S. (2023). Solving travelling salesman problem using an ant colony system algorithm, International Journal of Computer Science and Network Security, 23(2), pp. 55-64.  https://doi.org/10.22937/IJCSNS.2023.23.2.6
  3. Ravikumar CP. (1992). Solving large-scale travelling salesperson problems on parallel machines, Microprocessors and Microsystems, 16(3), pp. 149-158.  https://doi.org/10.1016/0141-9331(92)90038-U
  4. Su F, Kong L, Wang H, and Wen Z. (2021). Modeling and application for rolling scheduling problem based on TSP, Applied Mathematics and Computation, 407, 126333. 
  5. Little JDC, Murthy KG, Sweeny DW, and Karel C. (1963). An algorithm for the travelling salesman problem, Operations Research, 11, pp. 972-989.  https://doi.org/10.1287/opre.11.6.972
  6. Sherali HD, Sarin SC, and Tsai Pei-F. (2006). A class of lifted path and flow-based formulations for the asymmetric traveling salesman problem with and without precedence constraints, Discrete Optimization, 3 , pp. 20-32.  https://doi.org/10.1016/j.disopt.2005.10.004
  7. Padberg M, and Rinaldi G. (1991). A branch-and-cut algorithm for the resolution of large-scale symmetric traveling salesman problems, SIAM Review, 33(1), pp. 60-100.  https://doi.org/10.1137/1033004
  8. Ahmed ZH. (2011). A data-guided lexisearch algorithm for the asymmetric traveling salesman problem, Mathematical Problems in Engineering, 2011, Article ID 750968, 18 pages. 
  9. Ahmed ZH. (2010). Genetic algorithm for the traveling salesman problem using sequential constructive crossover operator, International Journal of Biometrics and Bioinformatics, 6(3), 96-105. 
  10. Goldberg DE. (1989). Genetic algorithms in search, optimization, and machine learning, Addison-Wesley, New York. 
  11. Dorigo M, and Gambardella LM. (1997). Ant colonies for the traveling salesman problem, Biosystems, 43(2), pp. 73-81.  https://doi.org/10.1016/S0303-2647(97)01708-5
  12. Gendreau M, Laporte G, and Semet F. (1998). A tabu search heuristic for the undirected selective travelling salesman problem, European Journal of Operational Research, 106(2-3), pp. 539-545. https://doi.org/10.1016/S0377-2217(97)00289-0
  13. Zhan S-H, Lin J, Zhang Z-J, and Zhong Y-W. (2016). List-based simulated annealing algorithm for traveling salesman problem, Computational Intelligence and Neuroscience, 2016, Article ID 1712630, 12 pages. 
  14. Wang K-P, Huang L, Zhou C-G, and Pang W. (2003). Particle swarm optimization for traveling salesman problem, Proceedings of the 2003 International Conference on Machine Learning and Cybernetics (IEEE Cat. No.03EX693), Xi'an, 3, pp. 1583-1585. 
  15. Ahmed ZH. (2014). The ordered clustered travelling salesman problem: A hybrid genetic algorithm, The Scientific World Journal, 2014, Article ID 258207, 13 pages. 
  16. Ahmed ZH. (2018). A hybrid algorithm combining lexisearch and genetic algorithms for the quadratic assignment problem, Cogent engineering, 5(1), Article No. 1423743. 
  17. Ahmed ZH. (2020). Genetic algorithm with comprehensive sequential constructive crossover for the travelling salesman problem, International Journal of Advanced Computer Science and Applications(IJACSA), 11(5), pp. 245-254. 
  18. Ahmed ZH. (2014). An improved genetic algorithm using adaptive mutation operator for the quadratic assignment problem, Proceedings of 37th International Conference on Telecommunications and Signal Processing 2014 (TSP 2014), Berlin, Germany, pp. 616-620. 
  19. Dantzig GB, Fulkerson DR, and Johnson SM. (1954). Solution of a Large-scale Travelling Salesman Problem, Operations Research, 2, pp. 393-410. 
  20. Pandit SNN. (1964). An Intelligent approach to Travelling Salesman Problem, Symposium in Operations Research, Khragpur: Indian Institute of Technology. 
  21. Balas E, and Tooth P. (1992). Branch and Bound method. In: Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A.H.G., Shmoys, D.B. (Eds.). The Travelling Salesman Problem. New York: Wiley, pp. 361-402. 
  22. Fogel DB. (1988). An evolutionary approach to the travelling salesman problem, Biological Cybernetics, 60(2), pp. 139-144.  https://doi.org/10.1007/BF00202901
  23. Kumar S, Munapo E, Lesaoana M, and Nyamugure P. (2018). A minimum spanning tree based heuristic for the travelling salesman tour, Opsearch, 55, pp. 150-164.  https://doi.org/10.1007/s12597-017-0318-5
  24. Akhand MAH, Ayon SI, Shahriyar SA, Siddique N, and Adeli H. (2019). Discrete spider monkey optimization for travelling salesman problem, Applied Soft Computing, 86, 105887. 
  25. Eremeev AV, and Kovalenko YV. (2020). A memetic algorithm with optimal recombination for the asymmetric travelling salesman problem, Memetic Computing, 12, pp. 23-36.  https://doi.org/10.1007/s12293-019-00291-4
  26. Panwar K, and Deep K. (2021). Discrete grey wolf optimizer for symmetric travelling salesman problem, Applied Soft Computing, 105, pp. 1-12. 
  27. Gharehchopogh FS, and Abdollahzadeh B. (2022). An efficient harris hawk optimization algorithm for solving the travelling salesman problem, Cluster Computing, 25, pp. 1981-2005.  https://doi.org/10.1007/s10586-021-03304-5
  28. Gao W. (2020). New ant colony optimization algorithm for travelling salesman problem, International Journal of Computing and Intelligence System, 13, pp. 44-55.  https://doi.org/10.2991/ijcis.d.200117.001
  29. Davis L. (1985). Job-shop scheduling with genetic algorithms, Proceedings of an International Conference on Genetic Algorithms and Their Applications, pp. 136-140. 
  30. Grefenstette JJ. (1987). Incorporating problem specific knowledge into genetic algorithms, In L. Davis (Ed.), Genetic algorithms and simulated annealing, London, UK: Pitman / Pearson, pp. 42-60. 
  31. Freisleben B, and Merz P. (1996). A genetic local search algorithm for solving symmetric and asymmetric traveling salesman problems, in Proceedings of the 1996 IEEE International Conference on Evolutionary Computation, Nagoya, Japan, pp.616-621. 
  32. Ahmed ZH. (2014). Improved genetic algorithms for the traveling salesman problem, International Journal of Process Management and Benchmarking, 4(1), pp. 109-124.  https://doi.org/10.1504/IJPMB.2014.059449
  33. Goldberg DE, and Lingle R. (1985). Alleles, loci and the travelling salesman problem, In J.J. Grefenstette (ed.) Proceedings of the 1st International Conference on Genetic Algorithms and Their Applications, Lawrence Erlbaum Associates, Hilladale, NJ. 
  34. Oliver IM, Smith DJ, and Holland JRC. (1987). A study of permutation crossover operators on the travelling salesman problem, In J.J. Grefenstette (ed.). Genetic Algorithms and Their Applications: Proceedings of the 2nd International Conference on Genetic Algorithms, Lawrence Erlbaum Associates, Hilladale, NJ. 
  35. Ahmed ZH (2010). A hybrid sequential constructive sampling algorithm for the bottleneck traveling salesman problem, International Journal of Computing and Intelligence Research, 6 , pp. 475-484.
  36. Ahmed ZH. (2015). A multi-parent genetic algorithm for the quadratic assignment problem, Opsearch, 52, pp. 714-7325.  https://doi.org/10.1007/s12597-015-0208-7
  37. Reinelt G. (1991). TSPLIB-A traveling salesman problem library, ORSA Journal on Computing, 3(4), pp. 376-384. (http://comopt.ifi.uni-heidelberg.de/software/TSPLIB95/ Accessed on 20th December 2023)  https://doi.org/10.1287/ijoc.3.4.376
  38. Ahmed ZH, Maleki F, Yousefikhoshbakht M, and Haron H. (2023). Solving the vehicle routing problem with time windows using modified football game algorithm, Egyptian Informatics Journal, 24(4), 100403.