大规模机组组合问题计及网络约束的线性化求解方法  

Linearization method of large scale unit commitment problem with network constraints

作　　者：苏济归[1] 舒隽[1] 谢国辉[1] 张粒子[1] 

机构地区：[1]华北电力大学电气与电子工程学院,北京102206

出　　处：《电力系统保护与控制》2010年第18期135-139,共5页Power System Protection and Control

摘　　要：为了提高求解机组组合问题计算效率,给出线性化方法,将目标函数分段线性化,将启机费用作为约束并将其线性化,同时将网络安全约束通过直流潮流模型进行线性化,从而建立较完备的混合整数线性规划的机组组合模型。采用世界上广为流行的CPLEX优化求解器求解,在对偶间隙设定为较合理的情况下,求解速度快。不同测试算例表明,该方法速度快,精度较高,能够求解较大规模的机组组合问题。To improve computational efficiency of unit commitment（UC） problem, linearization method is put forward. First object function is linearized through piecewise-linear method, startup cost is treated as constraints which are also linearized,and network security constraints are linearized through direct current （DC） flow model, so a complete mixed integer linear programming unit commitment model is built. Then the model is solved through a popular CPLEX solver. Different examples show that calculation is very fast when the dual gap is reasonable, and the above-mentioned method can improve computational efficiency to solve large scale unit commitment problem.

关 键 词：机组组合 线性化方法 混合整数线性规划 CPLEX 

分 类 号：TM744[电气工程—电力系统及自动化] O221.4[理学—运筹学与控制论]