Dynamic-Area-Based Shortest-Path Algorithm for Intelligent Charging Guidance of Electric Vehicles

With the increasing popularization and competition of electric vehicles (EVs), EV users often have anxiety on their trip to find better charging stations with less travel distance. An intelligent charging guidance strategy and two algorithms were proposed to alleviate this problem. First, based on the next destination of EV users’ trip, the strategy established a dynamic-area model to match charging stations with users’ travel demand intelligently. In the dynamic area, the Dijkstra algorithm is used to find the charging station with the shortest trip. Then, the area extension algorithm and the charging station attribution algorithm were developed to improve the robustness of the dynamic area. The two algorithms can automatically adjust the area size according to the number of charging stations in the dynamic area to reduce the number of nodes traversed by the Dijkstra algorithm. Finally, simulation examples were used to verify the effectiveness of the proposed model and algorithms. The results showed that the proposed intelligent charging guidance strategy can meet the travel demand of users. It is a promising technique in smart cities to find better travel trips with less travel distance and less computed time.