The Use of Dijkstra's Algorithm in Determining the Shortest Path of Expedition in Bandarlampung
Integra: Journal of Integrated Mathematics and Computer Science · 2024
DOI: 10.26554/integrajimcs.20241323 ↗Kurz gefasst
Fachartikel in der Zeitschrift Integra: Journal of Integrated Mathematics and Computer Science, 2024. Verfasst von Adelia Assiva und 4 weiteren Autor:innen.
Abstract (Originalsprache)
Delivery of goods is a problem faced by freight forwarders/expedition companies. Determining an efficient route will determine the speed and cost of delivery. This is faced by most expedition companies, including one of the expedition companies in the city of Bandarlampung, namely the J&T Express expedition. There are 20 J&T Express branches in Bandarlampung city. If someone wants to send an item but one of the branches is closed or not available then he will try to determine the next closest branch. In this study, the shortest path from J&T on Pagar Alam to 19 other branches in Bandarlampung will be determined using Dijkstra’s Algorithm.
Zitieren
APA
Assiva, A., Puspita, R. M., Sihombing, R. R., Chasanah, S. L., & Mustika, M. (2024). The Use of Dijkstra's Algorithm in Determining the Shortest Path of Expedition in Bandarlampung. Integra: Journal of Integrated Mathematics and Computer Science. https://doi.org/10.26554/integrajimcs.20241323
Vancouver
Assiva A, Puspita RM, Sihombing RR, Chasanah SL, Mustika M. The Use of Dijkstra's Algorithm in Determining the Shortest Path of Expedition in Bandarlampung. Integra: Journal of Integrated Mathematics and Computer Science. 2024. doi:10.26554/integrajimcs.20241323
BibTeX
@article{Assiva2024,
author = {Assiva, Adelia and Puspita, Resta Meyliana and Sihombing, Riska Romauli and Chasanah, Siti Laelatul and Mustika, Mira},
title = {The Use of Dijkstra's Algorithm in Determining the Shortest Path of Expedition in Bandarlampung},
journal = {Integra: Journal of Integrated Mathematics and Computer Science},
year = {2024},
doi = {10.26554/integrajimcs.20241323}
}
EUVIMED