The Comparison of Dijsktra’s Algorithm and Flyod Warshall’s Algorithm to Determine The Shortest Path of Traditional Markets in Bandar Lampung City

Poetri Hana Nurhandayani, Wamiliana Wamiliana, Misgiyati Misgiyati, Notiragayu Notiragayu, Muslim Ansori

Abstract


Determining the shortest path between one location to another location is one of the problems that usually has to be faced in daily life. The shortest path will affect the shorter time needed, less money used, and others. In this study, we will discuss the comparison of Dijsktra’s Algorithm and Floyd Warshal’s Algorithm to determine the shortest path of the biggest and the most famous traditional market in Bandar Lampung City, which is Bambu Kuning traditional market, to 26 other traditional markets in Bandar Lampung city. The Phyton programming language is used to implement both algorithms on the data of 27 traditional markets. The results show that both algorithms give the same solution. However, the processing time of Dijsktra’s Algorithm (0.1063 seconds) is faster than Floyd Warshal’s algorithm (0.1691 seconds)


Keywords


Shortest Path; Dijkstra’s Algorithm; Floyd Warshall’s Algorithm; traditional market

Full Text:

PDF

References


A. R. Aulia, Wamiliana, Asmiati, and Notiragayu. “Perbandingan Algoritme Dijkstra dan Algoritme A* (A-Star) dalam Penentuan Lintasan Terpendek dari Dinas Pendidikan Provinsi Lampung ke Beberapa Sekolah Menengah Atas (SMA) Negeri di Provinsi Lampung”, Jurnal Pepadun, Vol. 1 No. 2, pp. 182-190, 2023.

Deo, N. (2004).Graph Theory With Application to Engineering and Computer Science: Prentice Hall of India, Ltd.

Schrijver, A. (2012). "On the history of the shortest path problem" Documenta Mathematica., Documenta Mathematica Series: 155–167.

doi:10.4171/dms/6/19. ISBN 978-3-936609-58-5.

Putriani, A.D., Wamiliana, and Chasanah S. L., ” Comparison of the Dijkstra’s Algorithm and the Floyd Warshall’s Algorithm to Determine The Shortest Path between Hospitals in Several Cities in Lampung Province”, Journal of Mathematical Sciences and Optimization, Vol. 1 No. 2, pp. 44-52, 2024.

Cantona, A., Fauziah, F., and Winarsih, W. “Implementasi Algoritma Dijkstra Pada Pencarian Lintasan Terpendek ke Museum di Jakarta”, Jurnal Teknologi dan Manajemen Informatika, 6(1), 27-34, 2020.

N. Kai, Z. Yao-Ting, and M. Yue-Peng.” Shortest Path Analysis Based on Dijkstra’s Algorithm in Emergency Response System”, Telkomnika Indonesian Journal of Electrical Engineering, Vol. 12 No. 5, 3476-3482, 2014.

Darnita, Y., Toyib, R., and Rinaldi, R. ”Implementasi Algoritma Floyd Warshall Untuk Menentukan Letak Dan Lokasi Perusahaan Travel/Rental Mobil Di Kota Bengkulu”, Pseudocode, 4(2), 144-155, 2017.

A. Fadillah, S. H. Mansyur, and Purnawansyah.” Analisis Perbandingan Algoritma Floyd-Warshall Dan A Star (A*) Dalam Penentuan Lintasan Terpendek”, Jurnal Teknik Informatika dan Sistem Informasi, Vol. 9 No. 4, p.2736-2751, 2022.

T.S. Dermawan, "Comparison of Dijkstra Dan Floyd-Warshall Algorithm to Determine the Best Route of Train." International Journal on Informatics for Development, vol. 7, no. 2, pp. 54-58, 2018. doi:10.14421/ijid.2018.07202

Risald, A. E. Mirino, and Suyoto, "Best routes selection using Dijkstra and Floyd-Warshall algorithm," 2017 11th International Conference on Information & Communication Technology and System (ICTS), Surabaya, Indonesia, pp. 155-158, 2017. doi: 10.1109/ICTS.2017.8265662




DOI: http://dx.doi.org/10.36448/jsit.v15i1.3714

Refbacks

  • There are currently no refbacks.


About the JournalJournal PoliciesAuthor Information

Explore: Jurnal Sistem Informasi dan Telematika (Telekomunikasi, Multimedia dan Informatika)
e-ISSN: 2686-181X
Website: http://jurnal.ubl.ac.id/index.php/explore
Email: explore@ubl.ac.id
Published by: Pusat Studi Teknologi Informasi, Fakultas Ilmu Komputer, Universitas Bandar Lampung
Office: Jalan Zainal Abidin Pagar Alam No 89, Gedong Meneng, Bandar Lampung, Indonesia

This work is licensed under a Creative Commons Attribution 4.0 International License
Technical Support by:  RYE Education Hub