Open AccessArtificial Bee Colony Algorithm for Solving Green Vehicle Routing Problems with Time Windows
Author(s) -
Dana Marsetiya Utama,
Triani Aulya Fitria,
Annisa Kesy Garside
Publication year - 2021
Publication title -
journal of physics. conference series
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.21
H-Index - 85
eISSN - 1742-6596
pISSN - 1742-6588
DOI - 10.1088/1742-6596/1933/1/012043
Subject(s) - vehicle routing problem , total cost , computer science , artificial bee colony algorithm , mathematical optimization , distribution (mathematics) , algorithm , distribution center , function (biology) , operating cost , routing (electronic design automation) , genetic algorithm , engineering , mathematics , artificial intelligence , embedded system , business , mathematical analysis , accounting , commerce , evolutionary biology , biology , waste management
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.