提出了一种改进的动态规划法,以解决多约束条件下的启停机计划问题.该算法考虑了机组的启停约束和爬坡约束,并有效地避免了常规动态规划法的“维数灾”问题,计算精度高,计算速度快.使用Delphi7.0编程仿真,对一个10机系统进行试算,算例结果表明该算法是行之有效的.%In this paper, an improved dynamic programming algorithm to address the unit commitment under multi constraints is proposed. The start-up and shut-down constraints of the unit and the unit ramp constraint are considered in this algorithm and the curse of dimensionality in general dynamic programming can be effectively avoided. The algorithm is both exact and fast. Simulation of the algorithm is executed Delphi7.0 and calculations carried out on a 10-unit system. The results of the simulation prove the effectiveness of the algorithm.
展开▼
