Hybrid genetic–tabu search algorithm to optimize the route for capacitated vehicle routing problem with time window

Abstract

Optimization of transportation and distribution costs is one of the important issues in the supply chain management area. It is caused by their large contribution to the logistics costs that can reach up to 40%. Thus, choosing the right route is one of the efforts that can be done to resolve the issue. This study aims to optimize the capacitated vehicle routing problem with time windows (CVRPTW) for mineral water company distributor with pick-up and delivery problem. To achieve the aim, this study used hybrid algorithm, Genetic Algorithm (GA) and Tabu Search Algorithm (TS). The selection of this hybrid algorithm is due to its capability in minimizing travel distance. The result of this study shows that not only the algorithm has successfully reduced the existing route but also predicted the optimum number of homogenous fleet. By running the algorithm, this study concludes that the number of the optimum routes for this study can be reduced for up to 15.99% than the existing route.