EFFECTS OF RAMP-RATE LIMITS ON UNIT COMMITMENT AND ECONOMIC-DISPATCH

被引:290
作者
WANG, C
SHAHIDEHPOUR, SM
机构
[1] Department of Electrical and Computer Engineering, Illinois Institute of Technology, Chicago
关键词
RAMP RATES; UNIT COMMITMENT; DYNAMIC DISPATCH; ARTIFICIAL NEURAL NETWORKS; HEURISTICS;
D O I
10.1109/59.260859
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
This paper proposes an algorithm to consider the ramp characteristics in starting up and shutting down the generating units as well as increasing and decreasing power generation. In power system generation scheduling, a number of studies have focused upon the economical aspects of the problem under the assumptions that the changes in the generating capacity follow a step function characteristic and unit generation can be adjusted instantaneously. Even though these hypotheses greatly simplify the problem, they do not reflect the actual operating processes of generating units. The use of ramp-rate constraints to simulate the unit state and generation changes is an effective and acceptable approach in the view of theoretical developments of industrial processes. Since implementing ramp-rate constraints is a dynamic process, dynamic programming (DP) is a proper tool to treat this problem. In order to overcome the computational expense which is the main drawback of DP, this study initially employs artificial intelligence techniques to produce a unit commitment schedule which satisfies all system and unit operation constraints except unit ramp-rate limits. Then, a dynamic procedure is used to consider the ramp properties as units are started up and shut down. According to this adjustment maximum generating capabilities of units will change with the unit operation status instead of following a step function. Finally, a dynamic dispatch procedure is adopted to obtain a suitable power allocation which incorporates the unit generating capability information given by unit commitment and unit ramping constraints, as well as the economical considerations. Two examples are presented to demonstrate the efficiency of the method.
引用
收藏
页码:1341 / 1350
页数:10
相关论文
共 18 条
[1]   A METHOD FOR SOLVING THE FUEL CONSTRAINED UNIT COMMITMENT PROBLEM [J].
COHEN, AI ;
WAN, SH .
IEEE TRANSACTIONS ON POWER SYSTEMS, 1987, 2 (03) :608-614
[2]  
COHEN AI, 1990, 10TH P SYST COMP C G, P1107
[3]   SECURITY CONSTRAINED DYNAMIC DISPATCH OF REAL POWER FOR THERMAL GROUPS [J].
INNORTA, M ;
MARANNINO, P ;
GRANELLI, GP ;
MONTAGNA, M ;
SILVESTRI, A .
IEEE TRANSACTIONS ON POWER SYSTEMS, 1988, 3 (02) :774-781
[4]  
MOKHTARI S, 1987, P PICA 87, P188
[5]  
OSAKA S, 1988, IN PRESS INT WORKSH
[6]   A HYBRID ARTIFICIAL NEURAL NETWORK-DYNAMIC PROGRAMMING APPROACH TO UNIT COMMITMENT [J].
OUYANG, Z ;
SHAHIDEHPOUR, SM .
IEEE TRANSACTIONS ON POWER SYSTEMS, 1992, 7 (01) :236-242
[7]   HEURISTIC MULTIAREA UNIT COMMITMENT WITH ECONOMIC-DISPATCH [J].
OUYANG, Z ;
SHAHIDEHPOUR, SM .
IEE PROCEEDINGS-C GENERATION TRANSMISSION AND DISTRIBUTION, 1991, 138 (03) :242-252
[8]  
OUYANG Z, 1990, MAY P EPRI C DEC SUP
[9]   OPTIMAL SHORT-TERM THERMAL UNIT COMMITMENT [J].
PANG, CK ;
CHEN, HC .
IEEE TRANSACTIONS ON POWER APPARATUS AND SYSTEMS, 1976, 95 (04) :1336-1346
[10]  
PATTON AD, 1973, 8TH P POW IND COMP A