Back to Search
Start Over
Electric Vehicle Routing Problem with Charging Time and Variable Travel Time
- Source :
- Mathematical Problems in Engineering, Vol 2017 (2017)
- Publication Year :
- 2017
- Publisher :
- Hindawi Limited, 2017.
-
Abstract
- 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.
- Subjects :
- Battery (electricity)
Engineering
business.product_category
Article Subject
General Mathematics
0211 other engineering and technologies
02 engineering and technology
Automotive engineering
Hardware_GENERAL
0502 economics and business
Genetic algorithm
Electric vehicle
Simulation
050210 logistics & transportation
021103 operations research
business.industry
lcsh:Mathematics
05 social sciences
General Engineering
lcsh:QA1-939
Power (physics)
Variable (computer science)
lcsh:TA1-2040
Shortest path problem
Routing (electronic design automation)
lcsh:Engineering (General). Civil engineering (General)
business
Dijkstra's algorithm
Subjects
Details
- ISSN :
- 15635147 and 1024123X
- Volume :
- 2017
- Database :
- OpenAIRE
- Journal :
- Mathematical Problems in Engineering
- Accession number :
- edsair.doi.dedup.....3da4cbd6a3b432a768b30d2de89c8f29