Optimasi Rute Terpendek Distribusi Barang Menggunakan Particle Swarm Optimization pada JNE Cabang Utama Jember

Abstract

The shortest route is an important application, especially for logistics companies such as PT. Tiki Jalur Nugraha Ekakurir (JNE). This study aims to determine the distribution route with the minimum distance using the PSO algorithm. This algorithm works like a flock of birds or a school of fish searching for food. The calculations were performed in Python. This study uses distribution point data from 8 locations. The data is represented as a distance matrix, and the results and distribution routes are obtained in graph form using the PSO algorithm. In this study, a slight modification is made to the PSO algorithm, in which the last point does not return to the starting point. After the PSO algorithm process, a search is performed to determine the distance back to the starting point, thereby obtaining the total distance for each location or the complete route. The shortest distribution route is obtained by combining PSO algorithm parameters: 𝑁 = 40, 𝐼𝑚𝑎𝑥 =100, 𝜃𝑚𝑖𝑛 = 0.4, 𝜃𝑚𝑎𝑥 = 0.9, 𝑐1 = 2, 𝑐2 = 1. It produces a distribution distance of 104.6 km and a total distribution distance of 125.2 km. The parameter testing results show that the distribution distances obtained across various parameter combinations tend to be similar. This condition is caused by the small number of distribution locations, namely 8 locations, resulting in slightly diverse solutions. Due to this condition, a comparison beyond the distribution distance is needed: namely, the frequency of occurrence of the shortest distribution distance and the convergence iterations.