A fast technique for unit commitment problem by extended priority list
A fast technique for unit commitment problem by extended priority list
复制标题
DOI：
10.1109/pes.2003.1270471
复制
发表时间：
2003-05
期刊：
影响因子：
--
通讯作者：
T. Senjyu;Kenji Shimabukuro;K. Uezato;T. Funabashi
中科院分区：
文献类型：
--
作者：
T. Senjyu;Kenji Shimabukuro;K. Uezato;T. Funabashi
本文提出了一种新的机组组合问题，采用扩展优先级表（EPL）方法。EPL方法分为两步，第一步利用优先级表法快速得到初始机组组合计划。在该步骤中，忽略操作约束。在第二步中，使用问题特定的算法来修改单元调度以满足操作约束。然而，为了有效地计算，请注意，一些算法仅应用于可以预期改进的解决方案。数值算例验证了该方法的有效性。
This paper introduces a new unit commitment problem, adapting extended priority list (EPL) method. The EPL method consists of two steps, in the first step we get rapidly some initial unit commitment problem schedules by priority list (PL) method. At this step, operational constraints are disregarded. In the second step unit schedule is modified using the problem specific heuristics to fulfill operational constraints. To calculate efficiently, however, note that some heuristics is applied only to solutions can expect improvement. Several numerical examples demonstrate the effectiveness of proposed method.