Journal
IET INTELLIGENT TRANSPORT SYSTEMS
Volume 12, Issue 3, Pages 202-212Publisher
INST ENGINEERING TECHNOLOGY-IET
DOI: 10.1049/iet-its.2017.0008
Keywords
electric vehicles; electric vehicle charging; vehicle routing; energy consumption; genetic algorithms; electric vehicle-routing problem; charging demands; energy consumption; EVRP model; charging stations; road network; Beijing; charging plan; driving paths; hybrid genetic algorithm; dynamic Dijkstra algorithm
Funding
- NSFC [71621001, 71471014]
- Key Research and Development Project of Shandong Province [2016GGX105004]
Ask authors/readers for more resources
An electric vehicle-routing problem (EVRP) is developed to settle some operation distribution troubles such as battery energy limitations and difficulties in finding charging stations for electric vehicles (EVs). Meanwhile, in view of realistic traffic conditions and features of EVs, energy consumption with travel speed and cargo load is considered in the EVRP model. Moreover, to avoid the depletion of all battery power and ensure safe operation, EVs with insufficient battery power can be recharged at charging stations many times in transit. In conclusion, a large, realistic case study with the road network of Beijing urban, 100 customers and 30 charging stations is conducted to test the performance of the model and obtain an optimal operation scheme consisted of the routes, charging plan and driving paths. The EVRP model is solved based on the hybrid genetic algorithm to get the routes and charging plan. The dynamic Dijkstra algorithm with some improvements over the classical Dijkstra algorithm is applied to find the driving paths called the most energy efficient paths between any two adjacent visited nodes in the routes.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available