基于改进的逆序排序法的机组组合优化算法

文章提出了改进的逆序排序法来求解机组组合优化问题.该算法从可用机组全投入运行这一可行解出发,在每次迭代过程中优化一台机组在整个调度周期内的开停状况,以最小化总生产成本或总购电成本,直到连续两次迭代的目标函数值不再减小为止.该方法的显著优点在于计算不会振荡,迭代不会发散,且每次迭代的结果均为可行解.该算法在单机组优化过程中,以机组的最小启停区间而不是单个时段为研究调度对象,缓解了组合爆炸问题,明显地加快了计算速度.

A modified unit decommitment method for unit commitment

A modified unit decommitment method is proposed for unit commitment problems. The algorithm starts with the initial solution where all the available units are on stream. One and only one unit schedule is made in each iteration to minimize the objective function, utill the objective function cannot be further optimized. A noticeable advantage of the new method is that all the intermedia solutions during the iterations retain the feasibility. In the single-unit optimization process, minimum up and down time constraints are considered, and, instead of single time interval, the time-lag when the units must be on or off are used for scheduling. Thus, the number of the feasible solutions to be searched is reduced significantly.