Optimalisasi Rute Distribusi Air Minum Dalam Kemasan Menggunakan Algoritma Genetika Pada Pt. Mual Natio Maju Bersama

Abstract

Travelling Salesman Problem (TSP) is a problem that is often encountered by a salesman who must travel exactly once to all consumers in a route and will return to the starting point of departure. Algorithm Genetic Algorithm is one way to find heuristic solutions based on the evolutionary ideas of natural selection and genetics. The aim is to find the optimal route for the distribution of bottled water products produced by PT. Mual Natio Maju Bersama. To find a solution, the chromosomes processed by the genetic algorithm are represented through the stages in the Genetic Algorithm individual initialization, fitness value, linear fitness ranking, roulette whell selection, crossover, and mutation. In order to achieve the optimum solution, namely The best path obtained is PT Mual Tio Maju Bersama –BUMDES Sait ni Huta - UD. Alvaro - UD. Lancelhot – UD. Alris – UD. Jamel – Toko Kelontong SRC Resi 2 – Toko Notra – UD. B Siringoringo – Toko Dahlia Siahaan – UD. Purba – UD. Cahaya – UD. Hutapea – UD. Gabe – UD. Setia II – UD. Larisma II – UD. Antoni – UD. Bona Siahaan – UD. Sederhana – Toko Manalu – UD. Setia I – Toko Ferdinan – UD. Alboy – Wisma Daun Mas – UD. Top Jaya – UD. Mega Silaban – BUMDES Silaitlait – UD. Rika – UD. Panamot – Piltik Coffee and Homestay Bandar Udara Silangit – UD. Rolas Boy – UD. Salamat Karya – UD. Simpang Jaya – UD. Lambok - Piltik Coffee and Homestay Siborongborong – UD. Bahagia – UD. Marlinca – UD. Heri Joel Pasaribu – UD. Ebenezer – UD. Mawar – UD. A Saudara – UD. SP Perdana – PDAM Mual Na Tio – UD. Rokkap - PT Mual Tio Maju Bersama. The best path length is 125.2700 cartesian units and the best fitness value is 0.008000.