A Stochastic Programming Approach for Electric Vehicle Charging Network Design

The advantages of electric vehicles (EVs) include reduction of greenhouse gas and other emissions, energy security, and fuel economy. The societal benefits of large-scale adoption of EVs cannot be realized without adequate deployment of publicly accessible charging stations. We propose a two-stage s...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE transactions on intelligent transportation systems Jg. 20; H. 5; S. 1870 - 1882
Hauptverfasser: Faridimehr, Sina, Venkatachalam, Saravanan, Chinnam, Ratna Babu
Format: Journal Article
Sprache:Englisch
Veröffentlicht: New York IEEE 01.05.2019
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Schlagworte:
Batteries
charging network
Charging stations
Communities
Drivers
Dwell time
electric vehicle
Electric vehicle charging
Electric vehicles
Fuel economy
Greenhouse effect
Greenhouse gases
Mathematical programming
Network design
Programming
sample average approximation
Stations
Stochastic processes
Stochastic programming
Two-stage stochastic programming
Uncertainty
ISSN:1524-9050, 1558-0016
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:The advantages of electric vehicles (EVs) include reduction of greenhouse gas and other emissions, energy security, and fuel economy. The societal benefits of large-scale adoption of EVs cannot be realized without adequate deployment of publicly accessible charging stations. We propose a two-stage stochastic programming model to determine the optimal network of charging stations for a community, considering uncertainties in the arrival and dwell times of vehicles, the state of charge of arriving vehicles' batteries, drivers' walking ranges and charging preferences, demand during weekdays and weekends, and the community's rate of EV adoption. We conducted studies using the sample average approximation method, which asymptotically converges to an optimal solution for a two-stage stochastic problem. However, this method is computationally expensive for large-scale instances. Therefore, we also developed a heuristic to produce nearly optimal solutions quickly for our data instances. We conducted computational experiments using various publicly available data sources and evaluated the benefits of the solutions for a given community, both quantitatively and qualitatively.
Bibliographie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1524-9050
1558-0016
DOI:10.1109/TITS.2018.2841391