Travel Salesman Problem Using Dynamic Programming

Abstract

In the fields of operations research and computer science, the traveling salesman problem (also known as TSP) is a classic algorithmic issue. One method for solving TSP is dynamic programming, which identifies the optimal path at the lowest possible cost. It starts by determining the shortest path between two points, and then it expands to identify routes to other sites. In order to solve the Travel salesman Problem, Dynamic Programming was used in this study as a a solution technique. In addition to a real-world application from AM-EXPRESS NIGERIA LIMITED, illustrative examples of travel salesman difficulties were taken into consideration and handled utilizing the dynamic programming technique. The finding's outcome showed that the least amount of money needed to provide logistical services is ₦6500, and the shortest possible paths or routes were found.