A Constraint-Based Routing and Charging Methodology for Battery Electric Vehicles With Deep Reinforcement Learning

被引:17
作者
Zhang, Ying [1 ]
Li, Muyang [2 ]
Chen, Yuanchang [2 ]
Chiang, Yao-Yi [3 ]
Hua, Yunpeng [2 ]
机构
[1] North China Elect Power Univ, Sch Control & Comp Engn, Beijing 102206, Peoples R China
[2] North China Elect Power Univ, Sch Control & Comp Engn, Beijing 102206, Peoples R China
[3] Univ Minnesota, Sch Comp Sci, Engn Dept, Coll Sci & Engn, Minneapolis, MN USA
基金
中国国家自然科学基金;
关键词
Roads; Batteries; Routing; Planning; Electric vehicles; Reinforcement learning; Costs; Constraint-based route planning; two-layer model; battery electric vehicles; deep reinforcement learning; PATHS;
D O I
10.1109/TSG.2022.3214680
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
Electric vehicle route planning (EVRP) is generated from the collaborative operation of smart grids and intelligent transportation systems. It has become an essential issue for the widespread use of battery electric vehicles. However, the existed EVRP solutions are of either high computational complexity or low efficiency for large-scale problems. Towards such issues, we propose an efficient Deep Reinforcement Learning based methodology for constraint-based routing while simultaneously considering electric vehicles' charging policies. We design a two-layer model to find near-optimal solutions and handle the broad range of problem instances according to the rewards and the preset feasibility rules. The first layer is to approximate a sequence of consecutive actions in reality and correspondingly produce a minimum time-consuming feasible route without re-training for each new problem instance. The second layer is to generate a charging scheme along the previously generated feasible path. The proposed methodology is independent of the road network topology and the electric vehicles' types. Besides, the convergence of value function in the presented model for EVRP is studied. The experiment shows that our methodology outperforms the traditional ones in computation time with comparable solution quality. Moreover, the obtained model can be directly applied to treat other problem instances on various road networks without re-training procedures.
引用
收藏
页码:2446 / 2459
页数:14
相关论文
共 44 条
[1]   The Electric Vehicle Shortest-Walk Problem With Battery Exchanges [J].
Adler, Jonathan D. ;
Mirchandani, Pitu B. ;
Xue, Guoliang ;
Xia, Minjun .
NETWORKS & SPATIAL ECONOMICS, 2016, 16 (01) :155-173
[2]  
[Anonymous], 2015, Computer Science
[3]  
Artmeier A, 2010, LECT NOTES ARTIF INT, V6359, P309, DOI 10.1007/978-3-642-16111-7_35
[4]   Energy consumption estimation integrated into the Electric Vehicle Routing Problem [J].
Basso, Rafael ;
Kulcsar, Balazs ;
Egardt, Bo ;
Lindroth, Peter ;
Sanchez-Diaz, Ivan .
TRANSPORTATION RESEARCH PART D-TRANSPORT AND ENVIRONMENT, 2019, 69 :141-167
[5]  
Baum M., 2013, Proceedings of the 21st ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems - SIGSPATIAL'13, P54
[6]  
Bazzan ALC, 2016, IEEE IJCNN, P5288, DOI 10.1109/IJCNN.2016.7727899
[7]   Generalized Hamilton-Jacobi-Blellman formulation-based neural network control of affine nonlinear discrete-time systems [J].
Chen, Zheng ;
Jagannathan, Sarangapani .
IEEE TRANSACTIONS ON NEURAL NETWORKS, 2008, 19 (01) :90-106
[8]  
Delling D, 2009, LECT NOTES COMPUT SC, V5515, P117, DOI 10.1007/978-3-642-02094-0_7
[9]  
Dijkstra E., 1959, Ph.D. dissertation
[10]  
Eisner J., 2011, P 25 AAAI C ART INT, P1108