利用外逼近方法(OAM)提出一种求解机组组合(UC)问题新的确定性方法。OAM是一种分解方法,它把UC问题分解为一系列的混合整数线性规划(MILP)主问题和非线性规划(NLP)子问题。应用分支割平面方法求解MILP,应用新的零空间内点法求解NLP。54机组168时段等多个系统的数值仿真表明,OAM具有快速的收敛速度,能有效处理爬坡约束,为大规模安全约束机组组合问题的有效求解提供了一条新途径。
国家自然科学基金
A novel deterministic algorithm for solving medium term unit commitment(UC) problem based on outer approximation method(OAM) is presented. As a decomposition method, OAM decomposes UC problem into a sequence of mixed integer linear programming(MILP) master problems and nonlinear programming(NLP) sub-problems. Branch-and-cut method is used to solve the MILP and a new null space interior point method is used to solve the NLP. The simulation results tested on systems up to 54 units and 168 hours show that OAM can converge fast and handle the ramp rate constraints efficiently. Thus, OAM gives a new technique for solving large scale security-constrained unit commitment problems efficiently.
[1] | 全然 ,简金宝 ,等.基于外逼近方法的中期机组组合问题[J].电力系统自动化,2009,33(11):24-28. DOI:10.7500/AEPS200811220. QUAN Ran, JIAN Jinbao, ZHENG Haiyan. Medium Term Unit Commitment Based on Outer Approximation Method[J]. Automation of Electric Power Systems, 2009, 33(11):24-28. DOI:10.7500/AEPS200811220. |