IDEAS home Printed from https://ideas.repec.org/a/gam/jeners/v17y2024i21p5427-d1510383.html
   My bibliography  Save this article

A Day-Ahead Economic Dispatch Method for Renewable Energy Systems Considering Flexibility Supply and Demand Balancing Capabilities

Author

Listed:
  • Zheng Yang

    (Central China Branch of State Grid Corporation of China, Wuhan 430077, China)

  • Wei Xiong

    (Central China Branch of State Grid Corporation of China, Wuhan 430077, China)

  • Pengyu Wang

    (School of Electrical Engineering and Automation, Wuhan University, Wuhan 430072, China)

  • Nuoqing Shen

    (School of Electrical Engineering and Automation, Wuhan University, Wuhan 430072, China)

  • Siyang Liao

    (School of Electrical Engineering and Automation, Wuhan University, Wuhan 430072, China)

Abstract

The increase in new energy grid connections has reduced the supply-side regulation capability of the power system. Traditional economic dispatch methods are insufficient for addressing the flexibility limitations in the system’s balancing capabilities. Consequently, this study presents a day-ahead scheduling method for renewable energy systems that balances flexibility and economy. This approach establishes a dual-layer optimized scheduling model. The upper-layer model focuses on the economic efficiency of unit start-up and shut-down, utilizing a particle swarm algorithm to identify unit combinations that comply with minimum start-up and shut-down time constraints. In contrast, the lower-layer model addresses the dual uncertainties of generation and load. It employs the Generalized Polynomial Chaos approximation to create an opportunity-constrained model aimed at minimizing unit generation and curtailment costs while maximizing flexibility supply capability. Additionally, it calculates the probability of flexibility supply-demand insufficiency due to uncertainties in demand response resource supply and system operating costs, providing feedback to the upper-layer model. Ultimately, through iterative solutions of the upper and lower models, a day-ahead scheduling plan that effectively balances flexibility and economy is derived. The proposed method is validated using a simulation of the IEEE 30-bus system case study, demonstrating its capability to balance system flexibility and economy while effectively reducing the risk of insufficient supply-demand balance.

Suggested Citation

  • Zheng Yang & Wei Xiong & Pengyu Wang & Nuoqing Shen & Siyang Liao, 2024. "A Day-Ahead Economic Dispatch Method for Renewable Energy Systems Considering Flexibility Supply and Demand Balancing Capabilities," Energies, MDPI, vol. 17(21), pages 1-20, October.
    • Handle: RePEc:gam:jeners:v:17:y:2024:i:21:p:5427-:d:1510383
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/1996-1073/17/21/5427/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/1996-1073/17/21/5427/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. G. C. Calafiore & L. El Ghaoui, 2006. "On Distributionally Robust Chance-Constrained Linear Programs," Journal of Optimization Theory and Applications, Springer, vol. 130(1), pages 1-22, July.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Wenqing Chen & Melvyn Sim & Jie Sun & Chung-Piaw Teo, 2010. "From CVaR to Uncertainty Set: Implications in Joint Chance-Constrained Optimization," Operations Research, INFORMS, vol. 58(2), pages 470-485, April.
    2. Bilsel, R. Ufuk & Ravindran, A., 2011. "A multiobjective chance constrained programming model for supplier selection under uncertainty," Transportation Research Part B: Methodological, Elsevier, vol. 45(8), pages 1284-1300, September.
    3. Rashed Khanjani-Shiraz & Ali Babapour-Azar & Zohreh Hosseini-Noudeh & Panos M. Pardalos, 2022. "Distributionally robust maximum probability shortest path problem," Journal of Combinatorial Optimization, Springer, vol. 43(1), pages 140-167, January.
    4. L. Jeff Hong & Zhiyuan Huang & Henry Lam, 2021. "Learning-Based Robust Optimization: Procedures and Statistical Guarantees," Management Science, INFORMS, vol. 67(6), pages 3447-3467, June.
    5. Xufeng Tang & Chang Liu & Xinqi Li & Ying Ji, 2023. "Distributionally Robust Programming of Berth-Allocation-with-Crane-Allocation Problem with Uncertain Quay-Crane-Handling Efficiency," Sustainability, MDPI, vol. 15(18), pages 1-27, September.
    6. Corina Birghila & Tim J. Boonen & Mario Ghossoub, 2023. "Optimal insurance under maxmin expected utility," Finance and Stochastics, Springer, vol. 27(2), pages 467-501, April.
    7. Jiang, Jie & Peng, Shen, 2024. "Mathematical programs with distributionally robust chance constraints: Statistical robustness, discretization and reformulation," European Journal of Operational Research, Elsevier, vol. 313(2), pages 616-627.
    8. Wolfram Wiesemann & Daniel Kuhn & Melvyn Sim, 2014. "Distributionally Robust Convex Optimization," Operations Research, INFORMS, vol. 62(6), pages 1358-1376, December.
    9. Arthur Flajolet & Sébastien Blandin & Patrick Jaillet, 2018. "Robust Adaptive Routing Under Uncertainty," Operations Research, INFORMS, vol. 66(1), pages 210-229, January.
    10. Fang, Xin & Hodge, Bri-Mathias & Du, Ershun & Zhang, Ning & Li, Fangxing, 2018. "Modelling wind power spatial-temporal correlation in multi-interval optimal power flow: A sparse correlation matrix approach," Applied Energy, Elsevier, vol. 230(C), pages 531-539.
    11. Erick Delage & Shie Mannor, 2010. "Percentile Optimization for Markov Decision Processes with Parameter Uncertainty," Operations Research, INFORMS, vol. 58(1), pages 203-213, February.
    12. Postek, Krzysztof & Ben-Tal, A. & den Hertog, Dick & Melenberg, Bertrand, 2015. "Exact Robust Counterparts of Ambiguous Stochastic Constraints Under Mean and Dispersion Information," Other publications TiSEM d718e419-a375-4707-b206-e, Tilburg University, School of Economics and Management.
    13. Zheng Zhang & Brian T. Denton & Xiaolan Xie, 2020. "Branch and Price for Chance-Constrained Bin Packing," INFORMS Journal on Computing, INFORMS, vol. 32(3), pages 547-564, July.
    14. Weijun Xie & Shabbir Ahmed, 2020. "Bicriteria Approximation of Chance-Constrained Covering Problems," Operations Research, INFORMS, vol. 68(2), pages 516-533, March.
    15. Grani A. Hanasusanto & Vladimir Roitch & Daniel Kuhn & Wolfram Wiesemann, 2017. "Ambiguous Joint Chance Constraints Under Mean and Dispersion Information," Operations Research, INFORMS, vol. 65(3), pages 751-767, June.
    16. Liu, Ming & Liu, Xin & Chu, Feng & Zheng, Feifeng & Chu, Chengbin, 2019. "Distributionally robust inventory routing problem to maximize the service level under limited budget," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 126(C), pages 190-211.
    17. Dawen Yan & Xiaohui Zhang & Mingzheng Wang, 2021. "A robust bank asset allocation model integrating credit-rating migration risk and capital adequacy ratio regulations," Annals of Operations Research, Springer, vol. 299(1), pages 659-710, April.
    18. Fang, Xin & Cui, Hantao & Yuan, Haoyu & Tan, Jin & Jiang, Tao, 2019. "Distributionally-robust chance constrained and interval optimization for integrated electricity and natural gas systems optimal power flow with wind uncertainties," Applied Energy, Elsevier, vol. 252(C), pages 1-1.
    19. Fengmin Xu & Meihua Wang & Yu-Hong Dai & Dachuan Xu, 2018. "A sparse enhanced indexation model with chance and cardinality constraints," Journal of Global Optimization, Springer, vol. 70(1), pages 5-25, January.
    20. Olivier Klopfenstein, 2010. "Solving chance-constrained combinatorial problems to optimality," Computational Optimization and Applications, Springer, vol. 45(3), pages 607-638, April.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:gam:jeners:v:17:y:2024:i:21:p:5427-:d:1510383. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.