Privacy-Preserving Operation Management of Battery Swapping and Charging System with Dual-Based Benders Decomposition
The battery swapping and charging system (BSCS) is an emerging and promising infrastructure to provide the energy refueling service for EVs. However, each operator (i.e., battery swapping module (BSM) operator and battery charging module (BCM) operator) in BSCS has privacy-preserving requirement and...
Gespeichert in:
Veröffentlicht in: | IEEE transactions on smart grid 2023-09, Vol.14 (5), p.1-1 |
---|---|
Hauptverfasser: | , , , , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext bestellen |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Zusammenfassung: | The battery swapping and charging system (BSCS) is an emerging and promising infrastructure to provide the energy refueling service for EVs. However, each operator (i.e., battery swapping module (BSM) operator and battery charging module (BCM) operator) in BSCS has privacy-preserving requirement and individual interest, which brings challenge to the operation management of BSCS. To this end, this paper investigates the privacy-preserving operation management problem (OMP) of BSCS from a social perspective, in which a comprehensive battery-swapping-charging process is modeled. Specifically, we first model the OMP as a constrained mixed-integer programming (MIP), where the evolutionary of the dynamic battery inventory and the SoC of charging batteries are considered simultaneously. Due to the privacy-preserving requirements of different operators and the strong coupling between continuous and binary decision variables, a novel dual-based Benders decomposition (DBD) algorithm is then developed, which has the following two merits: 1) Each BCM and BSM operator can independently solve its own charging and swapping scheduling problem, thus preserving the privacy of individual operator; 2) The combination of dual decomposition and Benders decomposition techniques facilitates a parallel implementation, thus improving the scheduling efficiency and saving the computational time. Finally, simulation results are provided to validate the effectiveness and scalability of the proposed algorithm. |
---|---|
ISSN: | 1949-3053 1949-3061 |
DOI: | 10.1109/TSG.2023.3236329 |