一种求解机组组合问题的改进优先顺序法  

An Improved Priority List Method for Unit Commitment

作　　者：全然[1] 

机构地区：[1]河南工业大学理学院,郑州450001

出　　处：《河南科学》2015年第8期1271-1275,共5页Henan Science

基　　金：国家自然科学基金项目(71201049);河南省自然科学基金项目(132300410351)

摘　　要：提出一种求解机组组合(unit commitment,UC)问题的改进优先顺序法.利用机组的最小平均煤耗成本,建立UC问题一个新的整数线性规划模型(integer linear programming,ILP),从而将UC问题分解为一个仅含0、1变量的ILP问题和一个二次规划问题,减小了UC问题的规模和求解难度.利用ILP连续松弛问题的最优解,提出一种求解UC问题的改进优先顺序法.数值结果表明,所建ILP模型合理有效,所提方法具有良好的收敛性,和其他优先顺序法相比,获得了更好的数值结果.This paper proposes an improved priority list（IPL）approach for unit commitment（UC）problem. A new integer linear programming（ILP）is built by making use of the minimal cost per produced unit of a generating unit. As a result,the UC problem is decomposed into a 0,1 ILP and a quadratic programming,which can decrease the scale and solution burden of the UC. An IPL method is proposed to solve UC based on the optimal solution of the continuous relaxation of ILP. The numerical results indicate that the ILP built is reasonable and effective. Moreover , the presented method has nice convergence and obtains better solutions than the other priority list approaches.

关 键 词：机组组合 整数线性规划 改进优先顺序法 

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