Penerapan Algoritma Sweep dan Particle Swarm Optimization (PSO) sebagai Alternatif Menentukan Rute Distribusi

Abstract

One aspect of marketing activities is distribution. In the process of distributing goods, it is important to determine the optimal route that minimize mileage and reduce costs. This study aims to provide alternative solutions in determining distribution routes with the shortest distance which has implications for shorter travel times and lower costs. This research adapts the Capacitated Vehicle Routing Problem (CVRP) model with the approach of sweep and Particle Swarm Optimization (PSO) algorithm to determine the route. To generate a comparison route, we use the Nearest Neighbor (NN) algorithm. The result was that 100 agents were divided into 6 clusters and the total distance of the PSO-generated route is 218.115 units or 85.70% of the route distance generated by Nearest Neighbor algorithm .