Algoritma Genetika pada Penyelesaian Multiple Travelling Salesmen Problem (M-TSP) (Studi Kasus: Jasa Pengangkutan CPO (Crude Palm Oil) PT. Miduk Arta Medan)

Abstract

This research employs a Genetic Algorithm to solve the Multiple Traveling Salesmen Problem (M-TSP) in the context of Crude Palm Oil (CPO) distribution by PT. Miduk Arta Medan to three CPO processing plants in North Sumatra: PKS Torgamba, PKS Aek Raso, and PKS Hapesong. The objective of the research is to find the shortest route from the starting point at PT. Miduk Arta Medan, through each plant, and back to the starting point. The experimental results show the shortest routes for each plant: PKS Torgamba (802 KM), PKS Aek Raso (796 KM), and PKS Hapesong (892 KM). This study demonstrates the potential of Genetic Algorithms in optimizing the logistics distribution efficiency of CPO.