Traveling Salesman Algorithms Complexity
Fatima Thaher · International Journal of Computer Applications · 2019
The travelling salesman problem (TSP) is widely studied in computer science.There is a practical importance, and can be applied to solve many practical daily lives problems, so many algorithms developed to solve this problem, each with its efficient.Insertion, genetic, greedy, greedy 2-opts and nearest neighbor, are all algorithms used to solve (TSP).This paper will study these algorithms and present the main diff erences between these algorithms according to its complexity, and which one is the most efficient to solve the (TSP)