Algoritma Dijkstra dan Algoritma Greedy Untuk Optimasi Rute Pengiriman Barang Pada Kantor Pos Gorontalo

Novria Fatmawati Lakutu; Sri Lestari Mahmud; Muhammad Rifai Katili; Nisky Imansyah Yahya

doi:10.34312/euler.v11i1.18244

Algoritma Dijkstra dan Algoritma Greedy Untuk Optimasi Rute Pengiriman Barang Pada Kantor Pos Gorontalo

Novria Fatmawati Lakutu, Sri Lestari Mahmud, Muhammad Rifai Katili, Nisky Imansyah Yahya

Abstract

Delivery of goods is one of the services used in the online buying and selling process at the Post Office company. Companies need a performance in the distribution of goods that is more time-consuming and cost-efficient, so it requires determination in selecting the shortest path. Many algorithms have been used to help find the shortest path for distributing goods, including the Dijkstra Algorithm and the Greedy Algorithm. In this study, the application of the two algorithms is to find routes between sub-districts that are the destination of goods delivery, then compare to see which algorithm is more optimal. Based on the calculation results, the Dijkstra Algorithm can provide a more optimal solution with a total mileage obtained of 304.90 Km, while the Greedy Algorithm produces a total distance of 441.60 Km.

Keywords

Shortest Route; Dijkstra Algorithm; Greedy Algorithm

Full Text:

PDF

References

L. Maro, and L. K. S. Purab, "Penerapan Konsep Pewarnaan Graf dalam Penyusunan Jadwal Perkuliahan Menggunakan Metode AlgoritmaWelch-Powell pada Program Studi Teknik Informatika Fakultas Matematika dan Ilmu Pengetahuan Alam Universitas Tribuana Kalabahi," Jurnal Ilmiah Wahana Pendidikan (JIWP), vol. 7, no. 6, pp. 193-197, 2021. doi: https://doi.org/10.5281/zenodo.5574383.

J. Siang, Matematika Diskrit dan Aplikasinya pada Ilmu Komputer. Yogyakarta: Andi, 2009.

N. Nurdianti, Penerapan Algoritma Greedy Untuk Menentukan Rute Terpendek Antar Klinik Gigi. Skripsi: Universitas Islam Negeri Sumatra Utara, 2020.

M. K. Harahap, and N. Khairina, "Pencarian Jalur Terpendek dengan Algoritma Dijkstra. SinkrOn, vol. 2, no. 2, p. 18, 2017. doi: https://doi.org/10.33395/sinkron.v2i2.61

I. K. Budayasa, Teori Graph dan Aplikasinya. Surabaya: Unesa University Press, 2007.

Y. D. Mahendra, N. Nuryanto, and A. Burhanuddin, "Sistem Penentuan Jarak Terdekat Dalam Pengiriman Darah Di Pmi Kota Semarang Dengan Metode Algoritma Greedy," Jurnal Komtika, vol. 2, no. 2, pp. 136-142, 2019. doi: https://doi.org/10.31603/komtika.v2i2.2601

Y. Darnita, and R. Toyib, "Penerapan Algoritma Greedy Dalam Pencarian Jalur Terpendek Pada Instansi-Instasi Penting Di Kota Argamakmur Kabupaten Bengkulu Utara," Jurnal Media Infotama, vol. 15, no. 2, pp. 57-64, 2019. doi: https://doi.org/10.37676/jmi.v15i2.867

Pos Indonesia, http://www.posindonesia.co.id/index.php/profil-perusahaan/sejarah-pos, 2017.

M. Z. Usman, and T. Oktiarso, "Implementasi Algoritma Greedy Untuk Menyelesaikan Travelling Salesman Problem di Distributor PT. Z," Journal of Integrated System, vol. 1, no. 2, pp. 216-229, 2019. doi: https://doi.org/10.28932/jis.v1i2.1049

A. Cantona, F. Fauziah, and W. Winarsih, "Implementasi Algoritma Dijkstra Pada Pencarian Rute Terpendek ke Museum di Jakarta," Jurnal Teknologi Dan Manajemen Informatika, vol. 6, no. 1, pp. 27-34, 2020. doi: https://doi.org/10.26905/jtmi.v6i1.3837

N. Nurwan, W. E. Pranata, M. R. F. Payu, and N. I. Yahya, "Implementation of Dijkstra Algorithm and Welch-Powell Algorithm for Optimal Solution of Campus Bus Transportation. Jurnal Matematika MANTIK, vol. 7, no. 1, pp. 31-40, 2021. doi: https://doi.org/10.15642/mantik.2021.7.1.31-40

F. N. Arviantino, W. Gata, L. Kurniawati, Y. A. Setiawan, and D. Priansyah, "Penerapan Algoritma Greedy Dalam Pencarian Jalur Terpendek Pada Masjid-Masjid Di Kota Samarinda," Metik Jurnal, vol. 5, no. 1, pp. 8-11, 2021. doi: https://doi.org/10.47002/metik.v5i1.188

J. S. Iskandar, and Y. F. Riti, "Perbandingan Algoritma Greedy dan Algoritma Dijkstra dalam Pencarian Rute Terpendek dari Kabupaten Tuban ke Kota Surabaya," PETIK: Jurnal Pendidikan Teknologi Informasi dan Komunikasi, vol. 8, no. 2, pp. 96-106, 2022. doi: https://doi.org/10.31980/jpetik.v8i2.1756

F. Hartanto, and Y. Safitri, "Rancang bangun aplikasi pencarian lokasi wisata Kota Bogor Menggunakan algoritma Greedy Berbasis Android," Jurnal Techno Nusa Mandiri, vol. 11, no. 2, pp. 169-175, 2014.

S. Oktaviana, and A. Naufal, "Algoritma Greedy untuk Optimalisasi Ruangan dalam Penyusunan Jadwal Perkuliahan," Multinetics, vol. 3, no. 1, pp. 54-59, 2017. doi: https://doi.org/10.32722/vol3.no1.2017.pp54-59

DOI: https://doi.org/10.34312/euler.v11i1.18244

Refbacks

There are currently no refbacks.

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

Euler: Jurnal Ilmiah Matematika, Sains dan Teknologi is indexed, registered, or discoverable through:

EDITORIAL OFFICE OF EULER: JURNAL ILMIAH MATEMATIKA, SAINS DAN TEKNOLOGI
	Department of Mathematics, Faculty of Mathematics and Natural Sciences, Universitas Negeri Gorontalo Jl. Prof. Dr. Ing. B. J. Habibie, Tilongkabila, Kabupaten Bone Bolango, Gorontalo 96554, Indonesia
	Email: [email protected]
	+62 87777-586462 (WhatsApp Only)
	Euler: Jurnal Ilmiah Matematika, Sains dan Teknologi p-ISSN: 2087-9393 \| e-ISSN: 2776-3706 Published by Department of Mathematics , Universitas Negeri Gorontalo, Indonesia. Article Copyright: Copyright in individual published articles is retained by the respective authors. Authors grant Euler the non-exclusive right of first publication. Article License: All published articles are distributed under the Creative Commons Attribution-NonCommercial 4.0 International License (CC BY-NC 4.0) . This license permits sharing and adaptation for noncommercial purposes with appropriate attribution. Website Copyright: Copyright notices applying to the journal website or its administrative content are separate from the copyright and licensing terms of individual published articles. For further information, please refer to the Copyright Notice and Open Access Policy . Powered by Public Knowledge Project OJS .

Username
Password
Remember me