SOLVING SHORTEST ROUTE USING DYNAMIC PROGRAMMING PROBLEM | Asian Journal of Mathematics

Dynamic programming is a strategy for breaking down a given problem into a series of smaller challenges, or phases. There are a number of choice possibilities, or states, at each stage. As a result, dynamic programming employs the recursive equation concept to solve the travelling salesman (road network) problem. The Traveling salesman (network) problem is a well-known problem in mathematics and computer science because it is simple to understand but difficult to solve with forward and backward recursive equations. Researchers in this paper evaluate the many approaches available to solve the travelling salesman or network problem, but focus on the arrow drawing method to assess the temporal complexities. Thus, determining the shortest and longest path between two specified locations in a road network using the arrow drawing approach is an important and straightforward way to discover applications in many map services. This paper presents a dynamic programming implementation of the travelling salesman or road network issue that generates an optimal solution.

Please see the link :- https://www.ikprress.org/index.php/AJOMCOR/article/view/6448