Penerapan metode Travelling Salesman Problem (TSP) dengan algoritma branch and bound pada optimasi rute terpendek distribusi surat di Dinas Pendidikan dan Kebudayaan Kota Malang
Abstract
In the modern world, time efficiency in organizations, including government institutions, is crucial. The Department of Education and Culture of Malang City faces challenges in distributing letters between work units quickly to ensure smooth administration. Therefore, finding an optimal route for letter distribution is essential. The Travelling Salesman Problem (TSP) is relevant to this issue, with the Branch and Bound Algorithm used to find the shortest route. This algorithm systematically explores all routes and eliminates unnecessary options, allowing the optimal solution to be reached more quickly. This research employs a quantitative approach and field study at the Department of Education and Culture of Malang City, resulting in the shortest route: Surat Menyurat → Umum → Ketenagaan → Keuangan → PAUD → Pendas → Perencanaan → Kebudayaan → Surat Menyurat, with a travel time of 12.5 minutes. The Branch and Bound Algorithm has proven effective in optimizing the letter distribution route. Future research is suggested to expand the study object to compare the accuracy of this algorithm in finding the shortest route.
Downloads
References
Amozhita, K. K., & Suyitno, A. (2019). Menyelesaikan Travelling Salesman Problem (TSP) dengan Metode Dua Sisi Optimal pada PT. Es Malindo Boyolali. Unnes Journal of Mathematics, 8(1), 20–29. https://journal.unnes.ac.id/sju/ujm/article/view/14620
Prasetya, A. E. (2019). Pencarian Rute Tercepat Mobil Ambulance Menggunakan Algoritma Ant Colony Optimization. JURIKOM (Jurnal Riset Komputer), 6(4), 381–388. http://www.ejurnal.stmikbudidarma.ac.id/index.php/jurikom/article/view/1252
Prasetyo, Y. D. (2017). Penyelesaian Travelling Salesman Problem Dengan Algoritma Branch And Bound. Jurnal Mathematics Paedagogic, 1, 162–168. https://core.ac.uk/download/pdf/268618048.pdf
Sugianti, N., Mardhiyah, A., & Fadilah, N. R. (2020). Komparasi kinerja algoritma BFS, Dijkstra, Greedy BFS, dan A* dalam melakukan pathfinding. JISKA (Jurnal Informatika Sunan Kalijaga), 5(3), 194–205. http://repository.uin-malang.ac.id/13288/
Suryanto, M. H., & SE, M. (2016). Sistem operasional manajemen distribusi. Jakarta: Grasindo. https://perpussmadaberau.sch.id/uploaded_files/temporary/DigitalCollection/MDM5MDJkZmZlMTM2MGU5ZDcwODY3N2NhNTZkNDNjZjVlYzZjMTk0MQ==.pdf
Syihabuddin, R. F., Jauhari, M. N., Khudzaifah, M., & Fahmi, H. (2022). Implementasi algoritma A-Star dalam menentukan rute terpendek destinasi wisata Kota Malang. Jurnal Riset Mahasiswa Matematika, 1(5), Article 5. https://ejournal.uin-malang.ac.id/index.php/jrmm/article/view/14497
Yuliastuti, G. E., Mahmudy, W. F., & Rizki, A. M. (2017). Penanganan Fuzzy Time Window pada Travelling Salesman Problem (TSP) dengan Penerapan Algoritma Genetika. MATICS: Jurnal Ilmu Komputer dan Teknologi Informasi (Journal of Computer Science and Information Technology), 9(1), Article 1. https://ejournal.uin-malang.ac.id/index.php/saintek/article/view/4072
Copyright (c) 2024 Sulastri Sulastri
This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.
- Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement 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 acknowledgement 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.
