Publication Search

Waste transportation activities are an example of a form of Capacitated Vehicle Routing Problem (CVRP) related to finding the minimum route. The Tabu Search algorithm is one of the metaheuristic methods that can guide the heuristic local search procedure to explore the solution area outside the local optimal point. The Tabu Search algorithm can be used to find the optimal VRP solution, namely the route that has the minimum total mileage by considering vehicle capacity. The purpose of this research is to determine the optimal route for garbage transportation in the Capacitated Vehicle Routing Problem (CVRP) model in Padang Sidempuan City using the Tabu Search algorithm. Based on the results of the study, it is concluded that the optimal route for transporting waste in the Capacitated Vehicle Routing Problem (CVRP) model in Padang Sidempuan City using the Tabu Search algorithm obtained the shortest route in iteration 1 with the route (12-11-10-9-8-7-6-5-4-3-2-1-0) and route length 16.55 km.

Distribution routes are generally a problem for every company, including in the public company BULOG Medan Amplas. Distribution to the Medan Amplas BULOG public company, namely having to serve every stall that is far from the warehouse with scattered locations, and limited vehicle capacity. So far, driver considerations in distributing products have only been based on random intuitions of driver and does not consider the efficiency of the route taken. Therefore, this research uses Clarke and Wright Savings algorithm to obtain optimal mileage by taking into account every consumer demand and vehicle capacity. Calculation results using the Clarke and Wright Savings Algorithm obtained the vehicle mileage of 695.08 km with a savings of 11 km or 1.56%.