获得爬升约束机组组合问题可行解的新的系统方法

根据具有爬升约束机组组合可行的充分必要条件,在Lagrangian松弛方法的框架下,给出了一种获得具有爬升约束的机组组合问题可行解的重新寻经的新的系统方法.当利用充分必要条件判断对偶机组组合不可行时,则利用对偶解的信息重新选择非爬升约束机组的动态规划的路径,即调整它们的启停序列,使之满足充分必要条件,最后以此解决经济分配问题.该方法可使爬升约束机组重新参与经济分配,因而扩大了获得可行解的范围,改善了可行解的经济性.对2个分别具有5台和10台机组的电力系统的测试结果表明,所提方法是有效的,利用它可扩大获得可行解的范围,改善可行解的经济性.

New Systematic Method for Obtaining Feasible Solutions to Unit Commitment Problem Considering Ramp Rate Constraints

A new systematic method based on the necessary and sufficient condition for a unit commitment to be feasible is proposed for solving the unit commitment problem with ramp rate constraints.Once a dual unit commitment obtained within Lagrangian relaxation framework is judged by this feasibility condition to be infeasible,reselect the dynamic planning route with non ramp rate constraints by using the information of the dual solution,i.e.readjusting their sequence of start-stop such that the feasibility condition mentioned above is satisfied.Once a feasible unit commitment is obtained,economic dispatch can then be solved to readjust the generation levels to obtain a feasible solution.Being different from the previous method,this method considers the re-dispatch of generation levels of units with ramp rate constraints in solving the economic dispatch,hence the possibility of obtaining a feasible solution is enhanced and the quality of the feasible solution is also improved.Two generation scheduling systems with 5 or 10 units are tested.The result shows that the new method is very efficient and effective.