Efficient algorithms for autonomous electric vehicles' min-max routing problem

Increase in greenhouse gases emission from the transportation sector has led companies and government to elevate and support the production of electric vehicles. The natural synergy between increased support for electric and emergence of autonomous vehicles possibly can relieve the limitations regarding access to charging infrastructure, time management, and range anxiety. In this work, a fleet of Autonomous Electric Vehicles (AEV) is considered for transportation and logistic capabilities with limited battery capacity and scarce charging station availability are considered while planning to avoid inefficient routing strategies. We introduce a min-max autonomous electric vehicle routing problem (AEVRP) where the maximum distance traveled by any AEV is minimized while considering charging stations for recharging. We propose a genetic algorithm based meta-heuristic that can efficiently solve a variety of instances. Extensive computational results, sensitivity analysis, and data-driven simulation implemented with the robot operating system (ROS) middleware are performed to corroborate the efficiency of the proposed approach, both quantitatively and qualitatively.