Developing a solution algorithm for the autonomous electric vehicle routing problem considering the mixed fleet

ABSTRACT

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. The arrival and departure times of the AEV at the customer’s location must be pre-planned, because, the AEV is not able to decide what to do if the customer is late at this point. Also, due to increasing the security of the loads inside the AEVs and the lack of control of the driver during the delivery of the goods, each customer should only have access to his/her orders. Therefore, the compartmentation of the AEV’s loading area has been proposed in its conceptual model. We developed a mathematical model based on these properties and 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. Author