Year: 2022
Type: article
Abstract: Objective:- To determine the shortest distance in salesman of dynamic programming problem. Method:- Recursive equation and arrow drawing methods are used to determine the shortest distance in salesman of dynamic programming problem. An implementation of the traveling salesman problem using dynamic programming is presented in this study which generates optimal answer. Findings:- Forward and backward recursive methods take time and complex to find optimal solution (shortest distance) but arrow drawing method is useful and simple for solving several different types of salesman problems in dynamic programming problem compared to forward and backward recursive equation method to determine shortest route in dynamic programming problem. Novelty:- Dynamic programming allows to break up the given problem into a number of sub problems or stages. At each stage there are a number of decision alternatives to be called as states. So the dynamic programming uses the idea of recursive equation to solve traveling salesman problem. The Traveling salesman problem is easy to understand and difficult to solve using forward and backward recursive equation. Keywords: Dynamic programming; Salesman problem; Operation research; Recursion equation
Author: Tadios Kiros Kenea
Institution: Arba Minch University
Language: English
Subfield: Industrial and Manufacturing Engineering
Field: Engineering
Domain: Physical Sciences
Open Access status: diamond
OpenAlex ID: W4294084455