Electric Vehicle Routing Problem with Charging Time and Variable Travel Time

Abstract EN

An electric vehicle routing problem with charging time and variable travel time is developed to address some operational issues such as range limitation and charging demand.

The model is solved by using genetic algorithm to obtain the routes, the vehicle departure time at the depot, and the charging plan.

Meanwhile, a dynamic Dijkstra algorithm is applied to find the shortest path between any two adjacent nodes along the routes.

To prevent the depletion of all battery power and ensure safe operation in transit, electric vehicles with insufficient battery power can be repeatedly recharged at charging stations.

The fluctuations in travel time are implemented to reflect a dynamic traffic environment.

In conclusion, a large and realistic case study with a road network in the Beijing urban area is conducted to evaluate the model performance and the solution technology and analyze the results.