Article Sidebar

Download
PDF
Statistic
Read Counter : 240 Download : 247

Main Article Content

Abstract

The distribution system of goods is one of the most important parts for every company. The company certainly has many route options to visit, and this is expected to be conducted efficiently in terms of time. In the distribution of goods by Alfamidi company in Palu City which has 51 outlets include into the category of Traveling Salesman Problem (TSP) because of many route options that can be visited. The problem can be solved by employing the Ant Colony Optimization (ACO) method which is one of the algorithms Ant Colony System (ACS). The ACS acquires principles based on the behavior of ant colonies and applies three characteristics to determine the shortest route namely status transition rules, local pheromone renewal and global pheromones. The result showed that the shortest route of the distribution of goods based on the calculation of selected iterations was ant 1 with the shortest total distance obtained 86.98 km.

Keywords

ACO ACS Distribution System TSP

Article Details

Author Biographies

Nabila Dwi Indria, Universitas Tadulako, Indonesia

 

 

Junaidi Junaidi, Universitas Tadulako, Indonesia

 

 

Iut Tri Utami, Universitas Tadulako, Indonesia

 

 

How to Cite
Indria, N. D., Junaidi, J., & Utami, I. T. (2021). Determination of the Shortest Route on the Distribution System using Ant Colony Optimization (ACO) Algorithm (Case Study: Alfamidi Palu Branch – PT. Midi Utama Indonesia). Enthusiastic : International Journal of Applied Statistics and Data Science, 1(2), 84–93. https://doi.org/10.20885/enthusiastic.vol1.iss2.art5
Download Citation
Endnote/Zotero/Mendeley (RIS)
BibTeX

References

  1. R. Alexander, "Pencarian Rute Distribusi Barang Menggunakan Algoritma Semut," Universitas Sanata Dharma, Jakarta, 2015.
  2. O. Farisi, "Penyelesaian Multi-Depot Multiple Traveling Salesmen Problem Menggunakan K-Means dan Ant Colony Optimization," Jurnal Nusantara, vol. 2, no. 5, pp. 1-8, 2016.
  3. A. Leksono, "Algoritma Ant Colony Optimization (ACO) untuk Menyelesaikan Traveling Salesmen Problem (TSP)," Universitas Diponegoro, Semarang, 2009.
  4. A. Adha, "Peta Interaktif Pencarian Jalur Terpendek dengan Menggunakan Algoritma Semut untuk Penjemputan Barang," Universitas Islam Negeri Sultan Syarif Kasim, Pekanbaru, 2010.
  5. D. Mulia, "Aplikasi Algoritma Ant System (AS) dalam Kasus Traveling Salesmen Problem (TSP)," Universitas Islam Negeri Syarief Hidayatullah, Jakarta, 2011.
  6. E. Mindaputra, "Penggunaan Algoritma Ant Colony System dalam Traveling Salesman Problem (TSP) pada PT. Eka Jaya Motor," Universitas Diponegoro, Semarang, 2009.
  7. D. B. Painlin, "Penentuan Rute Optimal Distribusi Produk Nestle dengan Metode Traveling Salesman Problem (TSP) (Studi Kasus: PT. Paris Jaya Mandiri)," Jurnal Arika, vol. 11, no. 1, pp. 35-43, 2017.
  8. J. S. Budayasa, Teori Graph dan Aplikasinya, Surabaya: Unesa University Press, 2017.
  9. J. S. Siang, Matematika Diskrit dan Aplikasinya Pada Ilmu Komputer, Yogyakarta: Penerbit Andi, 2002.