We have seen a rapid growth in the adoption of electric vehicle in today’s commercial mobility service market, from carrying passengers to the delivery of goods. One cardinal issue concerning the operation of EVs is the optimal routing of EV fleets with limited battery capacity. In this study, we investigate the energy-optimal online routing problem for the fleet of EVs, which focuses on identifying real-time minimum electricity consumption paths (MECP) for multiple OD pairs with limited information. We develop a multi-OD combinatorial multi-arm semi-bandit model (MCMAB) that uses the fleet of EVs as sensors in the transportation network and promotes the utilization of common information shared by different OD pairs. We further enrich the model with the path elimination policy to obtain MECP of high confidence while significantly reducing the number of learning iterations and the number of explorations needed. We demonstrate the effectiveness of the MCMAB and the efficiency of the path elimination policy with comprehensive numerical experiments in Manhattan, NYC. The results show that the proposed online routing algorithms can achieve near-optimal MECPs efficiently, and the quality of the solutions is significantly better than using the shortest travel time paths as approximate MECPs.
Online Energy-optimal Routing for Electric Vehicles with Combinatorial Multi-arm Semi-Bandit
2020-09-20
2327272 byte
Conference paper
Electronic Resource
English
Online Distributed Routing Problem of Electric Vehicles
IEEE | 2022
|Optimal Routing for Plug-In Hybrid Electric Vehicles
Online Contents | 2017
Optimal Routing for Plug-In Hybrid Electric Vehicles
British Library Online Contents | 2017
|