期刊文献+

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

Linearization method of large scale unit commitment problem with network constraints
下载PDF
导出
摘要 为了提高求解机组组合问题计算效率,给出线性化方法,将目标函数分段线性化,将启机费用作为约束并将其线性化,同时将网络安全约束通过直流潮流模型进行线性化,从而建立较完备的混合整数线性规划的机组组合模型。采用世界上广为流行的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.
出处 《电力系统保护与控制》 EI CSCD 北大核心 2010年第18期135-139,共5页 Power System Protection and Control
关键词 机组组合 线性化方法 混合整数线性规划 CPLEX unit commitment linearization method: mixed integer linear programming CPLEX
  • 相关文献

参考文献17

  • 1Senjyu T,Shimabukuro K,Uezato K,et al.A fast technique for unit commitment problem by extended priority list[J].IEEE Transactions on Power Systems,2003,18(2):882-888.
  • 2王成文,韩勇,谭忠富,刘严,杨力俊.一种求解机组组合优化问题的降维半解析动态规划方法(英文)[J].电工技术学报,2006,21(5):110-116. 被引量:9
  • 3王承民,郭志忠,于尔铿.确定机组组合的一种改进的动态规划方法[J].电网技术,2001,25(5):20-24. 被引量:29
  • 4Cheng Chuan-ping,Liu Chihwen,Liu Chun-chang.Unit commitment by lagrangian relaxation and genetic algorithm[J].IEEE Transactions on Power Systems,2000,15(2):707-714.
  • 5Fu Yong,Li Zu-yi.Security-constrained unit commitment with AC constraints[J].IEEE Transactions on Power Systems,2005,20(3):1538-1550.
  • 6Weerakorn Ongsakul,Nit Petcharaks.Unit commitment by enhanced adaptive lagrangian relaxation[J].IEEE Transactions on Power Systems,2004,19(1):620-628.
  • 7张炯,刘天琪,苏鹏,张鑫.基于遗传粒子群混合算法的机组组合优化[J].电力系统保护与控制,2009,37(9):25-29. 被引量:31
  • 8Juste K A,Kita H,Tanak A E,et al.An evolutionary programming solution to the unit commitment problem[J].IEEE Transactions on Power Systems,1999,14(4):1452–1459.
  • 9李鹏飞,都洪基,郭亮,李仁东.基于免疫算法的火电厂机组优化组合[J].继电器,2007,35(S1):365-368. 被引量:6
  • 10Marcelino Madrigal,Victor H Quintana.Semidefinite programming relaxations for {0,1} power dispatch problems[C].//IEEE Power Eng Soc Summer Meeting Conf.Edmonton(Canada):1999:697-702.

二级参考文献52

共引文献116

同被引文献302

引证文献22

二级引证文献198

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部