merged

Study on Shortest Path Problem:
A Case Study in Universiti Malaysia Terengganu
Ng Yoke Ching
Supervisor: Dr. Ahmad Termimi Bin Ab Ghani
Bachelor of Science (Computational Mathematics)
School of Informatics and Applied Mathematics
Shortest path problem is that path in which the sum of weighted or the included edges
is minimum. Apply the shortest path algorithm in a routing system can solve a lot of
problems that happen on road for example traffic jam, lack of parking place, etc. All these
problems occurred in many places including Universiti Malaysia Terengganu (UMT).
Hence, due to these reasons, bicycle lane is suggested to implement along the road in
UMT. Bicycle’ routing is the priority problem while travelling from one place to another
place in communication networks. The shortest path or shortest distance between place
to place can be found through studied a few algorithms. For example Dijkstra’s Algorithm
and Bellman-Ford Algorithm. In the end of this research, Dijkstra algorithm, Bellman-Ford
algorithm and Floyd-Warshall algorithm will be studied, investigated and compared to
find the most suitable shortest path algorithm that can be applied for bicycle lane in UMT.
959 | UMT UNDERGRADUATE RESEARCH DAY 2018