4.7 Article

A Distributed Online Algorithm for Promoting Energy Sharing Between EV Charging Stations

Journal

IEEE TRANSACTIONS ON SMART GRID
Volume 14, Issue 2, Pages 1158-1172

Publisher

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TSG.2022.3203522

Keywords

Charging stations; Optimization; Electric vehicle charging; Costs; Batteries; Renewable energy sources; Convex functions; Electric vehicle; charging station; energy sharing; Lyapunov optimization; renewable energy

Ask authors/readers for more resources

This paper proposes a distributed online algorithm to address the supply-demand mismatch of electric vehicle charging stations caused by fluctuating renewable generation and unpredictable charging demands. The algorithm operates in a prediction-free manner and properly satisfies time-coupling constraints. It also provides a theoretical bound for the optimality gap between offline and online solutions. Additionally, an improved ADMM algorithm is proposed for distributed computation, ensuring privacy protection and online implementation. Case studies validate the effectiveness of the proposed method.
In recent years, electric vehicle (EV) charging stations have experienced an increasing supply-demand mismatch due to their fluctuating renewable generation and unpredictable charging demands. To reduce their operating costs, this paper proposes a distributed online algorithm to promote energy sharing between charging stations. We begin with the offline and centralized version of the EV charging stations operation problem, whose objective is to minimize the long-term time-average total cost. Then, we develop an online implementation approach based on the Lyapunov optimization framework. Although the proposed online algorithm runs in a prediction-free manner, we prove that by properly choosing the parameters, the time-coupling constraints remain satisfied. We also provide a theoretical bound for the optimality gap between the offline and online optimums. Furthermore, an improved alternating direction method of multipliers (ADMM) algorithm with an iteration truncation is proposed to enable distributed computation. The proposed algorithm can protect privacy while being suitable for online implementation. Case studies validate the effectiveness of the theoretical results. Performance comparisons are carried out to demonstrate the advantages of the proposed method.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.7
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available