Utilizing Dynamic Programming for Optional Shortest Route Determination

Winda Ade Fitriya B Winda; Andre Anusta Barus

doi:10.55227/ijhet.v2i3.163

Authors

Winda Ade Fitriya B Winda Universitas Cenderawasih
Andre Anusta Barus Pharmacy Study / Department of Pharmacy, Faculty of Pharmacy, Cenderawasih University, Indonesia

DOI:

https://doi.org/10.55227/ijhet.v2i3.163

Keywords:

Keywords: Dynamic programming; Optimal route; Costs minimization, Determination, Multistage graph

Abstract

Fuel prices have seen a significant increase. This encourages individuals to save costs on their fuel expenditure by finding the shortest route to their destination. The shorter the route, the less fuel will be released. This study answers the challenge of determining the shortest route between BTN Lembah Furia Sentani in Jayapura Regency to the Department of Mathematics of Cenderawasih University in Papua Province. Many roads can be passed from BTN Lembah Furia Sentani in Jayapura Regency, to the Department of Mathematics of Cenderawasih University in Papua Province. As is well known, that the streets in Jayapura City have many alternative roads with different characters. The existing road characteristics include density, physical condition of the road and the size of the road width. With the existing road character, it can be assumed that each road has an average travel length. This average value is used as the cost of the road. To solve this problem, a dynamic programming approach is used to identify optimal routes while minimizing costs. The dynamic program utilizes analyzed and calculated data to yield the best outcomes. The results indicate that the quickest path from BTN Lembah Furia Sentani to the Mathematics Department at Cenderawasih University is via Komba Netar Bridge, GKI Petrus Waena Church, covering a distance of 25.2 kilometers

Downloads

Download data is not yet available.

References

Ambarsari, E.W., Marlina, D., dan Susanto, A. Analisa Efektifitas Jalur Terpendek Dengan Menggunakan Algoritma Semut Dan Pendekatan LeadTime: Studi Kasus Toko Gamis Murah Jakarta. Laporan Pertanggung Jawaban Penelitian Hibah Dipa LPPM Unindra.Jakarta : LPPM Unindra. 2014.

A. A. Putra, I. T. Bandung, and J. G. Bandung, "Dynamic Programming Paradigm in Determining Fuel Oil Distribution Routes Based on Population Needs in a Region," no. 13510010, 2013.

Fathoni, M. and Triprabowo, Pencarian Rute Terpendek dengan Menggunakan Dynamic Programming, Universitas Airlangga, Surabaya

H. Yunus and S. Martha, "Dynamic Program Method for Solving Traveling Salesman Problem," Bul. Ilm. Mat. Stat. and Ter., vol. 04, no. 3, 2015.

Jumadi, "Determining the Shortest Route to Campus Using Dynamic Programming Algorithm," J. Istek, vol. VII, no. 1, 2014.

Kumar, R. (2011). Research Methodology: A Step-by-Step Guide for Beginners 3rd Edition. London: SAGE Publications Ltd.

Luknanto, D., Program Dinamik Jurusan Teknik Sipil Fakultas Tekik, Universitas Gajah Mada, Yogyakarta. 2013.

Munir. R., “Deskripsi Sistem. Edisi ke-2”. Bandung: Informatika. 2003.

M. N. Zein et al., "Application of Dynamic Programming to Determine the Optimum Path for Aquarium Ceps Fry Delivery," Bull. Appl. Ind. Eng. Theory, vol. 3, no. 1, 2022.

Nurhidayati, F., U., Penggunaan Program Dinamik untuk Menentukan Total Biaya Minimum pada Perencanaan Produksi dan Pengendalian Persediaan, Skripsi, Jurusan Matematika, Fakultas Sains dan Teknologim Universitas Islam Negeri Maula Malik Ibrahim, Malang. 2010.

Widyantoro, B., Arini, H. T. Sukmana, I. Muhamad Malik Matin, and D. Khairani, “The Effectiveness of forward-backward combination method in dynamic programming,” in 2021 Sixth International Conference on Informatics and Computing (ICIC), 2021, pp. 1–5, doi: 10.1109/ICIC54025.2021.9632910