Towards Comparative Analysis of the Complexity of Tour Construction Heuristics for Solving the Travelling Salesman Problem

References

[1] Amarbir, (2016). A Review on Algorithms used to solve Multiple Travelling Salesman Problem. International Research Journal of Engineering and Technology (IRJET), 3(4), 598–603.

[2] Anitha, and Sandeep, (2015). Literature Survey om Travelling Salesman Problem Using Genetic Algorithms. International Journal of Advanced Research in Education Technology (IJARET), 2(1).

[3] 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.

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

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

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

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

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

[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] Yuan, et al (2020). A branch and Cut algorithms for the generalized travelling salesman problem. European Journal of Operational Research. 286(3)

@article{1707218,
      author = {Ogbuloko Vincent Eche, Aderemi Elisha Okeyinka, Ibrahim Abdullahi, Abdulganiyu Abdulrahman},
      title = {Towards Comparative Analysis of the Complexity of Tour Construction Heuristics for Solving the Travelling Salesman Problem},
      journal = {Iconic Research And Engineering Journals},
      year = {2025},
      volume = {8},
      number = {8},
      pages = {543-553},
      issn = {2456-8880},
      url = {https://www.irejournals.com/formatedpaper/1707218.pdf},
      abstract = {The Travelling Salesman Problem (TSP) is a Combinatorial Optimization Problem (COPs) which has gained wide attention of computer scientists specifically because it is simple to define but very difficult to solve. For instance, when traveling (delivering) to seven cities, there could be up to 720 possible routes to consider, so finding the most efficient and feasible route requires evaluating every possible route, which is a computationally challenging task. TSP is NP - hard and does not have an effective polynomial - time solution, so effective heuristic methods are needed to solve it. This paper presents a comparative analysis of complexity of five tour construction algorithms for solving the travelling salesman problem.},
      keywords = {Combinatorial Optimization, TSP, NP - hard, Heuristics, NNH, NIH, FIH, CIH, RIH, Nodes, Edges.},
      month = {February},
  }