Skip to content
naulon
Not checkedNot checked for notices yet.

Optimal Power Assignment of Energy Storage Systems to Improve the Energy Storage Efficiency for Frequency Regulation

Sung-Min Cho, Sang-Yun Yun

Energies · 2017

doi:10.3390/en10122092 (opens in a new tab)

We email you when a new notice or a question about this paper appears.

Abstract

Losses in energy storage systems (ESSs) are considered operational costs and it is critical to improve efficiency in order to expand their use. We proposed a method of improving efficiency through the operation algorithm of an ESS, consisting of multiple energy storage units (ESUs). Since the ESS used for frequency adjustment maintains a fast response characteristics, we have created a lookup table of efficient ESU operating combinations using genetic algorithms in advance to maintain a fast response time. In addition, the charge/discharge energy balance between the plurality of ESUs is maintained, and the deterioration is prevented from being concentrated in some ESUs. The proposed algorithm was reviewed based on three case studies. The first case study examined whether the lookup table obtained using the genetic algorithm well identified the optimal solution. The second compared the system that optimally distributes the output to ESUs to achieve ESS efficiency for frequency regulation with the system that uniformly distributes the output to ESUs. The third analyzed the impact of efficiency enhancement on the operation of an ESS for frequency regulation through a one-month simulation. The findings confirmed that when the entire system output is optimally allocated to the ESUs, the system’s economic efficiency can be improved by reducing the loss while maintaining the accumulative charge/discharge balance.

Abstract licence: CC BY

References13

    13 more references, whose wording the paper’s licence keeps private.

    Reads

    Read by people on this page

    None yet.

    Checked or read by AI through naulon

    None yet.

    A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.

    Are you an author?

    Is this your paper?

    Claim it to add your note and be paid when agents cite it. Free.