Please use this identifier to cite or link to this item:
|Title:||Multi-objective chance-constrained optimal day-ahead scheduling considering BESS degradation||Authors:||Xu, Yan
Engineering::Electrical and electronic engineering
|Issue Date:||2018||Source:||Xu, Y., Zhao, T., Zhao, S., Zhang, J., & Wang, Y. (2018). Multi-objective chance-constrained optimal day-ahead scheduling considering BESS degradation. CSEE Journal of Power and Energy Systems, 4(3), 316-325. doi:10.17775/CSEEJPES.2016.01050||Series/Report no.:||CSEE Journal of Power and Energy Systems||Abstract:||As battery technology matures, the battery energy storage system (BESS) becomes a promising candidate for addressing renewable energy uncertainties. BESS degradation is one of key factors in BESS operations, which is usually considered in the planning stage. However, BESS degradations are directly affected by the depth of discharge (DoD), which is closely related to the BESS daily schedule. Specifically, the BESS life losses may be different when providing the same amount of energy under a distinct DoD. Therefore, it is necessary to develop a model to consider the effect of daily discharge on BESS degradation. In this paper, a model quantifying the nonlinear impact of DoD on BESS life loss is proposed. By adopting the chance-constrained goal programming, the degradation in day-ahead unit commitment is formulated as a multi-objective optimization problem. To facilitate an efficient solution, the model is converted into a mixed integer linear programming problem. The effectiveness of the proposed method is verified in a modified IEEE 39-bus system.||URI:||https://hdl.handle.net/10356/83402
|ISSN:||2096-0042||DOI:||http://dx.doi.org/10.17775/CSEEJPES.2016.01050||Rights:||© 2016 CSEE (published by IEEE). This is an open-access article distributed under the terms of the Creative Commons Attribution License.||Fulltext Permission:||open||Fulltext Availability:||With Fulltext|
|Appears in Collections:||ERI@N Journal Articles|
Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.