Artificial Bee Colony Algorithm for Solving Green Vehicle Routing Problems with Time Windows

Abstract

Abstract Determining the route of vehicles in logistics has a vital function for logistics companies to reduce the total cost of distribution costs. One of the exciting problems in determining vehicle routes is the green vehicle routing problem with time windows (GVRPTW). This study aims to propose the Artificial Bee Colony (ABC) algorithm to solve the GVRPTW problem. This problem’s objective function is to minimize the total cost of distribution, which involves the total cost of fuel and late delivery costs. The ABC algorithm is applied to a case study of an Indonesian distribution company. Thirty customers and one distribution center were considered in this study. The results show that the ABC algorithm can minimize the total cost of distribution. In addition, the proposed algorithm produces a competitive total distribution cost compared to the nearest neighbor procedure.