COMPARISON OF THE USE OF DYNAMIC PROGRAMMING ALGORITHM AND GENETIC ALGORITHM IN SOLVING THE TRAVELLING SALESMAN PROBLEM

Artificial Intelligence (AI) is a topic of great interest in research. One of the well-known problems is the TSP problem. The Traveling Salesman Problem (TSP) is a classic problem that is quite difficult to find a solution to. TSP problems are included in the NP Hard Problem category. Currently, several solution approaches have been found in the TSP. The well-known algorithms used for the solution approach are DP (Dynamic Programming) and GA (Genetic Algorithm). In this paper, the author wants to discuss the performance differences between the two algorithms. In the end, the author argues which algorithm is suitable for the TSP problem.