Optimizing routing and scheduling of shared autonomous electric taxis considering capacity constrained parking facilities

This paper focuses on routing and scheduling of autonomous electric vehicles to provide reservation-based shared ride services, while a set of parking facilities with limited capacity are used for vehicle intermittent charging. A mixed-integer linear program model is formulated in the form of a vehicle routing problem with satellite facilities (VRPSF), subject to a series of additional time and capacity-related constraints. The objective of the model is to minimize the total operating costs of the system, including those related to vehicle miles traveled and the deployed vehicle fleet size. The number of vehicles inside each parking facility is tracked so as to ensure that the capacity is never exceeded throughout the service horizon. A customized solution method based on an adaptive large neighborhood search algorithm with an explicit treatment of parking facility choices is developed. A series of numerical experiments, consisting of both hypothetical examples and a real-world case study in Hangzhou, China, have been conducted to evaluate the effectiveness and applicability of the proposed model and algorithm. The results demonstrate that ride-sharing services and parking facilities have the potential to significantly reduce the total vehicle energy consumption and operating costs for a shared autonomous electric taxi (SAET) operator in practical scenarios. •We introduce the routing and scheduling problem of shared autonomous electric taxis (SAETs).•A mixed-integer linear program model that includes parking lot capacity constraints is formulated.•An adaptive large neighborhood search algorithm is proposed to solve the problem.•Two customized insertion operators are devised to integrate parking lots into vehicle routing.•A case study in Hangzhou, China, demonstrates the benefits of ride-sharing and parking facilities for the SAET system operation.