Smart Charging of Electric Vehicles Considering SOC-Dependent Maximum Charging Powers

Benjamin Schaden, Thomas Jatschka, Steffen Limmer and Günther Robert Raidl
Additional contact information
Benjamin Schaden: Institute of Logic and Computation, TU Wien, 1040 Vienna, Austria
Thomas Jatschka: Institute of Logic and Computation, TU Wien, 1040 Vienna, Austria
Steffen Limmer: Honda Research Institute Europe GmbH, 63073 Offenbach, Germany
Günther Robert Raidl: Institute of Logic and Computation, TU Wien, 1040 Vienna, Austria

Energies, 2021, vol. 14, issue 22, 1-33

Abstract: The aim of this work is to schedule the charging of electric vehicles (EVs) at a single charging station such that the temporal availability of each EV as well as the maximum available power at the station are considered. The total costs for charging the vehicles should be minimized w.r.t. time-dependent electricity costs. A particular challenge investigated in this work is that the maximum power at which a vehicle can be charged is dependent on the current state of charge (SOC) of the vehicle. Such a consideration is particularly relevant in the case of fast charging. Considering this aspect for a discretized time horizon is not trivial, as the maximum charging power of an EV may also change in between time steps. To deal with this issue, we instead consider the energy by which an EV can be charged within a time step. For this purpose, we show how to derive the maximum charging energy in an exact as well as an approximate way. Moreover, we propose two methods for solving the scheduling problem. The first is a cutting plane method utilizing a convex hull of the, in general, nonconcave SOC–power curves. The second method is based on a piecewise linearization of the SOC–energy curve and is effectively solved by branch-and-cut. The proposed approaches are evaluated on benchmark instances, which are partly based on real-world data. To deal with EVs arriving at different times as well as charging costs changing over time, a model-based predictive control strategy is usually applied in such cases. Hence, we also experimentally evaluate the performance of our approaches for such a strategy. The results show that optimally solving problems with general piecewise linear maximum power functions requires high computation times. However, problems with concave, piecewise linear maximum charging power functions can efficiently be dealt with by means of linear programming. Approximating an EV’s maximum charging power with a concave function may result in practically infeasible solutions, due to vehicles potentially not reaching their specified target SOC. However, our results show that this error is negligible in practice.

Keywords: electric vehicles; charging scheduling; state-of-charge dependent maximum charging power; mixed integer linear programming (search for similar items in EconPapers)
JEL-codes: Q Q0 Q4 Q40 Q41 Q42 Q43 Q47 Q48 Q49 (search for similar items in EconPapers)
Date: 2021
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (4)

Downloads: (external link)
https://www.mdpi.com/1996-1073/14/22/7755/pdf (application/pdf)
https://www.mdpi.com/1996-1073/14/22/7755/ (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:gam:jeners:v:14:y:2021:i:22:p:7755-:d:682658

Access Statistics for this article

Energies is currently edited by Ms. Agatha Cao

More articles in Energies from MDPI
Bibliographic data for series maintained by MDPI Indexing Manager ().