Optimal charging facility location and capacity for electric vehicles considering route choice and charging time equilibrium

被引:80
作者
Chen, Rui [1 ,3 ]
Qian, Xinwu [2 ]
Miao, Lixin [3 ,4 ]
Ukkusuri, Satish V. [2 ]
机构
[1] Tsinghua Univ, Dept Ind Engn, Beijing 100084, Peoples R China
[2] Purdue Univ, Lyles Sch Civil Engn, 550 Stadium Mall Dr, W Lafayette, IN 47907 USA
[3] Tsinghua Univ, Div Logist & Transportat, Grad Sch Shenzhen, Shenzhen 518055, Peoples R China
[4] Tsinghua Berkeley Shenzhen Inst, Intelligent Transportat & Logist Syst Lab, Shenzhen 518055, Peoples R China
基金
中国国家自然科学基金;
关键词
Electric vehicle; Facilities location; Waiting time; Charging and route choice equilibrium; MATHEMATICAL PROGRAMS; NETWORK EQUILIBRIUM; OPTIMAL-DEPLOYMENT; STATIONS; ALGORITHM; SYSTEMS; DESIGN; CONVERGENCE; FRAMEWORK; MODELS;
D O I
10.1016/j.cor.2019.104776
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
In this study, the optimal design of location and capacity of charging facilities for electric vehicles (EVs) is investigated. A bi-level mathematical model is proposed to derive optimal design considering the equilibrium of route choice and waiting time for charging. The objective is to minimize the joint cost of facility constructions and EV drivers' travel and waiting time over the network. The upper-level model allocates the facilities and their capacity, while the lower-level model characterizes equilibrium behavior of drivers' route and charging facility choices. In particular, we model drivers at each charging facility as the M(t)/M/n queue and approximate the average queuing time and probability of waiting time as functions of facility capacity and demand arrival rate. The bi-level model is then converted into a single-level model, and the solution algorithm is proposed for iteratively solving the relaxed problems. Comprehensive experiments are conducted on three networks to evaluate algorithm performances, assess solution robustness and understand the scalability of the solution approach on large networks. (C) 2019 Elsevier Ltd. All rights reserved.
引用
收藏
页数:18
相关论文
共 49 条
[41]   Mathematical programs with complementarity constraints: Stationarity, optimality, and sensitivity [J].
Scheel, H ;
Scholtes, S .
MATHEMATICS OF OPERATIONS RESEARCH, 2000, 25 (01) :1-22
[42]   Convergence properties of a regularization scheme for mathematical programs with complementarity constraints [J].
Scholtes, S .
SIAM JOURNAL ON OPTIMIZATION, 2001, 11 (04) :918-936
[43]   An efficient heuristic algorithm for the alternative-fuel station location problem [J].
Trung Hieu Tran ;
Nagy, Gabor ;
Nguyen, Thu Ba T. ;
Wassan, Niaz A. .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2018, 269 (01) :159-170
[44]   On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming [J].
Wachter, A ;
Biegler, LT .
MATHEMATICAL PROGRAMMING, 2006, 106 (01) :25-57
[45]  
Widrick R., 2016, Transp. Sci
[46]  
Worley O., 2012, PROCEEDING IEEE INT, P1, DOI DOI 10.1109/IEVC.2012.6183279
[47]   A stochastic flow-capturing model to optimize the location of fast-charging stations with uncertain electric vehicle flows [J].
Wu, Fei ;
Sioshansi, Ramteen .
TRANSPORTATION RESEARCH PART D-TRANSPORT AND ENVIRONMENT, 2017, 53 :354-376
[48]   Network user equilibrium problems for the mixed battery electric vehicles and gasoline vehicles subject to battery swapping stations and road grade constraints [J].
Xu, Min ;
Meng, Qiang ;
Liu, Kai .
TRANSPORTATION RESEARCH PART B-METHODOLOGICAL, 2017, 99 :138-166
[49]   Battery swap station location-routing problem with capacitated electric vehicles [J].
Yang, Jun ;
Sun, Hao .
COMPUTERS & OPERATIONS RESEARCH, 2015, 55 :217-232