PENENTUAN RUTE DISTRIBUSI PRODUKMENGGUNAKAN ALGORITMA TABU SEARCH(Studi Kasus : PT. Batu Bhumi Suryatama)

This study discusses the problem of determining the route of a vehicle with constraints in the form of vehicle capacity. The problem of vehicle route determination with the constraints in the form of comparative capacities is called Capacitated Vehicle Routing Problem (CVRP). The purpose of solving the problem of the Capacitated Vehicle Routing Problem (CVRP) is to optimize mileage while meeting the demands of customers who are in different locations, so as to produce routes with a minimum total mileage. The method used to solve CVRP problems is the Tabu Search Algorithm. The results of the study show that the Tabu Search algorithm method can solve CVRP problems by providing a better solution in the form of a minimum total mileage. Furthermore, in this study a comparison of the distance between the initial route and the new route was formed by using the Tabu Search Algorithm. The use of the Tabu Search Algorithm method in this research is effective because it is able to provide optimal solutions.