Joint Routing and Charging Optimization of Electric Passenger Vehicles With Uninterruptible Charging Service

The increasing popularity of electric passenger vehicles (EPVs) has significant implications for transportation networks and power grids. We aim to tackle the routing and charging dispatching problem for EPVs while considering charging station (CS) power limits. We formulate the problem using a clustered rolling framework and introduce an energy criterion to determine EPV availability for shuttle services. The EPV charging dispatching is modeled as a constraint programming problem under CS power limits, with a fixed charging rate assumed at the start of charging. The RCLBD algorithm, based on logic-based benders decomposition, effectively handles binary and continuous variables. The EPV routing model serves as the master problem, while the charging model acts as the sub-problem. Simulation experiments demonstrate the RCLBD algorithm’s performance and efficiency. The algorithm successfully provides efficient pickup and delivery services, minimizing waiting times for customers. It ensures successful routing and charging solutions for all arriving EPVs. The electricity cost of our proposed RCLBD algorithm is 2.13%; 10.68% lower than that of MIP and MIPC method when the number of EPVs is 750. Our proposed routing and charging algorithm shows good performance and efficiency, addressing the challenges posed by the increasing popularity of EPVs.