摘要
Interactive users' preferences and waiting time together have great impact on charging station network design of electric vehicles (EVs), but only waiting time was considered in previous studies. To fill this research gap, this paper addresses a location planning problem for EV charging stations, which considers users' preferences and waiting time simultaneously. The problem is formulated as a multi-objective bi-level programming model, the upper level model determines locations and capacity options of charging stations with the objectives of minimising total cost and minimising total service tardiness, and the lower level model determines the allocation of users to stations with the objective of minimising total travel time. A hybrid non-dominated sorting genetic algorithm II (HNSGA-II) with embedded level determination algorithm (LDA) and a partial enumeration algorithm (PEA) are proposed, respectively, to solve the model. Furthermore, managerial analysis is implemented to verify the advantages of considering users' preferences in reducing charging service tardiness and saving cost compared with the mode of no considering users' preferences. And sensitivity analysis is also performed to provide managerial insights for EV charging station location practice. Finally, a real-world case study is conducted to verify the applicability of the proposed approach in solving practical location planning problems.
学科与关键词
- Optimal Location of Electrical Vehicle Charging Stations With Both Self-and Valet-Charging ServiceZhao, Tianyi; Li, Na*; Kong, Nan; Xie, XiaoqingIEEE Transactions on Automation Science and Engineering, 2023.
- Integrated optimization of electric vehicles charging location and allocation for valet charging serviceShen, Xiaoxiao; Lv, Jun; Du, Shichang*; Deng, Yafei; Liu, Molin; Zhou, YuluFlexible Services and Manufacturing Journal, 2023.被引 4
- Research on the Planning of Electric Vehicle Fast Charging Stations Considering User Selection PreferencesChen, Julong*; Chen, HaoyongEnergies, 2023, 16(4): 1794.被引 2
