Simulasi Lintasan Terpendek pada Graf Komplit Menggunakan Ant Colony Optimization Algorithm

Ami Riana, Hermawan Syahputra

Abstract


This study aims to build a shortest path simulation program on the complete graph K_20. The data of distance in this simulation was determined randomly with the provision of a value of 0-100. The simulation conducted was an algorithm calculation used parameter values with different initial pheromone conditions. The parameters in the Ant Colony Optimization Algorithm are set with alpha = 1, beta = 2, the initial pheromone condition = 0,0001 for the first simulation; alpha = 1, beta = 2, initial pheromone = 1 for the second simulation; and alpha value = 1, beta = 5, initial pheromone condition = 0,00000001 for the third simulation. The simulation results showed that if the value of the initial pheromone condition used gets greater, the value of the temporary output gets greater. Even though the initial pheromone condition was different, the shortest path obtained with distance data used in this study is the same, namely 15-14-1-3-20-12-16-6-18-10-9-13-11-7-8-4-2-17-5-19 with length 613 (in kilometers). [THE SHORTEST PATH SIMULATION IN COMPLETE GRAPHS USING THE ANT COLONY OPTIMIZATION ALGORITHM](J. Sains Indon., 42(2): 44-51, 2018)

Keywords:
Ant Colony Optimization Algorithm, Complete Graph, Shortest Path


Full Text:

PDF

References


Belalawe, Benyamin J., M. d. A. F. S., (2012): Penentuan Jalur Wisata Terpendek Menggunakan Metode Forward Chaining (Studi Kasus Dinas Pariwisata Kota Kupang), Prosiding Seminar Nasional Informatika,.

Berlianty, I. d. M. A., (2010): Teknik-teknik Optimasi Heuristik, Graha Ilmu, Yogyakarta.

Dorigo, M., dan Stutzle, T., (2004): Ant Colony Optimization, Massachusetts Institute of Technology, London.

Intan, B., dan Arifin, M., (2010): Teknik-teknik Optimasi Heuristik, I, Graha Ilmu.

Kusumadewi, S. d. H. P., (2005): Penyelesaian Masalah Optimasi dengan Teknikteknik Heuristik, Graha Ilmu, Yogyakarta.

Mindaputra, E., (2009): Penggunaan Algoritma Ant Colony System dalam Traveling Salesman Problem (TSP) pada PT.Eka Jaya Motor [Skripsi], Universitas Diponegoro, Semarang.

Mulia, D., (2011): Aplikasi Algoritma Ant System (AS) dalam Kasus Travelling Salesman Poblem (TSP) [Skripsi], Universitas Islam Negeri Syarif Hidayatullah, Jakarta.

Munir, R., (2005): Matematika Diskrit (Edisi Revisi Kelima), Penerbit Informatika, Bandung. Ostfeld, A., (2011): Ant Colony Optimization Methods and Applications, InTech, India.

Rosen, K. H., (2012): Discrete Mathematics and Its Applications (Seventh Edition), McGraw-Hill, New York.

Siang, J. J., (2006): Matematika Diskrit dan Aplikasinya pada Ilmu Komputer, Penerbit Andi, Yogyakarta.

Triansyah, A. F., (2013): Implementasi Algoritma Djikstra dalam Aplikasi untuk Menentukan Lintasan Terpendek Jalan Darat Antar Kota di Sumatera Bagian Selatan, Sistem Informasi, 5(2), 611–621.




DOI: https://doi.org/10.24114/jsi.v42i2.12248

Refbacks

  • There are currently no refbacks.


View My Stats