您的位置:首页  > 论文页面

求解机组组合问题的拓广割平面方法

发表时间:2010-07-31  浏览量:1119  下载量:439
全部作者: 全然,简金宝
作者单位: 广西大学电气工程学院;广西大学数学与信息科学学院
摘 要: 提出一种求解机组组合(unit commitment,UC)问题的拓广割平面方法(extended cutting plane method, ECPM)。首先把UC问题转化为一个凸混合整数二次规划(mixed integer quadratic programming,MIQP)问题,然后利用ECPM求解此凸MIQP� ECPM是求解凸非线性规划问题割平面法的一种拓广方法,通过逐次求解混合整数线性规划问题获得凸混合整数非线性规划问题的全局最优解。100机组24时段等6个系统的仿真结果表明:所提方法能在较少的计算时间内求得较高质量的次优解,适合求解大规模的UC问题,是一种有应用前景的计算方法。
关 键 词: 电力系统及其自动化;机组组合;混合整数二次规划;拓广割平面方法;混合整数线性规划
Title: An extended cutting plane method for solving unit commitment
Author: QUAN Ran, JIAN Jinbao
Organization: College of Electrical Engineering, Guangxi University;College of Mathematics and Information Science, Guangxi University
Abstract: An extended cutting plane method (ECPM) is proposed for solving unit commitment (UC) problems. First, the unit commitment problem is reformulated as a convex mixed integer quadratic programming (MIQP), then, ECPM is used to solve the MIQP. The ECPM is an extended cutting plane method for the solution of convex nonlinear programming, and it can get the global solution of the convex mixed integer nonlinear programming by sequentially solving mixed integer linear programming. The simulation results for systems up to 100 units and 24 hours show that the presented method can yield good sub�optimal solution in less computing time and is suitable for solving large scale unit commitment problems. Hence, it is a prospective method in the future.
Key words: electric power system and automation; unit commitment; mixed integer quadratic programming; extended cutting plane method; mixed integer linear programming
发表期数: 2010年7月第14期
引用格式: 全然,简金宝. 求解机组组合问题的拓广割平面方法[J]. 中国科技论文在线精品论文,2010,3(14):1464-1468.
 
0 评论数 0
暂无评论
友情链接