电力系统N-1安全有功经济调度  

THE ECONOMIC DISPATCH OF REAL POWER WITH SECURITY

作　　者：朱继忠[1] 徐国禹[1] 

机构地区：[1]重庆大学电气工程系

出　　处：《重庆大学学报（自然科学版）》1992年第2期105-109,共5页Journal of Chongqing University

基　　金：国家自然科学基金

摘　　要：提出用网流法解算电力系统N-1安全有功经济调度问题,首次将线路N-1安全性约束引入到网流模型中,把N-1安全有功经济调度问题化为一个简单的增量网流校正模型,缓解了网流法中某些误差和缺点,文中解算方法采用的是计算快速,收敛可靠的OKA算法。通过对IEEE-30节点系统进行计算,并与有关文献结果比较表明,本文方法是可行的。This paper presents an approach to studing the economic dispatch of real power with N-1 security with the network flow programming (NFP), the N-1 line - security constraints are first introduced into the network f olw model and the problem of N-1 security economic dispatch becomes an incremental metwork flow model. Therefore, the shortage of NFP is mitigated to some extent, The solution adopted is the 'out-of-kilter'algorithm(OKA), which is characterized by fast calculation and reliable convergency. The model and solution are tested on IEEE 30-bus system, and the results show that the proposed approach is feasible.

关 键 词：网络规划 安全分析 电力系统 调度 

分 类 号：TM732[电气工程—电力系统及自动化]