摘要
本文提出了考虑直流潮流和电网安全约束的短期经济调度的新算法,并且从理论上证明了该算法的严格性。在计算速度、收敛性和占用计算机内存方面,本文的算法明显优于传统的Lagrange松弛算法,为处理经济调度中更复杂的约束条件提供了新方法。通过对IEEE24节点系统的计算,并与MATLAB数学软件包的计算结果相比较,表明本文的算法是有效和严格的。
This paper proposes a novel algorithm to calculate the optimizing problem of economic and security dispatch in which DC power flow and capacity limitation on power transmission line is taken into consideration. Comparing with conventional Lagrangian Relaxation approach, the proposed algorithm is more effective in calculating speed, robustness, property of convergence and core memory requirement, without introducing any multiplier. A new and efficient way is prty posed to deal with more complex constraints in economic dispatch. The theoretical proof of algorithm is also given and the advantage of that is demonstrated by calculating IEEE 24 nedes system. Moreover, it has been proved that the result based on the proposed algorithm is the same as that on MATLAB.
出处
《电网技术》
EI
CSCD
北大核心
1997年第11期61-65,69,共6页
Power System Technology
关键词
经济调度
电力系统
安全调度
算法
Econmic dispatch Security dispatch Power system Algorithm