Short-Term Optimal Scheduling of Power Grids Containing Pumped-Storage Power Station Based on Security Quantification

Author:

Li Hua1,Qiu Xiangfei2,Xi Qiuyi1,Wang Ruogu1,Zhang Gang3ORCID,Wang Yanxin1,Zhang Bao3

Affiliation:

1. Electric Power Research Institute, State Grid Shaanxi Electric Power Co., Ltd., Xi’an 710048, China

2. State Grid Shaanxi Electric Power Company, Xi’an 710046, China

3. School of Electrical Engineering, Xi’an University of Technology, Xi’an 710048, China

Abstract

In order to improve grid security while pursuing a grid operation economy and new energy consumption rates, this paper proposes a short-term optimal scheduling method based on security quantification for the grid containing a pumped-storage power plant. The method first establishes a grid security evaluation model to evaluate grid security from the perspective of grid resilience. Then, a short-term optimal dispatch model of the grid based on security quantification is constructed with the new energy consumption rate and grid loss as the objectives. In addition, an efficient intelligent optimization algorithm, Dung Beetle Optimization, is introduced to solve the scheduling model, dynamically updating the evaluation intervals during the iterative solution process and evaluating the grid security level and selecting the best result after the iterative solution. Finally, the improvement in the term IEEE 30-bus grid connected to a pumped-storage power plant is used as an example to verify the effectiveness of the proposed method and model.

Funder

Electric Power Research Institute of State Grid Shanxi Electric Power Company

Publisher

MDPI AG

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3