arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1606.05710math.OC
收藏

机组组合问题的一种新的投影二元变量形式

A Novel Projected Two Binary Variables Formulation for Unit Commitment Problem

Linfeng Yang, Chen Zhang, Jinbao Jian, Ke Meng, Zhaoyang Dong

摘要:

火电机组组合问题通常可以归结为一个混合整数二次规划问题,特别是对于大规模的火电机组组合问题,其求解效率很低。本文通过将单元发电水平投影到[0,1]上并采用重构技术,提出了一种求解UC问题的新的双二进制(2-bin)变量MIQP公式。我们表明,2箱制定是更紧凑的比国家的最先进的一个二进制(1箱)变量制定和三个二进制(3箱)变量制定。此外,在二次费用函数下,2-bin公式比1-bin和3-bin公式更严格,在线性约束下,2-bin公式比1-bin公式更严格。通过将目标函数中的二次项替换为一系列分段透视割,可以从三个UC MIQP中得到三个混合整数线性规划(MILP)公式。2-由于与MIQP相似的原因,bin MILP也是最好的一个。模拟结果的实际情况下,范围从10到200个单位在24小时的调度期内的大小表明,所提出的2箱配方是有竞争力的,目前国家的最先进的配方和有前途的大规模UC问题。

英文摘要:

The thermal unit commitment (UC) problem often can be formulated as a mixed integer quadratic programming (MIQP), which is difficult to solve efficiently, especially for large-scale instances. In this paper, with projecting unit generation level onto [0,1] and reformulation techniques, a novel two binary (2-bin) variables MIQP formulation for UC problem is presented. We show that 2-bin formulation is more compact than the state-of-the-art one binary (1-bin) variable formulation and three binary (3-bin) variables formulation. Moreover, 2-bin formulation is tighter than 1-bin and 3-bin formulations in quadratic cost function, and it is tighter than 1-bin formulation in linear constraints. Three mixed integer linear programming (MILP) formulations can be obtained from three UC MIQPs by replacing the quadratic terms in the objective functions by a sequence of piece-wise perspective-cuts. 2-bin MILP is also the best one due to the similar reasons of MIQP. The simulation results for realistic instances that range in size from 10 to 200 units over a scheduling period of 24 hours show that the proposed 2-bin formulations are competitive with currently state-of-the-art formulations and promising for large-scale UC problems.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑