SISTEM PENENTUAN RUTE PENDISTRIBUSIAN PRODUK AIR MINERAL MENGGUNAKAN ALGORITMA ANT COLONY SYSTEM

Deny Wiria Nugraha, Albrecht Yordanus Erwin Dodu, Stevi Septiana

Abstract


The problem of determining distribution routes can be categorized as Traveling Salesman Problem (TSP). TSP is a search for a sequence of locations where a salesman travels from the initial location to a list of locations which must be passed. Each location can only be visited once and ends at the initial location of departure. This study aims to resolve the problem of determining the distribution route for mineral water products at PT. Anugerah Wina Sentosa by implementing the Ant Colony System (ACS) algorithm to conduct route searches. The ACS algorithm is an algorithm adopted from the behavior of ants to determine the shortest route from the nest to the food source. Based on the research, the results of the ACS algorithm show that the greater the case to be resolved will affect the system execution time but still can produce the best distance route. The success of this algorithm is influenced by the determination of the value of the ACS parameter, namely β, qo, q, α, 𐐙, the number of ants and the number of ant cycles determined by analyzing the TSP case to be resolved.


Keywords


Travelling Salesman Problem (TSP); Ant Colony System (ACS)

Full Text:

PDF

References


Amalia, R. “Pencarian Jalur Terpendek Menggunakan Ant Colony System (Kasus: Pariwisata Kota Bogor)”, Faktor Exacta 8(4): 290-304, Vol 8, No 4 2015.

Gunawan, A. S. Sipayung, E. M. dan Wiguno, A. “Perancangan Sistem Informasi Penentuan Rute Pengiriman Barang Dengan Metode Ant Colony Optimization Studi Kasus: PT. XYZ”, Seminar Nasional Sistem Informasi Indonesia, 2-3 November 2015.

Tutupary, F. S. Talakua, M. W. dan Lesnussa, Y. A. “Aplikasi Algoritma Ant Colony System Dalam Penentuan Rute Optimum Distribusi BBM Pada PT. Burung Laut”, Jurnal Barekeng Vol.8, No.1 2014.

Wardhani, N. “Optimisasi Traveling Saleseman Problem (TSP) Menggunakan Algoritma Semut”, Jurnal IT STMIK Handayani, Vol 15, Desember 2014.

Farisi, O. I. R. dan Pratamasunu, G. Q. O. “Penyelesaian Multi-Depot Multiple Traveling Salesmanproblem menggunakan K-Means dan Ant Colony Optimization”, Nusantara Journal of Computersand its Applications, Vol 2, No.5 2016.

A.A. Ismail, S. Herdjunanto, Priyatmadi. “Penerapan Algoritma Ant System dalam Menemukan Jalur Optimal pada Traveling Salesman Problem (TSP) dengan Kekangan Kondisi Jalan”. JNTETI, Vol. 1, No. 3 2012.

R. H. Nugroho. “Ant Colony System Algorithm to Solve Multi Depot Vehicle Routing Problem with Travel Time Variable”. Tesis Institut Teknologi Sepuluh Nopember 2015

K. Nugroho. “Penggunaan Algoritma Semut Untuk Penentuan Optimisasi Jalur Tim Marketing”. Jurnal INFOKAM September 2015.

P. Victor, SN. Azhari. “Ant Colony Optimization on Crowdsourced Delivery Trip Consolidation”. IJCCS (Indonesian Journal of Computing and Cybernetics Systems). Vol.11, No.2, July 2017.




DOI: http://dx.doi.org/10.33096/ilkom.v11i2.418.86-94

Article Metrics

This article has been viewed : 46 times
PDF files viewed : 22 times

Refbacks

  • There are currently no refbacks.


Creative Commons License
ILKOM Jurnal Ilmiah work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.