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

@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},
  }