Author:
Li Xinran,Kan Haoxuan,Hua Xuedong,Wang Wei
Abstract
We propose a routing method for electric vehicles that finds a route with minimal expected travel time in time-dependent stochastic networks. The method first estimates whether the vehicle can reach the destination with the current battery level and selects potential reasonable charging stations if needed. Then, the route-search problem is formulated as a shortest path problem with time-dependent stochastic disruptions, using a Markov decision process. The shortest path problem is solved by an approximate dynamic programming algorithm to improve calculation efficiency in complex networks. Several simulation cases and a scenario-based example are given to prove the validity of the method.
Funder
National Natural Science Foundation of China
Natural Science Foundation of Jiangsu Province
Subject
Management, Monitoring, Policy and Law,Renewable Energy, Sustainability and the Environment,Geography, Planning and Development
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献