A platform for research: civil engineering, architecture and urbanism
A platform for research: civil engineering, architecture and urbanism
Energy Storage Sharing for Multiple Services Provision: A Computable Combinatorial Auction Design
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.
Energy Storage Sharing for Multiple Services Provision: A Computable Combinatorial Auction Design
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.
Energy Storage Sharing for Multiple Services Provision: A Computable Combinatorial Auction Design
Bo Wei (author) / Wenfei Liu (author) / Chong Shao (author) / Yong Yang (author) / Yanbing Su (author) / Zhaoyuan Wu (author)
2023
Article (Journal)
Electronic Resource
Unknown
Metadata by DOAJ is licensed under CC BY-SA 1.0
Provision of multiple services with controllable loads as multi-area thermal energy storage
| BASE | 2023
| Taylor & Francis Verlag | 1997
| British Library Online Contents | 1997