利用启发式方法求解带有爬升约束的火电机组多时段经济调度  

A new heuristic approach for unit commitment

作　　者：赖菲[1] 王智微[1] 杨东[1] 葛新[1] 刘超飞[1] 

机构地区：[1]西安热工研究院有限公司,陕西西安710032

出　　处：《热力发电》2013年第5期15-18,共4页Thermal Power Generation

摘　　要：提出了1种求解火电机组多时段经济调度的新型启发式方法。利用动态规划法求出计算系统负荷下满足爬升约束的各个待开机组的最优起、停状态及相应的起、停费用,将效率最高的机组投入运行;对起、停状态已定的火电机组再进行满足系统约束的最优经济分配。仿真结果表明,该方法克服了优先顺序表法难以得到起、停费用和爬升约束对机组优先级影响的不足,简单实用,计算速度快。A new heuristic method for solving multi-period economic dispatch for thermal power plants was proposed.The dynamic programming method was applied to obtain the optimal start and stop status of each unit which was to be started and the corresponding start and stop cost which satisfied the cramping constraint under system load condition,thus to put the unit with the highest efficiency into service.Then,for the thermal power units whose start and stop status was certain,the optimal economy distribution that satisfying the system constraint was conducted.The simulation results showed that,this new heuristic approach overcame the problems appeared in priority list method,like difficult to obtain the unit start and stop cost,insufficient influence of cramping constraint on unit priority.It is practicable and effective.

关 键 词：火电机组 多时段经济调度 启发式方法 爬升约束 动态规划 

分 类 号：TM621[电气工程—电力系统及自动化] TM734