A Three-Step Heuristic Approach to the Electric Vehicle Path Planning Problem considering Charging
Table 4
The steps of the traffic network preprocessing algorithm.
Traffic network preprocessing algorithm
Input
Original road network , the set of charging stations , the speed of road link , the energy consumption of road links , and the battery capacity
Output
Charging feasibility road network
Step 1
Using Bellman–Ford’s algorithm to find the time shortest path and energy minimum path of each two nodes in . Calculating the corresponding energy consumption and of the two paths
Step 2
Determine whether the shortest time path is feasible, and the corresponding weights of the road sections in the road network are set to the corresponding path time consumption
Step 3
When is not feasible, determine whether the shortest energy consumption path is feasible. If is a feasible path, the weight of the section is set to the path time consumption . If not, the weight has great value.
