Abstract:
In this paper, we present three methods to solve the traveling salesman problem, which is the Np-hard problem. In fact, this problem was previously solved using classical methods, which suffered from shortcomings and unsatisfactory solutions. This problem was sought to be solved using modern optimization algorithms by three optimization algorithms were used to solve this problem: ( Genetic Algorithm, Brute Force, Dynamic Programming method). Performance was compared in terms of time and speed, and the dynamic programming method was the best in terms of performance. The numerical results in the optimization process were obtained by Python programming.
|