Shortest Path from Bandar Tun Razak to Berjaya Times Square using Dijkstra Algorithm
Keywords:shortest path, Dijkstra algorithm, cost, time
The shortest path is an issue that involves the route from one point (nodes) to another. It is to find a path with a minimum travelling time. Nowadays, traffic problems have affected many transport users especially in Kuala Lumpur area. The time wasted on the road causes a lot of problems to the users. Furthermore, the costs between two destinations are rather expensive. Therefore, the inability of users to use the shortest path has attracted the researcher to propose several travel alternatives to overcome this problem. In addition, this study will help to improve the efficiency of the road and make people want to use it more often. The objectives of this study are to find the shortest path from Bandar Tun Razak to Berjaya Times Square and to cut down the cost between these two destinations. The time of the shortest path problem and the cost problem are drawn separately. Moreover, Dijkstra algorithm is applied to find the shortest path. The shortest path is calculated by using C programming of Dev C++. Nevertheless, both time and cost of shortest path are constructed in different paths. The time and cost of the journey are described by driving a car from Bandar Tun Razak to Lebuhraya SMART to Kampung Pandan, then Berjaya Times Square. The total time taken is 23 minutes (RM8.00), whereas, the cost is based on the shortest path from Bandar Tun Razak to Taman Maluri to Seasons Tower and Berjaya Times Square. The minimum cost is RM4.00 (30 minutes).
Arjun, Reddy, P., Shama, & Yamuna, M. (2015). Research on the optimization of Dijkstra’s algorithm and its applications. International Journal of Science, Technology & Management, 04 (01), 304-309.
Borissova, D., & Mustakerov, I. (2015). E-learning tool for visualization of shortest paths algorithms. Trends Journal of Sciences Research, 2(3), 84-89.
Chandak, A., Bodhale, R., & Burad, R. (2016). Optimal shortest path using HAS, a star and Dijkstra algorithm. Imperial Journal of Interdisciplinary Research (IJIR), 2(4), 978-980.
Gupta, N., Mangla, K., Jha, A. K., & Umar , M. (2016). Applying Dijkstra’s algorithm in routing process. International Journal of New Technology and Research (IJNTR),2(5), 122-124.
Jaafar, H., Zabidi, M. H., Soh, A.C., Hoong, T. P., Shafie, S., & Ahmad, A. (2014). Intelligent guidance parking system using modified Dijkstra’s algorithm. Journal of Engineering Science and Technology, 132-141.
Kai, N., Yao-ting, & Yue-peng, M. (2014). Shortest path analysis based on Dijkstra’s algorithm in emergency response system. TELKOMNIKA Indonesian Journal of Electrical Engineering, 12(5), 3476-3482.
Kumari, S.M., & Geethanjali, N. (2010). A survey on shortest path routing algorithms for public transport travel. Global Journal of Computer Science and Technology, 9(5), 73-76.
Patel, V., & ChitraBaggar. (2014). A survey paper of Bellman-Ford algorithm and Dijkstra’s algorithm for finding shortest path. International Journal of P2P Network Trends and Technology (IJPTT), 5, 1-4.
Tirastittam, P., & Waiyawuththanapoom, P. (2014). Public transport planning system by Dijkstra algorithm: Case study Bangkok metropolitan area. International Journal of Social, Behavioral, Educational, Economic, Business and Industrial Engineering, 8(1), 54-59.
How to Cite
Copyright (c) 2020 Nur Syuhada Muhammat Pazil, Norwaziah Mahmud, Siti Hafawati Jamaluddin
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.