Optimal Allocation of Charging Stations for Electric Vehicles Using Probabilistic Route Selection

Authors

  • Henrik Fredriksson Department of Mathematics and Natural Sciences, Blekinge Institute of Technology, 371 79 Karlskrona, Sweden
  • Mattias Dahl Department of Mathematics and Natural Sciences, Blekinge Institute of Technology, 371 79 Karlskrona, Sweden
  • Johan Holmgren Department of Computer Science and Media Technology, Malmö University, 205 06 Malmö, Sweden

DOI:

https://doi.org/10.31577/cai_2021_2_408

Keywords:

Charging stations, electric vehicle, transportation network, optimal placement, self-avoiding random walk

Abstract

Electric vehicles (EVs) are environmentally friendly and are considered to be a promising approach toward a green transportation infrastructure with lower greenhouse gas emissions. However, the limited driving range of EVs demands a strategic allocation of charging facilities, hence providing recharging opportunities that help reduce EV owners' anxiety about their vehicles' range. In this paper, we study a set covering method where self-avoiding walks are utilized to find the most significant locations for charging stations. In the corresponding optimization problem, we derive a lower bound of the number of charging stations in a transportation network to obtain full coverage of the most probable routes. The proposed method is applied to a transportation network of the southern part of Sweden.

Downloads

Download data is not yet available.

Downloads

Published

2021-10-12

How to Cite

Fredriksson, H., Dahl, M., & Holmgren, J. (2021). Optimal Allocation of Charging Stations for Electric Vehicles Using Probabilistic Route Selection. Computing and Informatics, 40(2), 408–427. https://doi.org/10.31577/cai_2021_2_408