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

提出用网流法解算电力系统N-1安全有功经济调度问题,首次将线路N-1安全性约束引入到网流模型中,把N-1安全有功经济调度问题化为一个简单的增量网流校正模型,缓解了网流法中某些误差和缺点,文中解算方法采用的是计算快速,收敛可靠的OKA算法。通过对IEEE-30节点系统进行计算,并与有关文献结果比较表明,本文方法是可行的。

THE ECONOMIC DISPATCH OF REAL POWER WITH SECURITY

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.