Review of Algorithms to Solve Travelling Salesman Problem

References

[1] Asani, et al (2020). A construction tour technique for solving the travelling salesman problem based on convex hull and nearest neighbor heuristics. International Conference on Mathematics, Computer Engineering and Computer Science, 1–4.

[2] Asani, et al (2024). A Novel Insertion Solution for the Travelling Salesman Problem. Computers, Materials & Continua.

[3] Babel, (2020). New heuristic algorithms for the Dublin traveling salesman problem. Journal of Heuristics.

[4] Bernardino and Paias (2018). Solving the family traveling salesman problem. European Journal of Operational Research. 267 (2).

[5] Donald and Magdalena (2020). Traveling Salesman Problem – An Overview. Introductory chapter. DOI:10.5772/intechopen.94435.

[6] Fadhillah, et al (2017). Solving travelling salesman problem using heuristics approaches. Journal of Global Research in Computer Science/

[7] Farid, et al (2022). Implementation of Cheapest Insertion Heuristic Algorithm in Determining Shortest Delivery Route. International Journal of Global Research, 3(2), 37–45.

[8] Hoffman, et al (2016). Traveling Salesman Problem. Encyclopedia of Operation Research and Management Science. Pp. 1573 – 1578.

[9] Krari, et al (2021). A pre – processing reduction method for the generalized travelling salesman problem. European Journal of Operation Research. 21(11)

[10] Kumar, et al (2012). A Genetic Algorithm Approach to study travelling salesman problem. Journal of Global Research in Computer Science. 3(3):33-8

[11] Laha, et al (2016). Nature – Inspired Metaheuristics for optimizing Information Dissemination in Vehicular Networks. TECNALIA Research and Innovation, Derio, Spain.

[12] Lity, et al (2022). Travelling salesman problem. An overview of Application. International Journal of Advanced Research in Education Technology.

[13] Malik and Muhammad (2015). Heuristic Approaches to solve travelling salesman problem. TELKOMNIKA Indonesian Journal of Electrical Engineering. 15(2). Pp. 390-396

[14] Nemani, et al (2021). Algorithms and Optimization techniques for solving traveling salesman problem

[15] Ono, et al (2020). A criteria – based approach to the travelling salesman problem. Western Decision Science Journal. Librarian Publications and Presentations. 143.

[16] Rahman, et al (2024). Improvement of the Nearest Neighbor Heuristic Search Algorithm for Travelling Salesman Problem. Journal of Engineering Advancements, 5(1), 19–26.

[17] Rao, et al (2024). Literature survey on travelling salesman problem using genetic algorithms/ International Journal of Advanced Research in Education Technology. 26, pp. 503 – 530.

[18] Sathya and Muthukumaravel (2015). A review of the optimization algorithms on travelling salesman problem. Indian journal of science and technology. 8(29)

[19] Sharma and Dutta (2015). Review of Algorithms to solve travelling salesman problem. Journal of Basic and Applied Engineering Research. 2(18), pp. 1612-1616.

[20] Sundar and Rathinam (2016). Generalized multiple depots traveling salesman problem. Computers and Operation Research. 70

[21] Tawanda, et al (2023). A labelling Method for the Travelling Salesman Problem. Journals of Applied Sciences. 13(11)/ 103390/app13116417.

[22] Yuan, et al (2020). A branch and Cut algorithms for the generalized travelling salesman problem. European Journal of Operational Research. 286(3)

[23] Zhu, et al (2022). Algorithm for Solving Traveling Salesman Problem Based on Self – Organizing Mapping Network. Journal of Shanghai Jiaotong University (Science). 29. Pp. 463 – 470

@article{1707258,
      author = {Ogbuloko Vincent Eche, Aderemi Elisha Okeyinka, Ibrahim Abdullahi, Abdulganiyu Abdulrahman},
      title = {Review of Algorithms to Solve Travelling Salesman Problem},
      journal = {Iconic Research And Engineering Journals},
      year = {2025},
      volume = {8},
      number = {8},
      pages = {635-638},
      issn = {2456-8880},
      url = {https://www.irejournals.com/formatedpaper/1707258.pdf},
      abstract = {The Travelling Salesman Problem (TSP) is a popular optimization problem in which shortest path of the salesperson travelling to all cities once and returning to the origin city is to be determined. This is done either by using exact algorithms or heuristic algorithms. The main concern with exact algorithms is that; exact algorithms can produce optimal solution but are always not practicable due to complexity of combinatorial optimization problem which are mostly NP- hard and the constraint of time. Therefore, TSP is solved using various heuristic algorithms which produce good enough but not necessarily optimal solution in reasonable time and drastically cuts down the solution space. This paper presents a review of different algorithms to solve TSP and find the shortest path through all the cities that the salesperson has to travel.},
      keywords = {Combinatorial Optimization, Exact Algorithm, Heuristic Algorithm, TSP, NNH, NIH, FIH, CIH, RIH, NP ? Hard.},
      month = {February},
  }