Heuristic algorithms for solving the multi-compartment vehicle routing problem with time windows and heterogeneous fleet

Abstract

The use of multi-compartment vehicles is an efficient solution for distributing different products that cannot be transported in the same compartment. In this study, the vehicle routing problem with time windows is addressed by considering the use of a heterogeneous fleet and multi-compartment vehicles. The variant of the problem discussed in this study is known as the Heterogeneous Fleet Multi-Compartment Vehicle Routing Problem (MCVRPTWHF). In this study, the Variable Neighborhood Search algorithm (VNS) and the Artificial Bee Colony Algorithm (ABCA) have been adapted to solve the problem. Well-known datasets have been adapted to fit the problem structure in order to analyze the performance of the algorithms. Comparative results reveal that the developed algorithms effectively solve the generated datasets. It has been observed that the DKA algorithm has significant numerical superiority compared to YAKA.