SHORTEST ROUTE OPTIMIZATION FOR CILACAP ELECTION LOGISTICS VIA BRANCH AND BOUND
Keywords:
Distribution of election logistics, graph, shortest route, Branch and Bound AlgorithmAbstract
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 the distribution of election logistics in the Cilacap Regency using the Branch and Bound Algorithm. Determining the distance between sub-districts in Cilacap Regency using the help of Google Maps. Based on the results of this research, the shortest route for the distribution of election logistics in Cilacap Regency is 149.1 km for the first route and 338,3 km for the second route.
References
Ardipandanto, A. (2019). Permasalahan Penyelenggaraan Pemilu Serentak Tahun 2019. Jurnal Ilmu Pemerintahan, 11(11), 25–30.
Bawaslu. (2019). Pemutakhiran Indeks Kerawanan Pemilu 2019. Bawaslu.
Margiyani, S., & Mussafi, N. S. M. (2014). Aplikasi Algoritma Branch and Bound untuk Optimasi Jalur Pemadam Kebakaran Kota Yogyakarta. J. Fourier, 3(1), 59–66. www.fourier.or.id
Mariska, R., Kusmanto, H., & Fadli, F. (2021). Analisis Distribusi Logistik pada Pemilu 2019 di Kota Medan. PERSPEKTIF, 10(1), 110–119. https://doi.org/10.31289/perspektif.v10i1.4143
Melina Sari, G., Maini Heryanto, R., & Santoso, S. (2020). Penentuan Rute Distribusi Menggunakan Model Integer Linear Programming dengan Metode Branch and Bound. Go-Integratif : Jurnal Teknik Sistem Dan Industri, 1(01), 69–79. https://doi.org/10.35261/gijtsi.v1i01.4265
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.
Rosa, W. R., Suhartono, & Wibawa, H. A. (2012). Penentuan Jalur Terpendek pada Pelayanan Agen Travel Khusus Pengantaraan Wilayah Semarang Berbasis SIG dengan Algoritma Branch And Bound. Journal of Informatics and Technology, 1(1), 63–71.
Simarmata, J. E., Rosmaini, E., & Napitupulu, N. (2020). Penerapan Algoritma pada Persoalan Pedagang Keliling (Travelling Salesman Problem). Range: Jurnal Pendidikan Matematika, 1(2), 111–121.
Suyanto. (2010). Algoritma Optimasi Deterministik atau Probabistik. Graha Ilmu.
Wulansari, T., Aditya, M., & Fauzi, M. (2020). Penentuan Rute Optimal Distribusi Paving Block dengan Metode Branch and Bound. Jurnal Teknik Industri, 6(2), 66–71.
