首页 | 本学科首页   官方微博 | 高级检索  
     

电力系统动态安全调度新算法
引用本文:杨新林,孙元章.电力系统动态安全调度新算法[J].电力系统自动化,2002,26(6):1-5.
作者姓名:杨新林  孙元章
作者单位:清华大学电机系,北京市,100084
基金项目:国家重点基础研究专项经费 (G19980 2 0 315 ),国家杰出青年科学基金 (5 982 5 10 4 )
摘    要:提出了一种动态安全调度新算法。基于最大相容集的概念,从暂态稳定控制的工程背景出发,将可行域为空的动态安全调度优化问题扩展为在其最大相容集簇上的寻优问题。并将其转换成一个混合整数规划模型,解决了动态安全约束过强导致优化问题不可行及预防控制的经济代价过高等困难。试验算例证实了模型和方法的有效性,根据动态安全调度特点探讨了今后的研究方向。

关 键 词:电力系统  动态安全调度新算法  能量函数  数学模型  暂态稳定控制
收稿时间:1/1/1900 12:00:00 AM
修稿时间:2001年11月21

A NOVEL DYNAMIC SECURITY DISPATCHING METHOD FOR POWER SYSTEMS
Yang X inlin,Sun Yuanzhang Tsinghua University,Beijing ,China.A NOVEL DYNAMIC SECURITY DISPATCHING METHOD FOR POWER SYSTEMS[J].Automation of Electric Power Systems,2002,26(6):1-5.
Authors:Yang X inlin  Sun Yuanzhang Tsinghua University  Beijing  China
Affiliation:Yang X inlin,Sun Yuanzhang Tsinghua University,Beijing 10 0 0 84,China
Abstract:This paper presents a dynamic security dispatching method. Based on the concept of maxim um com patible set, infeasible optimization problem s are extended to the optimization problem s on its maxim um com patible set fam ily.A linear mixed integer programming model is proposed to tackle the extended optim ization problem . The extension is applied to dynam ic security dispatching problem s,and overcomes the two m ain difficulties in dynamic security dispatching research: optimization problem infeasibility due to strong dynam ic security constrains and im practical result for high costof rescheduling of generation. Test exam ple proves that the m ethod can handle problem of multi- fault scenarios effectively. L astly,the further researching directions are discussed.
Keywords:power systems  dynamic security dispatching  transient stability control  optim ization problems
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《电力系统自动化》浏览原始摘要信息
点击此处可从《电力系统自动化》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号