Fair and Scalable Electric Vehicle Charging Under Electrical Grid Constraints

The increasing penetration of electric vehicles brings a consequent increase in charging facilities in the low-voltage electricity network. Serving all charging requests on-demand can endanger the safety of the electrical power distribution network. This creates the issue of fairly allocating the ch...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on intelligent transportation systems 2023-12, Vol.24 (12), p.15169-15177
Main Authors: Tsaousoglou, Georgios, Giraldo, Juan S., Pinson, Pierre, Paterakis, Nikolaos G.
Format: Article
Language:English
Subjects:
Charging stations
Constraint modelling
Convex functions
distributed optimization
Electric power distribution
Electric power grids
Electric vehicle charging
Electric vehicles
fairness
Mathematical analysis
Mixed integer
Optimization
Power demand
power distribution system
Scalability
Task analysis
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:The increasing penetration of electric vehicles brings a consequent increase in charging facilities in the low-voltage electricity network. Serving all charging requests on-demand can endanger the safety of the electrical power distribution network. This creates the issue of fairly allocating the charging energy among electric vehicles while maintaining the system within safe operational margins. However, calculating efficient charging schedules for the charging stations bears a high computational burden due to the non-convexities of charging stations' models. In this paper, we consider a tri-level system with electric vehicles, charging stations, and a power distribution system operator. The objective of each station is formulated as a max-min fairness, mixed-integer linear optimization problem, while the network constraints are modeled using a second-order conic formulation. In order to tackle the computational complexity of the problem, we decompose it and use a novel approximation method tailored to this problem. We compare the performance of the proposed method with that of the popular alternating direction method of multipliers. Our simulation results indicate that the proposed method achieves a near-optimal solution along with promising scalability properties.
ISSN:1524-9050
1558-0016
DOI:10.1109/TITS.2023.3311509