Locating Multiple Size and Multiple Type of Charging Station for Battery Electricity Vehicles

被引:21
作者
Cui, Shaohua [1 ]
Zhao, Hui [1 ]
Wen, Huijie [1 ]
Zhang, Cuiping [2 ]
机构
[1] Beijing Jiaotong Univ, Sch Traff & Transportat, MOE Key Lab Urban Transportat Complex Syst Theory, Beijing 100044, Peoples R China
[2] Beijing Informat Sci & Technol Univ, Comp Ctr, Beijing 100192, Peoples R China
基金
中国国家自然科学基金;
关键词
battery electric vehicles; charging station; location; multiple size; multiple type; MODEL;
D O I
10.3390/su10093267
中图分类号
X [环境科学、安全科学];
学科分类号
08 ; 0830 ;
摘要
As environmental and energy issues have attracted more and more attention from the public, research on electric vehicles has become extensive and in-depth. As driving range limit is one of the key factors restricting the development of electric vehicles, the energy supply of electric vehicles mainly relies on the building of charging stations, battery swapping stations, and wireless charging lanes. Actually, the latter two kinds of infrastructure are seldom employed due to their immature technology, relatively large construction costs, and difficulty in standardization. Currently, charging stations are widely used since, in the real world, there are different types of charging station with various levels which could be suitable for the needs of network users. In the past, the study of the location charging stations for battery electric vehicles did not take the different sizes and different types into consideration. In fact, it is of great significance to set charging stations with multiple sizes and multiple types to meet the needs of network users. In the paper, we define the model as a location problem in a capacitated network with an agent technique using multiple sizes and multiple types and formulate the model as a 0-1 mixed integer linear program (MILP) to minimize the total trip travel time of all agents. Finally, we demonstrate the model through numerical examples on two networks and make sensitivity analyses on total budget, initial quantity, and the anxious range of agents accordingly. The results show that as the initial charge increases or the budget increases, travel time for all agents can be reduced; a reduction in range anxiety can increase travel time for all agents.
引用
收藏
页数:20
相关论文
共 24 条
[1]   Online routing and battery reservations for electric vehicles with swappable batteries [J].
Adler, Jonathan D. ;
Mirchandani, Pitu B. .
TRANSPORTATION RESEARCH PART B-METHODOLOGICAL, 2014, 70 :285-302
[2]  
[Anonymous], 2012, P 2012 IEEE POW EN S
[3]   Development of a Single-Sided Flux Magnetic Coupler for Electric Vehicle IPT Charging Systems [J].
Budhia, Mickel ;
Boys, John T. ;
Covic, Grant A. ;
Huang, Chang-Yu .
IEEE TRANSACTIONS ON INDUSTRIAL ELECTRONICS, 2013, 60 (01) :318-328
[4]   A MIP model for locating slow-charging stations for electric vehicles in urban areas accounting for driver tours [J].
Cavadas, Joana ;
de Almeida Correia, Goncalo Homem ;
Gouveia, Joao .
TRANSPORTATION RESEARCH PART E-LOGISTICS AND TRANSPORTATION REVIEW, 2015, 75 :188-201
[5]  
Chen T. D., 2013, P 92 ANN M TRANSP RE
[6]   Optimal deployment of charging lanes for electric vehicles in transportation networks [J].
Chen, Zhibin ;
He, Fang ;
Yin, Yafeng .
TRANSPORTATION RESEARCH PART B-METHODOLOGICAL, 2016, 91 :344-365
[7]   Multiple Types of Plug-In Charging Facilities' Location-Routing Problem with Time Windows for Mobile Charging Vehicles [J].
Cui, Shaohua ;
Zhao, Hui ;
Zhang, Cuiping .
SUSTAINABILITY, 2018, 10 (08)
[8]   Covering problems in facility location: A review [J].
Farahani, Reza Zanjirani ;
Asgari, Nasrin ;
Heidari, Nooshin ;
Hosseininia, Mahtab ;
Goh, Mark .
COMPUTERS & INDUSTRIAL ENGINEERING, 2012, 62 (01) :368-407
[9]  
Haghbin S., 2010, The XIX International Conference on Electrical Machines - ICEM 2010, P1, DOI [10.1109/ICELMACH.2010.5608152, DOI 10.1109/ICELMACH.2010.5608152]
[10]  
Hanabusa Hisatomo, 2011, Knowledge-Based and Intelligent Information and Engineering Systems. Proceedings 15th International Conference (KES 2011), P596, DOI 10.1007/978-3-642-23854-3_63