Proceedings of the 2nd International Seminar of Science and Applied Technology (ISSAT 2021)

<Previous Article In Volume
Next Article In Volume>

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

Authors
Anie Lusiani1, *, Euis Sartika2, Agus Binarto3, Endang Habinuddin3, Irfani Azis4
1Department of Mechanical Engineering, Politeknik Negeri Bandung, Bandung, 40559, Indonesia
2Department of Commercial Administration, Politeknik Negeri Bandung, Bandung, 40559, Indonesia
3Department of Electrical Engineering, Politeknik Negeri Bandung, Bandung, 40559, Indonesia
4Department of Mathematics, Universitas Pamulang, Tangerang Selatan, 15417, Indonesia
*Corresponding author. Email: anie.lusiani@polban.ac.id.
Corresponding Author
Anie Lusiani
Available Online 23 November 2021.
DOI
10.2991/aer.k.211106.039How to use a DOI?
Keywords
connected weighted graph; Dijkstra algorithm; fastest path; logistics distribution
Abstract

Dijkstra algorithm is one of the algorithms that is used to determine the path with the minimum total weight in the computer network, communication network, and transportation network problems. Some problems that have been studied using Dijkstra algorithm, namely multi-hop calibration of networked embedded system, achieving superior timing-driven routing trees and adaptive protection in microgrids. This article will determine the fastest path in the distribution of logistics by Bulog in West Java region by using Dijkstra algorithm manually and also by using Matlab. Data and information including the path connecting a warehouse to another Bulog warehouse will be used to build a connected weighted graph model. This data was obtained directly from Bulog office in West Java and through Google Maps application during the Covid-19 pandemic. Furthermore, path optimization is carried out by using Dijkstra algorithm, so that the fastest path tree is obtained. The fastest path tree is a path which edge set is a subset of the connected edge set of the connected weighted graph and has minimum total weight. Based on this optimization, the fastest path from Cibitung warehouse Bekasi to Bojong warehouse Cianjur is 154 minutes.

Copyright
© 2021 The Authors. Published by Atlantis Press International B.V.
Open Access
This is an open access article under the CC BY-NC license.

Download article (PDF)

<Previous Article In Volume
Next Article In Volume>
Volume Title
Proceedings of the 2nd International Seminar of Science and Applied Technology (ISSAT 2021)
Series
Advances in Engineering Research
Publication Date
23 November 2021
ISBN
10.2991/aer.k.211106.039
ISSN
2352-5401
DOI
10.2991/aer.k.211106.039How to use a DOI?
Copyright
© 2021 The Authors. Published by Atlantis Press International B.V.
Open Access
This is an open access article under the CC BY-NC license.

Cite this article

risenwbib
TY  - CONF
AU  - Anie Lusiani
AU  - Euis Sartika
AU  - Agus Binarto
AU  - Endang Habinuddin
AU  - Irfani Azis
PY  - 2021
DA  - 2021/11/23
TI  - Determination of the Fastest Path on Logistics Distribution by Using Dijkstra Algorithm
BT  - Proceedings of the 2nd International Seminar of Science and Applied Technology (ISSAT 2021)
PB  - Atlantis Press
SP  - 246
EP  - 250
SN  - 2352-5401
UR  - https://doi.org/10.2991/aer.k.211106.039
DO  - 10.2991/aer.k.211106.039
ID  - Lusiani2021
ER  -