Application of the Floyd Warshall Algorithm in Determining the Shortest Route for Distribution of UD Nadira Cinta Rasa Bread to Praya, Central Lombok

Annisa Zaen Febryantika, Fidyatnisa Alyunda Puspandini, Indah Rizqiana Amalia, Maya Annisa

Abstract


Optimizing the shortest route is needed by a company in the process of distributing goods to consumers. This optimization can help companies optimize the mileage and costs from source to destination. In this study, the shortest route method used is the Floyd-Warshall algorithm to determine the shortest route. Floyd-Warshall algorithm can compare all the possible paths in the graph for each side of all vertices it passes with the minimum number. Based on the calculation results of this study, the shortest route was obtained from Mataram as the source and Praya as the destination was 31 km.

Keywords


The Shortest Path; Floyd-Warshall Algorithm

Full Text:

PDF

References


Aprian, R. & Novandi, D. 2007. Perbandingan Algoritma Dijkstra dan Algoritma Floyd-Warshall dalam Penentuan Lintasan Terpendek. Konferensi Nasional Sistem Informasi, 1-6.

Dewi, L. J. E. 2010. Pencarian Rute Terpendek Tempat Wisata Di Bali Dengan Menggunakan Algoritma Dijkstra. Seminar Nasional Aplikasi Teknologi Informasi 2010, 46-49.

Levitin, A. 2012. Introduction to The Design & Analysis of Algorithms. 3rd Edition. Addison - Wesley: United States of America.

Lubis, A. N. 2004. Peranan Saluran Distribusi Dalam Pemasaran Produk Dan Jasa. e-USU Repository, Universitas Sumatera Utara, 1-14.

Munir, Rinaldi, 2005. Matematika Diskrit. Informatika Bandung, Bandung.

Pawitri, K., Ayu, Y. dan Joko, P. 2007. Implementasi Algoritma Untuk Menemukan Lintasan Terpendek. Prosiding Seminar Nasional Teknologi 2007, 1-11.

Saputra, Ragil. 2011. Sistem Informasi Geografis Pencarian Rute Optimum Obyek Wisata Kota Yogyakarta Dengan Algoritma Floyd-Warshall. Jurnal Matematika Vol. 14, No. 1, 19-24.

Setiawan, V., Mariatul Kiftiah, dan Woro Budiartini, 2017. Analisis Algoritma Floyd Warshall Untuk Menentukan Lintasan Terpendek Pengangkutan Sampah. Buletin Ilmiah Matematika. Statistika, dan Terapannya 6(3) : 221- 230.

Wardiana, W. 2002. Perkembangan Teknologi Informasi di Indonesia. Seminar dan Pameran Teknologi Informasi, Universitas Komputer Indonesia.

Widya, N. F., dan Tatyantoro Andrasto. 2016. Penerapan Algoritma Floyd Warshall dalam Menentukan Rute Terpendek pada Pemodelan Jaringan Pariwisata Kota Semarang. Jurnal Teknik Elektro 8(1) : 21-22.




DOI: https://doi.org/10.29303/emj.v4i1.96

Refbacks

  • There are currently no refbacks.


Copyright (c) 2021

Creative Commons License
This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.

Creative Commons License
This work is licensed under a Creative Commons Attribution 4.0 International LicensePreserved in LOCKSS, based at Stanford University Libraries, United Kingdom, through PKP Private LOCKSS Network program.


Indexed by:

      

e-ISSN : 2615-3270 || p-ISSN : 2615-3599