| 发电机组组合问题的动态规划法中处理时间约束的受控记时Petri网模型 |
| |
| 引用本文： | 王冰.发电机组组合问题的动态规划法中处理时间约束的受控记时Petri网模型[J].系统仿真学报,2001,13(Z1):33-36. |
| |
| 作者姓名： | 王冰 |
| |
| 作者单位： | 山东大学威海分校控制工程系, |
| |
| 摘 要： | 给出了一种与环境有信息交流的受控记时Petri网系统模型的有关形式语言定义,把这种模型应用于具有时间约束的机组启停状态转换过程,使机组组合的动态规划法每一时段计算费用的状态数小于没有时间约束的该时段机组开停状态组合数,从而既处理了冷、热启动费用和最小启停机时间约束,又减少了计算费用的状态数,将会大大提高算法的效率.
|
| 关 键 词： | 机组组合 动态规划 时间约束 受控记时Petri网模型 |
| 文章编号： | 1004-731X(2001)0A-0033-04 |
| 修稿时间： | 2001年4月28日 |
A CTPN Model Dealing with Time Constraints in Dynamic Programming Approach for Unit Commitment |
| |
| WANG Bing.A CTPN Model Dealing with Time Constraints in Dynamic Programming Approach for Unit Commitment[J].Journal of System Simulation,2001,13(Z1):33-36. |
| |
| Authors: | WANG Bing |
| |
| Abstract: | A formal language definition of a kind of Controlled Timed Petri Net (CTPN) model that communicates with its environment is presented in this paper. This kind of model is used in the process of unit up-down transitions with time constraints. It makes the number of cost computation states in the dynamic programming approach for unit commitment smaller than that of unit up-down combinations without considering time constraints. In the meantime, this model deals with cold or hot start-up costs and the constraints of unit minimum up time and unit minimum down time. The efficiency of the algorithm based on this CTPN model will be improved greatly. |
| |
| Keywords: | unit commitment dynamic programming time constraint CTPN model |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
