Penerapan Algoritma Ant Colony Optimization (ACO) Rute Jalur Terpendek (Studi Kasus Distribusi Barang JNE Wilayah Bumi Tamalanrea Permai (BTP))
DOI:
https://doi.org/10.24252/msa.v12i1.50753Keywords:
Graph Theory, Ant Colony Optimization Algorithm, Shortest Path RoutingAbstract
Pendistribusian barang dari produsen ke konsumen dilakukan oleh jasa kurir. Seorang kurir diharapkan mampu mengantarkan paket kiriman dengan mempertimbangkan estimasi penghematan waktu dan jarak tempuh, sehingga mendukung pekerjaannya lebih efektif dan cepat tentunya menghemat biaya perjalanan. Pada umumnya pencarian jalur terpendek menjadi solusi yang diberikan. Pencarian lintasan terpendek dibagi menjadi dua metode, yaitu metode konvensional dan metode heuristik. Pada metode heuristik terdapat beberapa algoritma, salah satunya adalah algoritma Ant Colony Optimization. Algoritma ini didasarkan pada perilaku semut. Secara alamiah, koloni semut dapat menemukan rute terpendek dalam perjalanan dari sarang ke tempat sumber makanan. Koloni semut dapat menemukan rute terpendek antara sarang dan sumber makanan berdasarkan jejak kaki pada jalur yang dilalui. Semakin banyak semut yang melewati sebuah jalur, semakin jelas jejak kaki yang ada. Algoritma ini sangat cocok digunakan untuk menyelesaikan masalah optimasi, salah satunya adalah menentukan jalur terpendek.
Penelitian ini bertujuan untuk memudahkan kurir untuk mengambil keputusan dalam menentukan lokasi jalur yang akan dilalui. Terdapat enam jumlah lokasi yang digunakan. Pada situasi ini, penggunaan algoritma ant colony optimization terbatas pada satu siklus atau satu iterasi (NC=1), sehingga rute terbaik diperoleh sementara siklus pertama yaitu GOR Prof Tahir Djide ( ) menuju Panti Asuhan Al Muhtadina ( ) menuju Rumah Yatim Makassar ( ) menuju Lapangan Tala BTP/GLT ( ) menuju Rusunawa Kodam XIV/Hsn ( ) menuju Pabrik Produksi Roti Tawar Bandung Makassar ( ) lalu kembali pada titik pertama GOR Prof Tahir Djide ( ) dengan jarak tempuh sepanjang 7,9 km. ( ).
References
Batmetan, J. R. (2016). Algoritma Ant Colony Optimization (ACO) untuk pemilihan jalur tercepat evakuasi bencana Gunung Lokon Sulawesi Utara. Jurnal Teknologi Informasi, 14(1), 31–48.
Dorigo, M., & Stützle, T. (2004). Ant colony optimization. In A Bradford Book The MIT Press Cambridge, Massachusetts London, England. https://mitpress.mit.edu/books/ant-colony-optimization
Hasmawati. (2016). Bahan Ajar Bahan Ajar Bahan Ajar. In Hasanuddin University Repository. http://repository.upy.ac.id/6374/1/BAHAN-AJAR-SEJARAH-PERADABAN-BARAT-KLASIK-2023.pdf
Lisdiarto, A., & Winarti, W. (2023). Penerapan Metode Ant Colony Optimization Untuk Menentukan Jalur Distribusi Di PT. Indomarco Adi Prima. Teknik Dan Multimedia, 1(4), 938–946.
Maryati, I., & Wibowo, H. K. (2012). Optimasi penentuan rute kendaraan pada sistem distribusi barang dengan ant colony optimization. Semanticscholar, 163–168.
Mutakhiroh, I., Indrato, & Hidayat, T. (2007). Pencarian Jalur Terpendek Menggunakan Algoritma Semut. Seminar Nasional Aplikasi Teknologi Informasi. 81-85.
Mutakhiroh, I., Saptono, F., Hasanah, N., & Wiryadinata, R. (2007). Pemanfaatan Metode Heuristik Dalam Pencarian Jalur Terpendek Dengan Algoritma Semut dan Algoritma Genetika. SNATI (Seminar Nasional Aplikasi Teknologi Informasi) 2007, 2007(Snati), B33–B39. http://journal.uii.ac.id/index.php/Snati/article/viewFile/1623/1398
Nugraha, D. C., & Khadafi, S. (2021). Penerapan Travelling Salesman Problem Untuk Optimasi Jarak Jalur Kurir Menggunakan Algoritma Ant Colony Optimization (Aco). Seminar Nasional Sains Dan Teknologi Terapan IX 2021, 259–266.
Nurlaelasari, E., Supriiyadi, & Lenggana, U. T. (2018). Penerapan Algoritma Ant Colony Optimization Menentukan Nilai Optimal dalam Memilih Objek Wisata Berbasis Android. Jurnal Simetris, 9(1), 287–298.
Sianturi, R. Y. C., Rahayudi, B., & Widodo, A. W. (2021). Implementasi Algoritma Ant Colony Optimization untuk Optimasi Rute Distribusi Produk Kebutuhan Pokok dari Toko Sasana Bonafide Mojoroto . Jurnal Pengembangan Teknologi Informasi Dan Ilmu Komputer, 5(7), 3190–3197.
Wahyuningsih, D., Syahreza, E. (2018). Shortest Path search Futsal Field Location with Dijkstra Algorithm. IJCCS. 12(2), 161-170.
Windarto, A. P., & Sudirman. (2018). Penerapan Algoritma Semut Dalam Penentuan Distribusi Jalur Pipa Pengolahan Air Bersih. Jurnal Sistem Informasi Bisnis, 8(2), 9. https://doi.org/10.21456/vol8iss2pp9-18
Downloads
Published
How to Cite
Issue
Section
License
Copyright Notice
Jurnal MSA (Matematika dan Statistika serta Aplikasinya)
Authors who publish in Jurnal MSA agree to the following copyright and licensing terms.
1. Copyright Ownership
Authors retain copyright in their scholarly articles unless copyright is lawfully held by another authorized rights holder.
Publication in Jurnal MSA does not require an exclusive transfer or assignment of copyright ownership to the journal or its publisher.
2. Non-Exclusive Publishing Rights
Authors or authorized copyright holders grant Jurnal MSA non-exclusive rights of first journal publication, dissemination, indexing, and digital preservation.
These rights allow the journal to publish, reproduce, distribute, archive, and preserve the accepted scholarly article without transferring copyright ownership.
3. Publication License
Jurnal MSA adopts and applies the Creative Commons Attribution 4.0 International License (CC BY 4.0) as the standard license for scholarly articles published under its current publication terms.
Authors or authorized rights holders authorize publication of their articles under CC BY 4.0.
This license permits sharing, reproduction, redistribution, adaptation, and reuse, including commercial reuse, subject to the license terms and attribution requirements.
Official License:
https://creativecommons.org/licenses/by/4.0/
4. Non-Commercial Publishing Model
Jurnal MSA operates as a non-commercial scholarly publisher dedicated to education, scientific research, and scholarly communication.
The journal's non-commercial status does not restrict commercial reuse of articles licensed under CC BY 4.0.
5. Authors' Rights and Self-Archiving
Authors retain their applicable rights to reuse, share, and disseminate their scholarly works.
Authors may immediately deposit and distribute the published version of their CC BY 4.0-licensed articles through institutional repositories, disciplinary repositories, and academic websites without an embargo imposed by the journal.
Such distribution remains subject to the applicable license and third-party rights.
6. Author Consent and Third-Party Rights
By agreeing to publication, the corresponding author confirms that:
-
All listed authors have approved the manuscript and the publication arrangements.
-
The authors or authorized rights holders possess the legal authority necessary to authorize publication and licensing.
-
Jurnal MSA is granted the necessary non-exclusive publishing rights.
-
Publication of the article under CC BY 4.0 is authorized.
-
Required permissions for third-party materials have been obtained, and any licensing exclusions have been clearly identified.
7. Previously Published Articles
Articles published before the implementation of the current licensing policy remain governed by their validly applicable copyright and licensing arrangements.
The adoption of CC BY 4.0 does not automatically change licenses previously granted under different terms.
Copyright and License Statement
Copyright © [Year], The Author(s).
The author(s) retain copyright and grant Jurnal MSA non-exclusive rights of first publication, dissemination, indexing, and preservation.
This article is licensed under the Creative Commons Attribution 4.0 International License (CC BY 4.0).