A Tailored Meta-Heuristic for the Autonomous Electric Vehicle Routing Problem Considering the Mixed Fleet

In recent years, some phenomena such as the COVID-19 pandemic have caused the autonomous vehicle (AV) to attract much attention in theoretical and applied research. This paper addresses the optimization problem of a heterogeneous fleet that consists of autonomous electric vehicles (AEVs) and conventional vehicles (CVs) in a Business-to-Consumer (B2C) distribution system. The absence of the driver in AEVs results in the necessity of studying two factors in modeling the problem, namely time windows in the routing plan and different compartments in the loading space of AEVs. We developed a mathematical model based on these properties, that was NP-hard. Then we proposed a hybrid algorithm, including variable neighborhood search (VNS) via neighborhood structure of large neighborhood search (LNS), namely the VLNS algorithm. The numerical results shed light on the proficiency of the algorithm in terms of solution time and solution quality. In addition, employing AEVs in the mixed fleet is considered to be desirable based on the operational cost of the fleet. The numerical results show the operational cost in the mixed fleet decreases on average by 57.22% compared with the homogeneous fleet.