Penerapan Algoritma Ant Colony Optimization dalam Penyelesaian Capacitated Vehicle Routing Problem untuk Distribusi PT. Amerta Indah Otsuka Medan

Abstract

Vehicle Routing Problem (VRP) is one of the problems found in Operational Research. The applications of VRP problems can be seen in daily life, such as distributing newspapers to subscribed buyers, determining bus routes, distributing letters from post offices, and so on. One variation of VRP is the Capacitated Vehicle Routing Problem (CVRP). This research aims to apply the Ant Colony Optimization (ACO) algorithm in solving the Capacitated Vehicle Routing Problem (CVRP) to determine the optimum distribution at PT. Amerta Indah Otsuka Medan. The methodology used in this research is determining the topic, interviewing parties who understand the goods delivery process at PT. Amerta Indah Otsuka Medan, collecting various reference materials in the form of material books, collecting research data, studying the process of preparing goods delivery routes and the applied goods delivery patterns, carrying out data processing and calculations using tabu search method to obtain suggestions regarding goods delivery routes, processing and calculating data by applying the CVRP model and ACO algorithm, analyzing and evaluating the results of data calculations, and determining conclusions and suggestions. Research results obtained from travel routes obtained from combining the visit routes of PT. Amerta Indah Otsuka Medan based on ACO (Ant Colony Optimization Algorithm) calculations, start from Maju Bersama Group, to DC Medan Indomaret, to Alfamart Office Medan Branch, to Irian Supermarket & Dept Store, to Hypermarket Maximum, to Lotte Mart Grosir Medan, to Alfamidi DC Branch Medan, to Transmart Medan Fair, to Berastagi Supermarket. The total distance traveled based on the ACO method is 81.3 Km.