Search: onr:"swepub:oai:DiVA.org:bth-19238" >
Optimal placement o...
Optimal placement of charging stations for electric vehicles in large-scale transportation networks
-
- Fredriksson, Henrik (author)
- Blekinge Tekniska Högskola,Institutionen för matematik och naturvetenskap,Department of Mathematics and Natural Sciences, Blekinge Institute of Technology, Karlskrona, 37179, Sweden
-
- Dahl, Mattias (author)
- Blekinge Tekniska Högskola,Institutionen för matematik och naturvetenskap,Department of Mathematics and Natural Sciences, Blekinge Institute of Technology, Karlskrona, 37179, Sweden
-
- Holmgren, Johan (author)
- Malmö universitet,Institutionen för datavetenskap och medieteknik (DVMT),Malmö Högskola, SWE
-
(creator_code:org_t)
- Elsevier B.V. 2019
- 2019
- English.
-
In: Procedia Computer Science. - : Elsevier B.V.. ; 160, s. 77-84
- Related links:
-
https://doi.org/10.1...
-
show more...
-
https://bth.diva-por... (primary) (Raw object)
-
https://doi.org/10.1...
-
http://cs-conference...
-
https://mau.diva-por... (primary) (Raw object)
-
https://urn.kb.se/re...
-
https://doi.org/10.1...
-
https://urn.kb.se/re...
-
show less...
Abstract
Subject headings
Close
- This paper presents a new practical approach to optimally allocate charging stations in large-scale transportation networks for electric vehicles (EVs). The problem is of particular importance to meet the charging demand of the growing fleet of alternative fuel vehicles. Considering the limited driving range of EVs, there is need to supply EV owners with accessible charging stations to reduce their range anxiety. The aim of the Route Node Coverage (RNC) problem, which is considered in the current paper, is to find the minimum number of charging stations, and their locations in order to cover the most probable routes in a transportation network. We propose an iterative approximation technique for RNC, where the associated Integer Problem (IP) is solved by exploiting a probabilistic random walk route selection, and thereby taking advantage of the numerical stability and efficiency of the standard IP software packages. Furthermore, our iterative RNC optimization procedure is both pertinent and straightforward to implement in computer coding and the design technique is therefore highly applicable. The proposed optimization technique is applied on the Sioux-Falls test transportation network, and in a large-scale case study covering the southern part of Sweden, where the focus is on reaching the maximum coverage with a minimum number of charging stations. The results are promising and show that the flexibility, smart route selection, and numerical efficiency of the proposed design technique, can pick out strategic locations for charging stations from thousands of possible locations w ithout numerical difficulties. ©2019 Hie Authors. Published by Elsevier B.V.
Subject headings
- TEKNIK OCH TEKNOLOGIER -- Samhällsbyggnadsteknik -- Transportteknik och logistik (hsv//swe)
- ENGINEERING AND TECHNOLOGY -- Civil Engineering -- Transport Systems and Logistics (hsv//eng)
- TEKNIK OCH TEKNOLOGIER -- Naturresursteknik -- Energisystem (hsv//swe)
- ENGINEERING AND TECHNOLOGY -- Environmental Engineering -- Energy Systems (hsv//eng)
Keyword
- Charging stations
- Clectric vehicle
- Optimal placement
- Route node coverage
- Transportation network
- Charging (batteries)
- Data communication systems
- Efficiency
- Electric vehicles
- Fleet operations
- Health care
- Internet protocols
- Iterative methods
- Location
- Alternative fuel vehicles
- Charging station
- Iterative approximations
- Large-scale transportation
- Node coverage
- Optimal placements
- Optimization techniques
- Transportation routes
Publication and Content Type
- ref (subject category)
- kon (subject category)
Find in a library
To the university's database