scholarly journals Electric Vehicle Routing Problem with Charging Time and Variable Travel Time

2017 ◽  
Vol 2017 ◽  
pp. 1-13 ◽  
Author(s):  
Sai Shao ◽  
Wei Guan ◽  
Bin Ran ◽  
Zhengbing He ◽  
Jun Bi
Keyword(s):  
Travel Time ◽  
Vehicle Routing ◽  
Electric Vehicle ◽  
Vehicle Routing Problem ◽  
Model Performance ◽  
Dijkstra Algorithm ◽  
Routing Problem ◽  
Charging Time ◽  
Battery Power ◽  
Operational Issues

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.

scholarly journals The Electric Vehicle Routing Problem with Time Windows under Travel Time Uncertainty

2021 ◽  
Vol 2095 (1) ◽  
pp. 012032
Author(s):  
Dan Wang ◽  
Hong Zhou
Keyword(s):  
Travel Time ◽  
Vehicle Routing ◽  
Electric Vehicle ◽  
Electric Vehicles ◽  
Vehicle Routing Problem ◽  
Search Algorithm ◽  
Time Windows ◽  
Routing Problem ◽  
Time Uncertainty ◽  
Travel Time Uncertainty

Abstract Due to environmental friendliness, electric vehicles have become more and more popular nowadays in the transportation system. For many express companies, it is more and more important to meet the predetermined time window of customers. The uncertainty in travel times often causes uncertain energy consumption and uncertain recharging time, thus electric vehicles may miss the time windows of customers. Therefore, this paper addresses the electric vehicle routing problem with time windows under travel time uncertainty, which aims to determine the optimal delivery strategy under travel time uncertainty. To solve this problem, a robust optimization model is built based on the route-dependent uncertainty sets. However, considering the complexity of the problem, the robust model can only solve few instances including the small number of customers. Thus, a hybrid metaheuristic consisting of the adaptive large neighborhood search algorithm and the local search algorithm is proposed. The results show that the algorithm can obtain the optimal solution for the small-sized instances and the large-sized instances.

scholarly journals Electric Vehicle Routing Problem with Industry Constraints: Trends and Insights for Future Research

2014 ◽  
Vol 3 ◽  
pp. 452-459 ◽  
Author(s):  
Anagnostopoulou Afroditi ◽  
Maria Boile ◽  
Sotirios Theofanis ◽  
Eleftherios Sdoukopoulos ◽  
Dimitrios Margaritis
Keyword(s):  
Vehicle Routing ◽  
Electric Vehicle ◽  
Vehicle Routing Problem ◽  
Future Research ◽  
Routing Problem

Recharge strategies for the electric vehicle routing problem with soft time windows and fast chargers

2021 ◽  
Vol 15 (4/5) ◽  
pp. 444
Author(s):  
Zhenping Li ◽  
Guohua Wu ◽  
Ke Zhang ◽  
Shuxuan Li ◽  
Chenglin Xiao ◽  
...  
Keyword(s):  
Vehicle Routing ◽  
Electric Vehicle ◽  
Vehicle Routing Problem ◽  
Time Windows ◽  
Routing Problem ◽  
Soft Time Windows
Sign in / Sign up

Export Citation Format

Share Document