Euler : Jurnal Ilmiah Matematika, Sains dan Teknologi
EULER: Volume 11 Issue 1 June 2023

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

Novria Fatmawati Lakutu (Department of Mathematics, Universitas Negeri Gorontalo)
Sri Lestari Mahmud (Department of Mathematics, Universitas Negeri Gorontalo)
Muhammad Rifai Katili (Department of Mathematics, Universitas Negeri Gorontalo)
Nisky Imansyah Yahya (Department of Mathematics, Universitas Negeri Gorontalo)



Article Info

Publish Date
01 Jun 2023

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.

Copyrights © 2023






Journal Info

Abbrev

Euler

Publisher

Subject

Computer Science & IT Mathematics

Description

Euler : Jurnal Ilmiah Matematika, Sains dan Teknologi is a national journal intended as a communication forum for mathematicians and other scientists from many practitioners who use mathematics in the research. Euler disseminates new research results in all areas of mathematics and their ...