一种基于可行性条件的具有爬升限制的安全约束机组组合系统方法(英文)  

A Systematic Method Based on Feasibility Conditions for Constructing Feasible Schedules to Security Constrained Unit Commitment Problems with Ramping Constraints

作　　者：郭三刚[1] 

机构地区：[1]陕西理工学院数学与计算机科学学院,汉中723000

出　　处：《科学技术与工程》2014年第12期46-56,共11页Science Technology and Engineering

基　　金：陕西省教育厅自然科学基金(11JK0498)资助

摘　　要：提出了在Lagrangian松弛框架下的、基于可行解条件的求解具有爬升限制的安全约束机组组合问题的一种系统方法。对每个调度时段,将不可行机组组合的调整为可行的机组组合的问题建立为一个0-1整数线性规划问题。然后,使用分支定界方法求解之,试图在机会成本最小化下,将不可行机组组合调整为可行的机组组合。最后,求解经济分配问题。使用IEEE标准测试数据验证了算法的有效性。A new systematic method based on some feasibility conditions is proposed for constructing a near-op- timal SCUC schedule within Lagrangian Relaxation framework by adjusting some infeasible SCUC statuses at each schedule hour to be feasible ones. The problem of adjusting SCUC statuses is formulated as a 0 - 1 linear programming problem based on some conditions and branch and bound method is applied to solve it and a feasible SCUC at each schedule hour with minimum ＂opportunity cost＂ can be obtained. The efficiency and effectiveness of the proposed method is demonstrated by using the standard IEEE testing data.

关 键 词：安全约束机组组合 爬升约束 电力生产调度Lagrangian松弛 

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