Publication Date : 12 August, 2022 Indian Journal of Science and Technology MSG456: MATHEMATICAL
PROGRAMMING
SOLVING SHORTEST ROUTE USING Presented by Group 3 :
DYNAMIC PROGRAMMING PROBLEM
1. Law Sim Boey (159317)
2. Lee Shen Shien (157638)
BY TADIOS KIROS KENEA 3. Lee Xin Yong (158581)
4. Lovina Chia Anak Majang (157493)
INTRODUCTION 5. Pang Xuan (159388)
Dynamic programming (DP) 6. Phoon Sai Hung (156508)
determine the optimum solution by decomposing into single variable sub problem Presented for:
optimization process involves one variable only [Link] Binti Awang
Arrow Drawing Method (ADM)
simple and short time taking to solve the dynamic programming problem compared to recursive equation
OBJECTIVE
Bayesian Network To determine the shortest distance
graph-based model of joint multivariate probability distributions that captures properties of conditional in salesman of dynamic
independence between variables programming problem.
effective for describing complex stochastic processes and learning from (noisy) observations
Network completion Computationally
modify the network by minimum amount of modifications
intractable for certain
Boolen network is used for theoretical analysis of computational complexity and sample complexity
structures & High
Integer linear programming
computational cost
for completion of signaling pathway
could not handle addition of edges
METHODOLOGY RESULT AND DISCUSSION
By DP:
Numerical Example:
A salesman located in a city A decides to travel city J. A highway network map is
drew as below. The city of origin is A and the destination is J. The salesman will
have to pass through cities B to I. The arrow represents routes between cities and
distances in km are indicated on each route. The salesman problem is to find
shortest route from A to J. To address TSP, simpler and more efficient methods are
DP (The Shortest Path) and ADM.
By ADM:
The value of certain dynamic shortest paths from City A to City J are
CONCLUSION AND FUTURE WORK
DP used (Backward Recursive Method) in this study, the same as what we
learned in this course. with distance of 20.
Modified methods: Both forward and backward recursion are time-consuming, complex,
a. Forward Recursive Method: and involve at least 21 lines.
b. Arrow-Drawing Method Arrow-drawing method is simpler, faster, and effective for solving
DP may perform better when adding or removing a node at the front or shortest and longest path problems, it covers 18 lines only, making it
back. ideal for applications like map services.
ADM may perform better when adding or removing a shortest path node in Arrow-drawing is a user-friendly and efficient alternative to recursive
the middle of the problem. methods for solving dynamic programming problems like TSP.
