Article Sidebar

Submitted
May 20, 2021
Accepted
July 5, 2021
Published
June 30, 2021
Download
PDF
Statistic
Read Counter : 853 Download : 555

Main Article Content

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 PathFloyd-Warshall Algorithm

Article Details

License

All articles published in the Eigen Mathematics Journal will be available for free reading and downloading. The license applied to this journal is Creative Commons Attribution-Non-Commercial-Share Alike (CC BY-NC-SA).

How to Cite
Febryantika, A. Z., Puspandini, F. A., Amalia, I. R., & Annisa, M. (2021). Application of the Floyd Warshall Algorithm in Determining the Shortest Route for Distribution of UD Nadira Cinta Rasa Bread to Praya, Central Lombok. EIGEN MATHEMATICS JOURNAL, 4(1), 18–23. https://doi.org/10.29303/emj.v4i1.96
Download Citation
Endnote/Zotero/Mendeley (RIS)
BibTeX

References

  1. Aprian, R. & Novandi, D. 2007. Perbandingan Algoritma Dijkstra dan Algoritma Floyd-Warshall dalam Penentuan Lintasan Terpendek. Konferensi Nasional Sistem Informasi, 1-6.
  2. Dewi, L. J. E. 2010. Pencarian Rute Terpendek Tempat Wisata Di Bali Dengan Menggunakan Algoritma Dijkstra. Seminar Nasional Aplikasi Teknologi Informasi 2010, 46-49.
  3. Levitin, A. 2012. Introduction to The Design & Analysis of Algorithms. 3rd Edition. Addison - Wesley: United States of America.
  4. Lubis, A. N. 2004. Peranan Saluran Distribusi Dalam Pemasaran Produk Dan Jasa. e-USU Repository, Universitas Sumatera Utara, 1-14.
  5. Munir, Rinaldi, 2005. Matematika Diskrit. Informatika Bandung, Bandung.
  6. Pawitri, K., Ayu, Y. dan Joko, P. 2007. Implementasi Algoritma Untuk Menemukan Lintasan Terpendek. Prosiding Seminar Nasional Teknologi 2007, 1-11.
  7. 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.
  8. 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.
  9. Wardiana, W. 2002. Perkembangan Teknologi Informasi di Indonesia. Seminar dan Pameran Teknologi Informasi, Universitas Komputer Indonesia.
  10. 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.

Similar Articles

1 2 > >> 

You may also start an advanced similarity search for this article.