SHORTEST ROUTE FOR DISTRIBUTION OF ELECTION LOGISTICS IN CILACAP REGENCY USING THE BRANCH AND BOUND ALGORITHM
Article Sidebar
Published:
Dec 20, 2023
Keywords:
Distribution of election logistics, graph, shortest route, Branch and Bound Algorithm
Main Article Content
Abstract
Distribution of election logistics requires a large budget. Therefore, distribution planning is needed to streamline the budget. One form of planning is in the form of planning the shortest distribution route. This research aims to determine the shortest route for distribution of election logistics in Cilacap Regency using the Branch and Bound Algorithm. Determining the distance between sub-districts in Cilacap Regency using the help of GoogleMaps. Based on the results of this research, the shortest route for distribution of election logistics in Cilacap Regency is 149.1 km for the first route and 335 km for the second route.
Downloads
Download data is not yet available.
Article Details
How to Cite
Mizan Ahmad, Riski Aspriyani, Nadzifah, & Umi Ma’rifah. (2023). SHORTEST ROUTE FOR DISTRIBUTION OF ELECTION LOGISTICS IN CILACAP REGENCY USING THE BRANCH AND BOUND ALGORITHM. PROCEEDING AL GHAZALI International Conference, 1, 229-241. https://doi.org/10.52802/aicp.v1i.814
Issue
Section
Articles
This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.
References
Margiyani, S., & Mussafi, N. S. M. (2014). Aplikasi Algoritma Branch and BoundUntuk Optimasi Jalur Pemadam Kebakaran Kota Yogyakarta. J. Fourier, 3(1), 59–66.
Prasetyo, Y. D. (2017). Penyelesaian Travelling Salesman Problem dengan Algoritma Branch and Bound. Jurnal Matematics Paedagodic, 1(2), 162–168. www.jurnal.una.ac.id/indeks/jmp
Purwanto, E. B. (2008). Perancangan dan Analisis Algoritma. Graha Ilmu.
Suyanto. (2010). Algoritma Optimasi Deterministik atau Probabistik. Graha Ilmu.
Zulkarnaen, W., et al. (2020). Pengembangan Supply Chain management dalam Pengelolaan Distribusi Logistik Pemilu Yang Lebih Tepat Jenis, Tepat Jumlah dan tepat Waktu berbasis Human Resources Competency Development di KPU Jawa Barat. 4(2), 222-243
Prasetyo, Y. D. (2017). Penyelesaian Travelling Salesman Problem dengan Algoritma Branch and Bound. Jurnal Matematics Paedagodic, 1(2), 162–168. www.jurnal.una.ac.id/indeks/jmp
Purwanto, E. B. (2008). Perancangan dan Analisis Algoritma. Graha Ilmu.
Suyanto. (2010). Algoritma Optimasi Deterministik atau Probabistik. Graha Ilmu.
Zulkarnaen, W., et al. (2020). Pengembangan Supply Chain management dalam Pengelolaan Distribusi Logistik Pemilu Yang Lebih Tepat Jenis, Tepat Jumlah dan tepat Waktu berbasis Human Resources Competency Development di KPU Jawa Barat. 4(2), 222-243