Determination of the Fastest Path on Logistics Distribution by Using Dijkstra Algorithm

Lusiani, Anie; Sartika, Euis; Binarto, Agus; Habinuddin, Endang; Azis, Irfani

doi:10.2991/aer.k.211106.039

Cited by 3 publications

(3 citation statements)

References 5 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Karena algoritma tersebut menggunakan titik awal, sehingga sesuai digunakan untuk menentukan MST pada sistem jaringan air. Penelitian terkait dapat ditemukan dijurnal Sari, Rina Fili, dkk [10], B, Fitriya Winda Ade et all [11], Nugraha, Deny Wiria [12], Lusiani, Ani et all [13].…”

Section: Pendahuluanunclassified

Optimasi Jaringan Distribusi Air di Desa Gombolharjo Menggunakan Algoritma Prim

Ilahy,

Ahmad,

Hartono

2023

JaMES

View full text Add to dashboard Cite

Perumdam Tirta Wijaya merupakan perusahaan yang bergerak dibidang penyediaan air bersih. Salah satu hal yang penting dalam pendistribusian air bersih adalah jaringan pipa. Jaringan pipa yang terpasang harus dibuat seminimal mungkin untuk mendistribusikan air secara merata. Oleh karena itu, penelitian ini bertujuan untuk menentukan rute terpendek pada jaringan pipa di Gombolharjo Kecamatan Kesugihan Kabupaten Cilacap dengan menggunakan Algortima Prim’s. Berdasarkan hasil penelitian ini, diperoleh total pipa sepanjang 5706 m.

show abstract

Section: Pendahuluanunclassified

Optimasi Jaringan Distribusi Air di Desa Gombolharjo Menggunakan Algoritma Prim

Ilahy,

Ahmad,

Hartono

2023

JaMES

View full text Add to dashboard Cite

show abstract

“…As an application in graph theory, a study has been conducted by Ginting et al in 2019 on delivery simulation using the Dijkstra algorithm to solve the problem of traveling salesmen (Ginting, Osmond, and Aditsania 2019). Dijkstra algorithm can also be used to determine current policies and calculate IRL (inverse reinforcement learning) gradients in considering the characteristics of food delivery routes (Liu et al 2020), determine the fastest path in logistics distribution by Bulog in the West Java region (Lusiani, Sartika, Binarto, et al 2021), and solve the shortest path problem with fuzzy arc lengths (Deng et al 2012). The application of graphs as models to a problem is not only in determining the shortest path and the fastest path.…”

Section: Introductionmentioning

confidence: 99%

DIJKSTRA ALGORITHM IN DETERMINING THE SHORTEST ROUTE FOR DELIVERY SERVICE BY J&T EXPRESS IN BANDUNG

Lusiani,

Purwaningsih,

Sartika

2023

SCI TECH ED MATH

View full text Add to dashboard Cite

The determination of the shortest route can be done using various methods, one of which is the Dijkstra algorithm. This algorithm is often used in routing problems with minimum weight in computer networks, communication networks and transportation networks. There are several applications of the Djikstra algorithm, namely solving the problem of the shortest path of neutrosophy, mapping tourism potential, and developing geographic information systems in the health sector. In this research, Dijkstra algorithm will be applied to optimize the mileage of the delivery of goods packages. Data and information namely the address, weight and number of customer packages carried by a courier in one delivery trip are obtained from the drop point of PT. J&T Express in Sarijadi area of Bandung City. Meanwhile, data about mileage is obtained from the Google Maps application. All this data is used to construct an initial model graph that is a connected weighted graph, where the location of a drop point or a customer is a vertex and a road connecting two locations is an edge on the graph. The weight in this graph is the mileage from the drop point to the customers or from one customer to another. Then, the Djikstra algorithm is run on this graph where the drop point is the starting point of the route, so that the courier visits all customers and returns again to the drop point. The resulting route is a cycle in the graph which is the shortest closed route at 1890 meters.

show abstract

“…Several related studies regarding the shortest route are the Fuzzy Dijkstra Algorithm [5], the Dijkstra Algorithm for the Traveling Salesman Problem [6], Finding the shortest path using a Minimum Spanning Tree with several algorithms [7,9,10,11], and Logistics Distribution using Dijkstra Algorithm [8].…”

Section: Introductionmentioning

confidence: 99%

On Finding Shortest Path Over Vocational High School in Yogyakarta Based on Graph Theory Algorithm

Rahmadi

2023

MJMF

View full text Add to dashboard Cite

Finding shortest path is one of problem in graph theory. This research aims to apply the Dijkstra algorithm in determining the shortest route for State Vocational School (SMK) students throughout Yogyakarta. State Vocational Schools throughout Yogyakarta have several locations spread across various regions, and determining the shortest path is crucial for the efficiency of students' time and transportation. Dijkstra's algorithm was chosen because of its ability to find the shortest path in a weighted graph, which can be applied to complex networks of school trajectories. The research method involved collecting geographic data on schools, available transportation, and distance between locations. This data is used to build a weighted graph that represents the transportation network between State Vocational Schools throughout Yogyakarta. The implementation of Dijkstra's algorithm is then carried out using python programming language. We hope that the research results can provide mapping of the shortest routes between schools, minimize student travel time, and increase transportation efficiency. The practical implications of this research include the development of an information system or application that can help students, teachers and schools in planning daily trips. Apart from that, the research results can also be a basis for developing methods for determining the shortest route in the context of other schools or similar environments.

show abstract

Determination of the Fastest Path on Logistics Distribution by Using Dijkstra Algorithm

Cited by 3 publications

References 5 publications

Optimasi Jaringan Distribusi Air di Desa Gombolharjo Menggunakan Algoritma Prim

Optimasi Jaringan Distribusi Air di Desa Gombolharjo Menggunakan Algoritma Prim

DIJKSTRA ALGORITHM IN DETERMINING THE SHORTEST ROUTE FOR DELIVERY SERVICE BY J&T EXPRESS IN BANDUNG

On Finding Shortest Path Over Vocational High School in Yogyakarta Based on Graph Theory Algorithm

Contact Info

Product

Resources

About