考虑网络安全约束的机组组合新算法

市场机制驱使电网运行于安全极限的边缘,考虑网络安全约束的机组组合问题变得尤为重要,基于对偶原理的拉格朗日松弛法是解决这一问题的有效途径。文章提出了一种解决网络安全约束下的机组组合问题的新算法,在拉格朗日对偶分解的基础上结合变量复制技术,通过引入附加人工约束将网络约束嵌入单机子问题中,实现在机组组合中考虑网络安全约束。该算法摆脱了现有各种处理手段在解决网络安全约束的机组组合问题时将网络安全约束与机组启停相分离的不足,揭示了安全经济调度和安全约束下的机组组合在概念上的区别和联系。

A New Unit Commitment Algorithm Considering Network Security Constraints

Market deregulation makes transmission networks running near the edge of security limit, so it is particularly important to consider network security constraints in unit commitment and the Lagrangian relaxation method based on dual principle is an effective way to solve this problem. The authors propose a new algorithm to solve the unit commitment under network security constraints, i.e., on the basis of dual Lagrangian function integrated with variable duplication the network security constraints are embedded into the sub-problem of single unit by means of leading in additional artificial constraints, and the network security constraints are considered during unit commitment. The proposed algorithm overcomes the defect, namely, existing methods make the network security constraints separate from turn on/off of units while unit commitment constrained by network security is settled, and reveals conceptive difference and relation between secure economic dispatching and security constrained unit commitment.