IMPLEMENTASI ALGORITMA KOLONI SEMUT PADA TRAVELING SALESMAN PROBLEM MENGGUNAKAN MATLAB 7.8
-
Wenefrida Tulit Ina(1*)
Teknik Elektro FST Undana
-
Molina O. Odja(2)
Universitas Nusa Cendana
(*) Corresponding Author
Abstract
Ant algorithm is a methodology, that is generated through the observation of theants. In Ant algorithm, ants serveas an agent assigned to find a solution to a problem the shortest route. Ant algorithm has been applied in many fields, one of which is to see a solution in the search for the shortest routeto theTraveling Salesman Problem (TSP).
Research conducted Ant algorithm is to make an application to the determination of the shortest distanceas the coding matlab program in the selection of the shortest route in order to help determine the shortest distance from a trajectory.
The test results showed Shortest Route Program applications using ant algorithm with alarge value of Alpha=1.0; Beta=1.0; Rho=0.5andT-Beginning =0:01with city coordinates[10 0; 300; 15,20; 25,20; 1030; 30,30] withthe number of iterations or 10cycles to obtain the path length of the shortest path length=1-3-5-6-4-2so that the shortest path is: 103.5917cm.
Effects of changes in the variation of the experiment Rho. Rho smallest value obtained for a total of 10 cycles or iterations with the shortes tpath length is103.5917. At Rho: 12:50 with a large average value of 3 times the trial time calculation is: 3.815sec.
Downloads
References
Diana Fallo, “Pencarian Jalur Terpen-dek Menggunakan Algoritma Colony Opti-mization”, Jurnal JUKANTI, Vol.1 No.1, Maret 2018
Guardio Eraniola, Endang Suhen-dar,”Menentukan Rute Kendaraan PT. Sa-rana Cahaya Makmur Dengan Metode Al-goritma Ant Colony Optimization”,Jurnal IKRA-ITH TEKNOLOGI, Vol.5. No.1, Maret 2021 .
Karjono, Moedjiono, Denni Kur-niawan,”Ant Colony Optimization”, Jurnal TICOM, Vol.4 No.3, mei 2016.
Sugiarto Cokrowibowo, Ismail, Indra, “Multiple Teaveling Salesman Problem Menggunakan Algoritma Ant Colony Opti-mization dengan Operasi Elitism”, Jurnal JCIS, Vol1 Issue 2, Okrober 2019, Hal : 23-28. ISSN (print) : 2622-5859, ISSN (online) ; 2622-0881.
WenefridaT. Ina, Sarlince Manu, Thomas M,” Penerapan Algoritma Genetika Pada Traveling Salesman Problem (Studi Kasus Pedagang Perabot keliling”, Jurnal Media Elektro, Vol. 8 No.1. April 2019. ISSN : 2252-6692.
Euis Nurlaelasari, Supriyadi, U.T. lengga-na,”Penerapan Algoritma Ant Colony Optimiza-tion Menentukan Nilai Optimal Dalam memilih Objek Wisata berbasis Android”, Jurnal SIME-TRIS, Vol.9 No.1, April 2018. ISSN : 2252-4983, Hal : 287- 298
Lutfi E. Prasetyo, Istiadi, Fitri Marisa, “Sistem Op-timasi Pendistribusian Bahan Makanan dan Snack dengan Algoritma Ant Colony Optimization (ACO)”, Jurnal AITI , Vol. 18 No.1, Februari 2021. ISSN : 1693-8348. E-ISSN : 2615-7128
Kristiawan Nugroho, “Penggunaan Algoritma semut untuk penentuan Optimisasi Jalur TIM Marketing”, Jurnal INFOKAM, No. II, September 2015. Hal: 92 – 95.
Deny W. Nugraha, Albecht Y.E. Dodu, Stevi Septi-ana, “Sistem Penentuan Rute Pendistribusian Produk air mineral menggunakan Algoritma ant Colont System”, Jurnal Terakreditasi ILKOM, Vol.11 No.2, Agustus 2019, p-ISSN : 2087-1716, e-ISSN : 2548-7779. Hal : 86-94
Rini Amalia, “ Pencarian Jalur Terpendek Menggunakan Ant Colony System (Kasus: Pari-wisata Kota Bogor)”, Jurnal Faktor Exacta vol.8 No.4, 2015. Hal : 290-304. ISSN : 1979-276X.
This work is licensed under CC BY-SA 4.0
