Implementasi Ant Colony Optimization (ACO) dalam Penyelesaian Travelling Salesmen Problem (Studi Kasus: PT. Canang Indah)

Abstract

PT Canang Indah is a company engaged in the processing and production of coniferous wood (rubber). The resulting product is a board which is divided into two types, namely ParticleBoard and Medium Densitive FibreBoard (MDF).. In delivering its products to consumers, a method is needed to optimize the route traveled. The problem of finding the optimal route is also known as the Traveling Salesmen Problem. The Traveling Salesmen Problem is a problem in determining the travel route of n cities with the lowest weight by visiting all cities exactly once except the departure city and the trip ends at the initial departure city. The weight in this study is distance. Determination of the shortest route can be used as the optimal route used by PT Canang Indah in delivering its products to consumers. One method that can be used in determining the shortest route is the Ant Colony Optimization (ACO) method. Ant Colony Optimization (ACO) is a probabilistic technique for solving the shortest route determination problem through graphs. Vertices in a graph represent location points. Meanwhile, edges represent paths that connect locations. Based on the results of this study, determining the shortest route taken by PT Canang Indah in delivering its products to consumers using Ant Colony Optimization (ACO) by involving 9 locations, the shortest route solution is obtained, namely PT. Canang Indah → PT. Cipta Prima Interwood → PT. Homestar Sumatera Indonesia → CV. Teguh Jaya Woodworking → PT. Sumber Lautan Rezeki → Panglong Selamat Jaya → Panglong Jati Jaya → PT. Cipta Rimba → Panglong Usaha Jaya Selamet → PT. Canang Indah with a total distance of 82.5 Kilometers.