Abstract
Given the profound integration of the sharing economy and the energy system, energy storage sharing is promoted as a viable solution to address the underutilization of energy storage and the challenges associated with cost recovery. While energy storage sharing offers various services for system operation, a significant question remains regarding the development of an optimal allocation model for shared energy storage in diverse application scenarios and the proposal of efficient solving algorithms. This paper presents the design of a computable combinatorial mechanism aimed at facilitating energy storage sharing. Leveraging the distinct characteristics of buyers and sellers engaged in energy storage sharing, we propose a combinatorial auction solving algorithm that prioritizes and incorporates the offers of shared energy storage, accounting for temporal variations in the value of energy resources. The numerical results demonstrate that the proposed solving algorithm achieves a computation time reduction of over 95%, adequately meeting the practical requirements of industrial applications. Importantly, the proposed method maintains a high level of computational accuracy, ranging from 92% to 98%, depending on the participants and application scenarios. Hopefully, our work is able to provide a useful reference for the further mechanism design for energy storage sharing.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
