首页 | 本学科首页   官方微博 | 高级检索  
     

一种实用的机组最优启停计划方法
引用本文:刘可真,高峰,束洪春,程岩,苏黎,李荣高. 一种实用的机组最优启停计划方法[J]. 昆明理工大学学报(自然科学版), 2002, 27(1): 73-77
作者姓名:刘可真  高峰  束洪春  程岩  苏黎  李荣高
作者单位:1. 昆明理工大学,电力工程学院,云南,昆明,65005
2. 云南小龙潭发电厂,云南,开远,661601
摘    要:提出一种确定机组最优启停的改进动态规划法,先按优先顺序表压缩各时段机组组合状态,再用动态规划法进行计算.新的方法克服了优先顺序法没有考虑启停费用的不足,也解决了动态规划的“维数灾难”,且各机组的最优负荷分配可与机组的启停计划同时计算出、计算结果表明,该法具有较好的实用性。

关 键 词:机组最优启停 优先顺序法 动态规划法
文章编号:1007-855X(2002)01-073-05
修稿时间:2001-06-08

A Practical Algorithm for Optimal Unit Commitment
LIU Ke-zhen ,GAO Feng ,SHU Hong-chun ,CHEN Yan ,SU Li ,LI Rong-gao. A Practical Algorithm for Optimal Unit Commitment[J]. Journal of Kunming University of Science and Technology(Natural Science Edition), 2002, 27(1): 73-77
Authors:LIU Ke-zhen   GAO Feng   SHU Hong-chun   CHEN Yan   SU Li   LI Rong-gao
Affiliation:LIU Ke-zhen 1,GAO Feng 1,SHU Hong-chun 1,CHEN Yan 2,SU Li 2,LI Rong-gao 2
Abstract:An advanced dynamic programming of unit commitment is presented. Optimal unit commitment is determined by dynamic programming on the basis of using priority list to limit the combination states. Not only does the new method calculate the start-up consumption which the priority list can not consider, but also it resolves the dimension problem of dynamic programming. Economic dispatch can be calculated simultaneously with the optimal unit commitment. The experimental results indicate that the proposed algorithm has more practicability.
Keywords:optimal unit commitment  priority list  dynamic programming
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号