PENGGUNAAN ALGORITMA SIMULATED ANNEALING UNTUK MENYELESAIKAN MASALAH VEHICLE ROUTING PADA RUTE DISTRIBUSI SUPERMARKET

Abstract

Sakinah Supermarket is a type of cooperative owned by the Hidayatullah Islamic Boarding School in East Java and was founded in 1991. There are 21 supermarkets with 16 branches in Surabaya. Limited transportation vehicles have the problem that the distribution process from warehouses to supermarkets is not maximal. This problem is also known as the Vehicle Routing Problem (VRP). It is necessary to optimize the route to complete the VRP. This study uses the Simulated Annealing (SA) algorithm method which is used for VRP problems. SA calculations are carried out using tested parameters so that they can produce nearly optimal values. The parameters that can be used are To = 5000, α = 0.55 and T1 = 1. The result is that the cost and time costs can reach 30% and the distance traveled can be reduced by 17% when compared to the initial conditions. The SA algorithm is also compared to other methods, namely Genetic Algorithm (GA) to find out its effectiveness. Based on the results of the comparison, the SA algorithm is superior by 21% in comparison to the comparison and the distance traveled and 8% better in the comparison of travel time than GA.