Comparison of Capacitated Vehicle Routing Problem Using Initial Route and Without Initial Route for Pharmaceuticals Distribution

Abstract

The demand for pharmaceuticals increased due to the second wave that happening in Indonesia. Pharmaceuticals distribution for hospitals in Central Java is developed in this paper, which is categorized as a Capacitated Vehicle Routing Problem (CVRP). The proposed method is using the same size K-means and Greedy algorithm as an initial route. The result of the initial route is a clustered route for each vehicle. Then, using Google OR-tools metaheuristics Guided Local Search, each cluster was re-optimized. This paper, proven that using the initial route has the effect of reducing runtime by 98.91% when compared to without the initial route. This is because using initial routes with the same size K-means means breaking the problem into parts, then using the Greedy algorithm can reduce the number of possible routes. However, the total distance increased by 8.11% because no cluster member is allowed to move to another cluster.