Penerapan Program Dinamik dalam Menentukan Rute Optimal Perjalanan dari Pematangsiantar Menuju Samosir
-
Linda Puspa Ayu Simarmata
*
Universitas HKBP Nommensen Pematangsiantar,
Indonesia
- Intan Sitanggang Universitas HKBP Nommensen Pematangsiantar, Indonesia
- Mira Andini Universitas HKBP Nommensen Pematangsiantar, Indonesia
- Barthy Ladi C. Sirait Universitas HKBP Nommensen Pematangsiantar, Indonesia (*) Corresponding Author
Abstract
A tourist area with many roads often makes it difficult for someone to determine the optimal route, both in terms of distance or costs incurred from the place of origin to the destination. Moreover, in determining a decision support system to determine the route of a tourist trip is needed to determine the optimal route so that the costs incurred are minimum. To solve the problem in this article, we use the dynamic programming method where the method used is the forward method. With the aim of determining the fastest distance from Siantar to Samosir so that the minimum costs incurred. Dynamic Program (dynamic programming) is a method of solving problems by decomposing the solution into a set (stage), such that the solution to the problem can be viewed as a series of interrelated decisions. The solution used is dynamic programming with the data that has been obtained then processed and calculated so that the results obtained are optimal, It is known from the results of the calculation analysis, it can be concluded that the shortest route for tourist trips from Siantar to Samosir, namely from Siantar then to Sidamanik, then to Tomok, continuing to Simanindo, then to Pangururan until finally to Tele with a distance of about 116,2 km /h.
Downloads
References
E. Christian Rufus, R. Rizkyaka Riyadi, D. Nugraha Hasibuan, E. Christian, dan V. Handrianus Pranatawijaya, “Penerapan Algoritma Dijkstra Dalam Menentukan Rute Terpendek Untuk Jasa Pengiriman Barang Di Palangka Raya,” JATI (Jurnal Mhs. Tek. Inform., vol. 8, no. 3, hal. 3387–3391, 2024, doi: 10.36040/jati.v8i3.9683.
D. R. Aprilliando, “Implementasi algoritma uniform cost search (UCS) untuk menentukan rute terpendek.” Universitas Islam Negeri Maulana Malik Ibrahim, 2023.
L. Kusniawati dan P. A. Wicaksono, “OPTIMASI RUTE PENGIRIMAN BAHAN BAKU CKD PART DENGAN PENDEKATAN CAPACITATED VEHICLE ROUTING PROBLEMS (CVRP) DI PT XYZ,” Ind. Eng. Online J., vol. 12, no. 4, 2023.
M. N. Zein et al., “Penerapan Program Dinamis Untuk Menentukan Jalur Yang Optimum Dalam Pengiriman Benih Ikan Ceps Aquarium,” Bull. Appl. Ind. Eng. Theory, vol. 3, no. 1, hal. 34–39, 2022.
B. D. Febrianti et al., “IMPLEMENTASI ALGORITMA ANT COLONY DALAM MENENTUKAN RUTE,” vol. 9, no. 1, hal. 243–249, 2025.
R. Wahyudi, A. Sanjaya, dan U. Mahdiyah, “Implementasi Dynamic Programming Dalam Menentukan Rute Pengiriman Paket,” vol. 8, hal. 960–967, 2024.
F. N. Hidayat, B. D. Ferdinan, R. Saputra, E. Christian, dan V. H. Pranatawijaya, “Penerapan Algoritma Dynamic Programming Dalam Penentuan Prioritas Pengerjaan Tugas Kuliah Mahasiswa,” hal. 190–198, 2024.
A. Elsa, A. M. Panjaitan, dan T. N. Sipayung, “Penerapan Program Dinamik dalam Menentukan Jalur Perjalanan Optimum dengan Prosedur Backward Recursive Equation,” J. Educ., vol. 5, no. 2, hal. 4217–4225, 2023, doi: 10.31004/joe.v5i2.1133.
R. S. Sinaga dan A. Syahmarani, “OPTIMISASI RUTE CPO MENGGUNAKAN TEKNIK PROGRAM DINAMIK,” Sci. J. Ilm. Sains dan Teknol., vol. 2, no. 7, hal. 262–272, 2024.
I. A. F. Untuk, M. Rute, T. Destinasi, dan W. Lahuan, “UNNES Journal of Mathematics,” vol. 10, no. 1, hal. 75–84, 2021.
M. Iqbal et al., “Perancangan Peta Rute Wisata sebagai Alat Pemasaran bagi Desa Wisata di Subang Selatan,” J-Dinamika J. Pengabdi. Masy., vol. 9, no. 1, hal. 75–80, 2024.
M. A. Rahman dan M. Y. Saputra, “Kegiatan TUR Pemanduan Sejarah Sebagai Wisata Edukasi Dan Promosi Rute Pasar 16 Kolaborasi Bersama PLGGoodGuide,” vol. 2, no. November, hal. 114–125, 2024.
N. F. Lakutu, S. L. Mahmud, M. R. Katili, dan N. I. Yahya, “Algoritma Dijkstra dan Algoritma Greedy Untuk Optimasi Rute Pengiriman Barang Pada Kantor Pos Gorontalo,” Euler J. Ilm. Mat. Sains dan Teknol., vol. 11, no. 1, hal. 55–65, 2023, doi: 10.34312/euler.v11i1.18244.
A. B. M. H. Heriansyah, R. Rizwar, M. Rafliansyah, E. Christian, dan V. H. Pranatawijaya, “Penerapan Algoritma Prim dalam Menentukan Rute Prioritas Pengiriman Paket Express,” J. Islam. Glob. Netw. Inf. Technol. Entrep., vol. 2, no. 3, hal. 21–33, 2024.
M. N. Zein et al., “Penerapan Program Dinamis Untuk Menentukan Jalur Yang Optimum Dalam Pengiriman Benih Ikan Ceps Aquarium,” Bull. Appl. Ind. Eng. Theory, vol. 3, no. 1, 2022.
C. RAWUNG, P. F. Opit, dan R. F. I. Rottie, “OPTIMASI STRATEGI UNTUK MUATAN BARANG DENGAN ALGORITMA PROGRAM DINAMIS PADA KNAPSACK (Studi Kasus: PT. Tole Farm Desa Pinilih, Kec. Dimembe, Kab. Minut, Kota Manado.).” UNIVERSITAS KATOLIK DE LA SALLE MANADO, 2023.
G. N. Ramadhan dan R. K. A. A. S. Bachrun, “Penerapan algoritma Dijkstra Untuk menentukan Rute Terpendek Tempat Tinggal Ke Kampus 2 Uin Sunan Ampel Surabaya,” Indones. J. Bus. Intell., vol. 7, no. 1, hal. 1–6, 2024.
P. A. Y. U. SIHALOHO, “PENGGUNAAN PROGRAM DINAMIK UNTUK MENENTUKAN TOTAL BIAYA MINIMUM PADA PERENCANAAN PRODUKSI DAN PENGENDALIAN PERSEDIAAN DI UD. SIMBERS.” FAKULTAS TEKNIK, UNIVERSITAS ISLAM SUMATERA UTARA, 2024.
S. V. Agnezia dan W. Winarno, “Penentuan rute terpendek dalam pengiriman pallet kayu menggunakan programa dinamis,” J. Ind. Serv., vol. 7, no. 2, hal. 221, 2022, doi: 10.36055/jiss.v7i2.13911.
R. F. Oktanugraha dan S. R. Nudin, “Implementasi Algoritma A* (A Star) dalam Penentuan Rute Terpendek yang Dapat Dilalui Non Player Character pada Game Good Thief,” J. Informatics Comput. Sci., vol. 2, no. 01, hal. 74–85, 2020, doi: 10.26740/jinacs.v2n01.p74-85.
M. C. Bunaen, H. Pratiwi, dan Y. F. Riti, “Penerapan Algoritma Dijkstra Untuk Menentukan RuteTerpendek Dari Pusat Kota Surabaya Ke Tempat Bersejarah,” J. Teknol. Dan Sist. Inf. Bisnis, vol. 4, no. 1, hal. 213–223, 2022.
Bila bermanfaat silahkan share artikel ini
Berikan Komentar Anda terhadap artikel Penerapan Program Dinamik dalam Menentukan Rute Optimal Perjalanan dari Pematangsiantar Menuju Samosir
Pages: 1464-1470
Copyright (c) 2025 Linda Puspa Ayu Simarmata, Intan Sitanggang, Mira Andini, Barthy Ladi C. Sirait
This work is licensed under a Creative Commons Attribution 4.0 International License.
Authors who publish with this journal agree to the following terms:
- Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under Creative Commons Attribution 4.0 International License that allows others to share the work with an acknowledgment of the work's authorship and initial publication in this journal.
- Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgment of its initial publication in this journal.
- Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (Refer to The Effect of Open Access).
