An algorithm for solving the traveling salesman problem

Abstract EN

The main objective of the paper is to present an algorithm for finding a solution to the traveling salesman problem.

The solution found by the algorithm being an optimal one or not, depends on the values ofthe elements of the cost matrix.

The algorithm is described and its time complexity is calculated and compared to other algorithms in the literature.

It is shown that the proposed algorithm is efficient as it finds the solution in shoner time if compared to other algorithms.