Aplikasi Algoritma Semut Pada Penentuan Rute Terpendek Sistem Pengangkutan Sampah Kota Makassar
DOI:
https://doi.org/10.61220/jmsa.v1i1.20241.58Keywords:
Rute Terpendek, Algoritma Semut, TPAAbstract
Waste management is one of the problems faced by the City of Makassar, so an effective and efficient system is needed for more regular waste transportation at each TPA. This study aims to optimize the waste transportation system in Makassar City by determining the shortest route. The research method was carried out by taking 8 TPA points and determining the optimal shortest route using the ant algorithm. The ant algorithm is an algorithm adopted from the behavior of ant colonies. The application of the ant algorithm shows the result in the form of the optimal shortest route with a route length of 40.2 km with the route V5→V1→V4→V7→V6→V2→V8→V5. The calculation is based on the use of one starting point, where the starting point is the center of route determination to various landfills.
Downloads
References
[1] A.P Windarto and Sudirman, “Penerapan Algoritma Semut dalam Penentuan
Distribusi Jalur Pipa Pengolahan Air Bersih,” Jurnal Sistem Informasi Bisnis., vol.
8, iss. 2, pp. 123-132, 2018, doi: 10.21456.
[2] D. Udjulawa dan S. Oktarina, “Penerapan Algoritma Ant Colony Optimization
untuk Pencarian Rute Terpendek Lokasi Wisata (Studi Kasus Wisata di Kota
Palembang),” Jurnal Ilmu Komputer, vol. 3, no. 1, 2022, EISSN:2774-6151.
[3] I. Mutakhiroh, Indrato and T. Hidayat T, “Pencarian Jalur Terpendek
Menggunakan Algoritma Semut”, in Seminar Nasional Aplikasi Teknologi Informasi,
ISSN: 1907-5022.Yogyakarta, 2007.
[4] M. Dorigo and T. Stutzle,” Ant Colony Optimization”, A Bradford book., The MIT
Press Cambridge, Massachussetts London, England, 2004.
[5] Nurwan, Ahmad N, & Hasan Z., “Optimasi Rute Armada Kebersihan Kota
Gorontalo Menggunakan Ant Colony Optimization”, Jurnal media Informatika,
Gorontalo, 2011.





Email : ljmsa@lontaradigitech.com