EV route planning are widely studied recent days, the key problem is always how to deal with the different criteria. Drivers may choose the shortest travel time or prefer to charge at a cheaper charging station, or even worse (for the planner), at first half of the journey choosing the shortest travel time and at the other half, when almost run out of battery, when to the cheapest charging stations nearby. This requires the planner to not only fully consider each criterion, but also be able to quickly make plans. A common approach is to use a Dijkstra's algorithm with a Pareto set.