TA的每日心情 | 开心 2020-3-1 21:18 |
|---|
签到天数: 1 天 连续签到: 1 天 [LV.1]初来乍到 累计签到:2 天 连续签到:1 天
|
楼主 |
发表于 2014-6-10 16:45:26
|
显示全部楼层
第三版目录。
, `" h7 Z4 \: C% B1 f; @8 [6 H+ ~1 Introduction 19 k5 o& E' A- a7 l$ Y7 h1 Z; j b
1.1 Purpose of the Course / 1, t, Z% y8 V; [) T f& N
1.2 Course Scope / 2( L" A. M% f3 r7 o8 M) G% N
1.3 Economic Importance / 2
- t* ?+ W' x% U1.4 Deregulation: Vertical to Horizontal / 37 [/ l- O, d: {& X0 w* O2 I
1.5 Problems: New and Old / 3
# j! }5 w, b/ d, h6 v) D5 }1.6 Characteristics of Steam Units / 6
; L- `) }8 m! y" `: W/ b1.6.1 Variations in Steam Unit Characteristics / 10
6 M# q$ E9 W) D1.6.2 Combined Cycle Units / 13( i3 | @9 \) G- h- s" f6 H
1.6.3 Cogeneration Plants / 14$ Y) k9 g" h% ^2 ^ n7 ]6 d: o
1.6.4 Light-Water Moderated Nuclear Reactor Units / 17
/ L6 g% ~+ X7 j& ~' z1.6.5 Hydroelectric Units / 18' K, F: }0 R) ], y# V+ W
1.6.6 Energy Storage / 21- s# G; N( ]* H
1.7 Renewable Energy / 22# _7 N! R0 Z- H0 k0 b6 m. Q2 C/ x j0 ^
1.7.1 Wind Power / 23
0 e3 d, `' i+ }0 ?+ ?( U1.7.2 Cut-In Speed / 23& s- j2 @. o; ]7 N- o
1.7.3 Rated Output Power and Rated Output Wind Speed / 24+ p4 V1 v8 j2 R4 C3 D
1.7.4 Cut-Out Speed / 243 c. G1 }& Q& n7 u
1.7.5 Wind Turbine Efficiency or Power Coefficient / 244 n. V+ g+ |3 l' N4 c7 Z
1.7.6 Solar Power / 25
* z" ?: p A1 _& t4 o; n7 AAPPENDIX 1A Typical Generation Data / 26' }, ]8 R0 A- Q' ^
APPENDIX 1B Fossil Fuel Prices / 28
; b$ U6 i9 B; n0 JAPPENDIX 1C Unit Statistics / 29& p5 ^: j; `1 T3 V
CONTENTS. G! @. V" k! S$ q" e
viii contents
. l: o. ]+ r: q$ }! hReferences for Generation Systems / 318 `$ f" a& j3 I2 b6 {
Further Reading / 31; W, ?1 ~: e w
2 Industrial Organization, Managerial Economics, and Finance 35! k4 F4 F, W9 @: z$ F) S5 k
2.1 Introduction / 35
( L' s5 b3 Z8 J/ f2.2 Business Environments / 36. d/ ~- w0 n4 s/ E
2.2.1 Regulated Environment / 37; q, q R0 r# i5 [$ B! h
2.2.2 Competitive Market Environment / 38
$ X% w) K4 `9 c: m, c% s) X) m2.3 Theory of the Firm / 40' T1 G0 @; ^* M) c
2.4 Competitive Market Solutions / 42
$ d6 `3 `3 e7 l- T8 U2.5 Supplier Solutions / 45
0 W1 Z$ i/ E( q/ C9 ~* r2.5.1 Supplier Costs / 462 a2 Z$ d+ @. R, B }1 y/ Y" X
2.5.2 Individual Supplier Curves / 46
5 o4 O" N8 U9 _. \2.5.3 Competitive Environments / 47
% p; Z/ `9 \& L9 p2 w: S2.5.4 Imperfect Competition / 51
' n9 ?- _1 m# x4 Z9 s2.5.5 Other Factors / 526 t6 Q: O$ M5 R
2.6 Cost of Electric Energy Production / 53
9 Z8 [5 U/ y$ G9 M& X3 t2.7 Evolving Markets / 54
: t: X) _( q6 n* _8 F3 k2.7.1 Energy Flow Diagram / 574 {; t* h7 T2 Z4 A) A; ^
2.8 Multiple Company Environments / 58# @" g& [; j @# J- w1 R H4 I
2.8.1 Leontief Model: Input–Output Economics / 582 F( f! m/ n" s/ M, @: C& p
2.8.2 Scarce Fuel Resources / 60
% E }$ K' D2 S+ ~4 ^2.9 Uncertainty and Reliability / 61: r5 d- r, A% V/ K- _* |# p; `3 |4 l
PROBLEMS / 614 P5 e" S1 v2 u; N c
Reference / 62# q% Z1 l- @, }+ H
3 Economic Dispatch of Thermal Units and Methods of Solution 63
, G: D: n7 E* I- R E4 m! s3.1 The Economic Dispatch Problem / 63
. }1 t; m0 o% O9 ?3.2 Economic Dispatch with Piecewise Linear Cost Functions / 685 }5 y( {* B( h9 Z; l1 _# ]
3.3 LP Method / 694 [5 z$ V# r; D' A5 C
3.3.1 Piecewise Linear Cost Functions / 698 j+ X q w9 v; Y1 J8 j
3.3.2 Economic Dispatch with LP / 71. n$ W3 o6 ?% u6 e5 P" q9 K
3.4 The Lambda Iteration Method / 73
7 x- v5 J4 N% S8 X3.5 Economic Dispatch Via Binary Search / 76$ M: Y: X" k' p6 Y4 o
3.6 Economic Dispatch Using Dynamic Programming / 78
. o T6 }) ^5 V3.7 Composite Generation Production Cost Function / 81
/ i; H4 E9 X7 k6 h9 Y$ D3.8 Base Point and Participation Factors / 85
" C& F" ^0 j' |6 H+ `. }3.9 Thermal System Dispatching with Network Losses
# u. Y3 ~( i' dConsidered / 88$ R: D4 n F# y* m+ `
contents ix
5 p0 `) x9 j s7 }( o# Y/ J3.10 The Concept of Locational Marginal Price (LMP) / 920 e0 k, Y/ [1 I& o# J+ _
3.11 Auction Mechanisms / 957 Z9 p: U$ K1 B8 X A! e; `
3.11.1 PJM Incremental Price Auction as a
3 ?1 p2 x" N% E& `8 YGraphical Solution / 95
5 x, y2 g# S2 [7 Y: o$ p" b/ X" [3.11.2 Auction Theory Introduction / 98
( W9 K* \* z) ]2 Z+ e3.11.3 Auction Mechanisms / 100) r8 M8 P S( ^) V
3.11.4 English (First-Price Open-Cry = Ascending) / 101) f, L6 G/ f4 e+ B* g# p
3.11.5 Dutch (Descending) / 103
2 V! w' [* F P) s6 H3.11.6 First-Price Sealed Bid / 104
8 Y+ y4 M3 @7 ~9 \3 W c) T# y3.11.7 Vickrey (Second-Price Sealed Bid) / 105
. ~7 A+ m0 q+ z( {0 Y: }4 M7 L3.11.8 All Pay (e.g., Lobbying Activity) / 1059 h0 i) |7 Y- B7 H
APPENDIX 3A Optimization Within Constraints / 106; b9 F3 V' T* V# S. n
APPENDIX 3B Linear Programming (LP) / 117" k- v& ?# j& Y$ Q) E
APPENDIX 3C Non-Linear Programming / 128
! I' F4 B) @( u; Z( zAPPENDIX 3D Dynamic Programming (DP) / 128
( l w) D% y8 |4 ]9 GAPPENDIX 3E Convex Optimization / 1351 j+ A! P0 I! T* [ c+ q5 d) w$ I
PROBLEMS / 1381 V# U1 h/ Q9 o- i" z4 w$ D( b7 d7 s
References / 146+ N3 @7 t7 {3 u) Y1 P( F7 f
4 Unit Commitment 147, E+ v6 P; S! V; C' m
4.1 Introduction / 147
, j1 y" @# o6 B; i' I4.1.1 Economic Dispatch versus Unit Commitment / 147
% Y/ z$ C* y3 g/ q2 |( y4.1.2 Constraints in Unit Commitment / 1521 p' d8 [# s# L$ v. c" M
4.1.3 Spinning Reserve / 152# \4 e+ n$ f$ F$ e9 F5 e
4.1.4 Thermal Unit Constraints / 153
* H5 ` a# [+ n, B4.1.5 Other Constraints / 1558 T" w7 @# H p, c# _# X# T% K
4.2 Unit Commitment Solution Methods / 155, x7 H4 w6 b% r3 G
4.2.1 Priority-List Methods / 1564 @. L" m) s. Q$ E
4.2.2 Lagrange Relaxation Solution / 157
7 n* S- G2 p$ G4 F4.2.3 Mixed Integer Linear Programming / 166" N5 e% _/ e5 u& X# U
4.3 Security-Constrained Unit Commitment (SCUC) / 167
. s6 B k2 r9 c9 @" |4.4 Daily Auctions Using a Unit Commitment / 167* N5 y' c' z* d$ b% E) U
APPENDIX 4A Dual Optimization on a Nonconvex" ~5 u- Q+ q% m! [- T, O
Problem / 1671 l6 R7 m8 D7 r* s
APPENDIX 4B Dynamic-Programming Solution to
) a$ l# ?( c0 u/ M* A7 t( }, r' ]Unit Commitment / 173
3 V0 S' U5 u" A) x" i4B.1 Introduction / 173
+ X1 ]: j) Z8 Q: { U% F4B.2 Forward DP Approach / 1745 \8 X5 m3 T: ~8 X8 l
PROBLEMS / 182
0 ~4 g6 J o) H: qx contents
6 a- w8 s- Q5 ^% C5 Generation with Limited Energy Supply 187
, m4 M! Q0 H6 T: _! _5.1 Introduction / 187
1 q; V1 @8 Z" ?! s5.2 Fuel Scheduling / 1882 P! P' E. _$ T# }+ @0 b U3 C
5.3 Take-or-Pay Fuel Supply Contract / 188
' l* i1 w3 D. H8 J5.4 Complex Take-or-Pay Fuel Supply Models / 194
8 B$ J: _) r) U) @5 _% `$ C# l5.4.1 Hard Limits and Slack Variables / 194
* W- U4 Y) k5 A' K* K8 J5 O5.5 Fuel Scheduling by Linear Programming / 195- ~# V k5 _+ q3 |
5.6 Introduction to Hydrothermal Coordination / 202
" |9 S8 L5 v$ [/ v8 M0 [9 d5.6.1 Long-Range Hydro-Scheduling / 203- G5 h t& F. K% g5 o
5.6.2 Short-Range Hydro-Scheduling / 2044 G3 H; P \3 X/ D. o% g( p
5.7 Hydroelectric Plant Models / 204, O) H0 Z8 V$ x
5.8 Scheduling Problems / 207
* Z+ s) ]& R3 P O `9 d5.8.1 Types of Scheduling Problems / 207
1 K& X- o1 S5 W: @1 E- ?: \5.8.2 Scheduling Energy / 2078 H% F9 ^7 ~# b, k+ y
5.9 The Hydrothermal Scheduling Problem / 2111 d9 e, [. D4 F& ^6 c
5.9.1 Hydro-Scheduling with Storage Limitations / 2115 f$ Y! n2 c& V+ D3 h$ h
5.9.2 Hydro-Units in Series (Hydraulically Coupled) / 216
5 P- M3 C, V( o+ j& E8 \& G5.9.3 Pumped-Storage Hydroplants / 218
4 ] W3 N2 k# w0 a% K& H5.10 Hydro-Scheduling using Linear Programming / 222& {3 j* w s( g3 K2 A# E1 e
APPENDIX 5A Dynamic-Programming Solution to hydrothermal( b0 }9 S! ?5 m4 l, b" Q
Scheduling / 225
' q- t9 M/ ?, h$ _5.A.1 Dynamic Programming Example / 2273 G% ~ S* @: \, p1 H" l( i4 A
5.A.1.1 Procedure / 228
+ O# X3 p+ D8 J0 T. D* V! g5.A.1.2 Extension to Other Cases / 231+ ^. L" m) M* V6 H0 R* f* k- J
5.A.1.3 Dynamic-Programming Solution to Multiple Hydroplant1 ?5 r0 u( q, s8 E4 ^4 W0 ^
Problem / 2327 Y% ?% c/ t8 D- @( J+ ]& |( W7 w
PROBLEMS / 234
. n: M8 O# B* n# C6 Transmission System Effects 243
1 ~3 I" M1 y3 U- k' |4 d6 G9 B6.1 Introduction / 243; f( A7 _+ w9 L g6 V5 f1 W
6.2 Conversion of Equipment Data to Bus and Branch Data / 247
' |' W+ [7 k6 _) b; @ n6.3 Substation Bus Processing / 248% b0 H: F. L* x* M
6.4 Equipment Modeling / 248+ K' ^1 k: |, l8 L6 n
6.5 Dispatcher Power Flow for Operational Planning / 251
2 V$ Q f" z. A/ h7 w5 F" p( h6.6 Conservation of Energy (Tellegen’s Theorem) / 252
@. \) w7 n2 ^" J/ w6.7 Existing Power Flow Techniques / 253
1 A% [. @. u1 f& S/ D3 u2 z6.8 The Newton–Raphson Method Using the Augmented; q( ?! D+ j7 M2 a
Jacobian Matrix / 254
5 g, P" c% X/ `7 j0 g6.8.1 Power Flow Statement / 254
, g6 J V* C5 x! O$ e% z% d" |+ {- K6.9 Mathematical Overview / 257
9 p' A: l8 r: d; P Tcontents xi
* T3 d4 q0 ` K$ i6.10 AC System Control Modeling / 259
) A# `- E+ E0 O# f% k/ c6.11 Local Voltage Control / 259
w$ [: J+ C( G4 R5 j6.12 Modeling of Transmission Lines and Transformers / 259
, r/ T; \% s$ W6.12.1 Transmission Line Flow Equations / 259
+ \6 D F( o' y. e% O6.12.2 Transformer Flow Equations / 2609 K z: v5 b, f& u
6.13 HVDC links / 261- ~4 z/ ?8 l% G
6.13.1 Modeling of HVDC Converters5 C- L/ ~$ F+ Z0 ]0 }
and FACT Devices / 264
2 s, a) N& D2 q6.13.2 Definition of Angular Relationships in5 w( p) W f0 ?" s j; H+ \
HVDC Converters / 264/ q1 z9 N' K6 I0 J* ]
6.13.3 Power Equations for a Six-Pole HVDC
4 ^* {; i5 @1 K; m% k9 }+ CConverter / 264
8 M: l! [6 D: J" d& ^$ x9 C6.14 Brief Review of Jacobian Matrix Processing / 267
# D1 |$ a/ e$ a7 u6.15 Example 6A: AC Power Flow Case / 269 A+ r5 z6 ]6 v6 U
6.16 The Decoupled Power Flow / 271! I9 Z) b. K# A6 T2 ~
6.17 The Gauss–Seidel Method / 275/ } g/ h4 j# b& h3 a; C
6.18 The “DC” or Linear Power Flow / 277
5 l0 [0 m+ P' P% i1 N* V6.18.1 DC Power Flow Calculation / 2770 j+ C$ _6 S- M6 I/ A
6.18.2 Example 6B: DC Power Flow Example on the. A b8 c/ ~5 b! u1 R
Six-Bus Sample System / 278( p* c$ [0 Y" P* g
6.19 Unified Eliminated Variable Hvdc Method / 278
! |+ j+ U5 X4 q6.19.1 Changes to Jacobian Matrix Reduced / 279
9 T' c. i( J$ E$ C- {* V6.19.2 Control Modes / 280
. s0 u8 Z# u, ~/ C6.19.3 Analytical Elimination / 280- r8 Y0 z! g* s2 F0 S9 K) q" x
6.19.4 Control Mode Switching / 2833 n7 u% x/ s5 W+ F
6.19.5 Bipolar and 12-Pulse Converters / 283
( m- W8 Z6 i f0 A6.20 Transmission Losses / 284- X& }+ | o3 H
6.20.1 A Two-Generator System Example / 284. V' f9 W8 L. ^0 c
6.20.2 Coordination Equations, Incremental Losses,
/ c, w i5 l& X7 y1 y- Z2 a5 ?& rand Penalty Factors / 286
6 u" l# H; z& R- `$ Z% z6.21 Discussion of Reference Bus Penalty Factors / 2881 I: c' J3 K' g8 M- U: i7 |
6.22 Bus Penalty Factors Direct from the AC Power Flow / 289
/ _7 D# K! _8 `. @, N% ~PROBLEMS / 291! z; m$ t, B1 |, P! z( Z
7 Power System Security 296
$ P9 p" E2 E5 u2 b0 ?' i* H7.1 Introduction / 296
8 \1 P x% M7 L8 z- G7.2 Factors Affecting Power System Security / 301" A$ |' Y& a: k( [/ g
7.3 Contingency Analysis: Detection of Network Problems / 301
t- g! R) a4 M7 c7.3.1 Generation Outages / 3014 y( k3 I T- G! H- A b
7.3.2 Transmission Outages / 302: E) G1 `+ j$ X9 n. I- l
xii contents+ W. y0 b8 `& i# ^+ B
7.4 An Overview of Security Analysis / 306& p. r7 U$ _+ J( O' N& j
7.4.1 Linear Sensitivity Factors / 307
, H% ?4 S8 C. f8 L; r/ C% g9 r7.5 Monitoring Power Transactions Using “Flowgates” / 313
% W% R* R1 i e! q. f; e$ F1 W7.6 Voltage Collapse / 315' }) h# O- I. D3 j4 H
7.6.1 AC Power Flow Methods / 317* [; Z$ u) t! I' }: w9 z
7.6.2 Contingency Selection / 320) ]& o+ o/ O' V% i
7.6.3 Concentric Relaxation / 323
* o3 F4 ?" x0 Q; u" D; r7 Q. \7.6.4 Bounding / 325
; b, T. o% ~3 x: }7.6.5 Adaptive Localization / 325
9 A& [8 j) a7 C, }" W7 IAPPENDIX 7A AC Power Flow Sample Cases / 327
. \4 j- k- f7 f( YAPPENDIX 7B Calculation of Network Sensitivity Factors / 3362 l# r6 Y* K' n* O
7B.1 Calculation of PTDF Factors / 336
- R [% X4 C9 v. k% E7B.2 Calculation of LODF Factors / 339
: }& J. g3 m: T- m. N7B.2.1 Special Cases / 341
5 s+ _! A. z3 o% d! \' F6 p, T1 }/ O) u$ a7B.3 Compensated PTDF Factors / 343
' E1 E2 f- K' ?6 _Problems / 343& k: N; j0 l! b
References / 349
: c5 F5 g7 J2 B: P) y l N8 Optimal Power Flow 350
# R0 o' p7 ], h' F6 c9 g& p8.1 Introduction / 350
- h: f) N7 y2 Q8.2 The Economic Dispatch Formulation / 351
. u8 ~. |5 O/ w8.3 The Optimal Power Flow Calculation Combining
5 L& F" J, A! A7 X6 q3 M% }2 n) hEconomic Dispatch and the Power Flow / 352( ^" w8 ?) p6 E+ d5 D- W
8.4 Optimal Power Flow Using the DC Power Flow / 354
% p: @( X3 D- P+ |4 v# ^8.5 Example 8A: Solution of the DC Power Flow OPF / 356: P* I7 o) d% g" Z j0 {: O
8.6 Example 8B: DCOPF with Transmission Line/ A* Y' F1 o/ q- A* }, j( ]5 R
Limit Imposed / 361
: c8 _! [. S. O- f1 g" v) P8.7 Formal Solution of the DCOPF / 3654 O; S, h# @; G& ]0 L
8.8 Adding Line Flow Constraints to the Linear( z4 s3 v% W- E, K: E D9 J/ x
Programming Solution / 365
: X0 [8 a L. G6 G) N8.8.1 Solving the DCOPF Using Quadratic Programming / 367
8 S3 n7 V6 e; T k* J% W8 g8.9 Solution of the ACOPF / 368
6 h: T0 C# o$ A3 }- A8.10 Algorithms for Solution of the ACOPF / 3696 h! O! l' {5 {0 O
8.11 Relationship Between LMP, Incremental Losses,
6 w: H2 A4 L W% \+ j! gand Line Flow Constraints / 376
) V- T8 G& R( m% v1 M6 I) y) }3 ]8.11.1 Locational Marginal Price at a Bus with No Lines. S+ {3 T" l. ?6 U' C' i" C) ^' V
Being Held at Limit / 3774 D4 c, s" {9 e
8.11.2 Locational Marginal Price with a Line Held at its Limit / 378
' P( x+ T6 R' u6 |contents xiii
3 d6 V( \+ G9 o1 a9 T8.12 Security-Constrained OPF / 382$ M0 u9 z* U! @, k* k
8.12.1 Security Constrained OPF Using the DC Power Flow. i' v# H, X; A1 q' t& ^7 x
and Quadratic Programming / 384
& i- h! a* [# R: U8.12.2 DC Power Flow / 385
$ A: `4 R7 v2 J8.12.3 Line Flow Limits / 385
2 Q1 {2 A7 A) Z- Q% b. |* |8.12.4 Contingency Limits / 386
0 l$ {0 C* c: u5 x# O; [APPENDIX 8A Interior Point Method / 391
& M9 m# e2 n5 v* YAPPENDIX 8B Data for the 12-Bus System / 393
0 C3 ?& r# `! n4 v5 c* U+ S. ]6 oAPPENDIX 8C Line Flow Sensitivity Factors / 395% q5 d! I5 b( D: |9 B/ {( e; i
APPENDIX 8D Linear Sensitivity Analysis of the! R1 }# I+ O/ V: \
AC Power Flow / 3979 i7 m1 Q; c# P5 [+ ~ C# h) [: {
PROBLEMS / 399, G1 Z9 T/ A5 p- [+ K& S
9 Introduction to State Estimation in Power Systems 403( A' ?/ W# A `2 m# _+ H" B& k
9.1 Introduction / 403+ G/ i3 S" k" h0 S/ q$ Y6 f
9.2 Power System State Estimation / 404
* t& t: O- P( T; d# W9.3 Maximum Likelihood Weighted Least-Squares9 n! s* u- H) V
Estimation / 408# v8 G8 `& M v5 H1 A" o' P$ ?
9.3.1 Introduction / 408
; P" N9 q/ U/ A4 D9.3.2 Maximum Likelihood Concepts / 4103 r( b5 @$ S; x& F) [2 A
9.3.3 Matrix Formulation / 414/ i0 R- C8 J) j7 m$ c: C$ N# {
9.3.4 An Example of Weighted Least-Squares
* J7 m/ a% k5 L# F; _State Estimation / 417" W; ?- S, i6 n
9.4 State Estimation of an Ac Network / 421
% ?8 W7 ~. R k9 G6 {6 `0 |9.4.1 Development of Method / 421
! t% B9 Z1 _! F+ m4 B9.4.2 Typical Results of State Estimation on an+ y0 e+ X1 x5 x! u) `' ]% B' b6 n
AC Network / 424; N: V9 t, a+ m; A( W8 l
9.5 State Estimation by Orthogonal Decomposition / 428$ i7 X; b! e% {' \% N
9.5.1 The Orthogonal Decomposition Algorithm / 4312 w& Q. T( i9 \2 p$ w7 m
9.6 An Introduction to Advanced Topics in State Estimation / 435
! W, m9 h2 z: _5 y+ U9.6.1 Sources of Error in State Estimation / 435
; \) x+ l# M; q* y! n9.6.2 Detection and Identification of Bad Measurements / 436$ M. t- n+ z% h/ k5 c0 W5 }
9.6.3 Estimation of Quantities Not Being Measured / 443
8 o, F( M3 m2 ?/ h& ]9.6.4 Network Observability and Pseudo-measurements / 444% U3 v+ j# L0 M% u' A
9.7 The Use of Phasor Measurement Units (PMUS) / 447# N9 m8 m! d# e. c5 t
9.8 Application of Power Systems State Estimation / 4514 _: g1 v: m1 S7 U4 d+ s( Z7 _' Y
9.9 Importance of Data Verification and Validation / 454% u* T; b, w( R$ v& ^2 I
9.10 Power System Control Centers / 454
2 M. z* K+ k$ cxiv contents
5 u1 E( u5 |- i% C; |/ LAPPENDIX 9A Derivation of Least-Squares Equations / 456
& G) D2 i9 ^) q) E, ]; n9A.1 The Overdetermined Case (Nm > Ns) / 457, q! I& G( U: t2 } F4 N
9A.2 The Fully Determined Case (Nm = Ns) / 462
$ L7 f/ I8 C$ |, f8 Z% t8 S9A.3 The Underdetermined Case (Nm < Ns) / 462
: j1 f2 u% }% s i; \) gPROBLEMS / 464: O9 l4 N- ?' x I% @) s6 t6 I7 s
10 Control of Generation 468$ H+ x2 ^8 O" B9 Z
10.1 Introduction / 468# X3 |8 f# o% @3 c; E/ K- f
10.2 Generator Model / 470
( c+ C( K5 H5 V6 Z2 V: a10.3 Load Model / 473' O. L2 J# v$ P0 A( S; Z
10.4 Prime-Mover Model / 475
+ a3 Q& w5 A+ }4 z4 }* X; w$ M10.5 Governor Model / 4767 `! ^3 ^6 U+ T1 Q3 |: h2 N1 R
10.6 Tie-Line Model / 481/ H: S* F% G- N
10.7 Generation Control / 4853 P# d1 a6 p$ Y/ i4 H! E
10.7.1 Supplementary Control Action / 4857 b; }$ R, ]& x6 @* g; i3 j
10.7.2 Tie-Line Control / 4867 p% r5 N+ E; v2 {2 a; W: N! Q
10.7.3 Generation Allocation / 489
# ~# M/ c- o# Y( X0 n: @10.7.4 Automatic Generation Control (AGC)
) Z1 j3 E- Z+ o4 j/ [Implementation / 491) L" B1 W" o0 {0 I t7 ^' T
10.7.5 AGC Features / 495
3 S- j& S; x3 K9 M$ x! ^5 A5 A10.7.6 NERC Generation Control Criteria / 496
$ f$ `; p4 Z9 l+ vPROBLEMS / 497! o9 y- j' h9 N5 ?
References / 500
+ p/ j0 Q6 c5 l+ o5 Q( P11 Interchange, Pooling, Brokers, and Auctions 501
! t6 }! d* q1 ^; K( V7 j$ G: r11.1 Introduction / 5010 a4 F+ i- z- g
11.2 Interchange Contracts / 504
$ g) }7 m3 J# A- I9 F ~11.2.1 Energy / 504
( L, T" B' e4 K6 w# H6 L0 O11.2.2 Dynamic Energy / 506
. _; k. p8 ^: p, m11.2.3 Contingent / 5069 e$ |- }: _3 a2 y( Q
11.2.4 Market Based / 507
+ K1 D$ x+ ?" j3 D$ ?/ ?/ Q11.2.5 Transmission Use / 5082 \8 z+ w3 \6 a6 n6 c
11.2.6 Reliability / 517
" l Y' f; a( `$ D7 I11.3 Energy Interchange between Utilities / 5170 {( c7 k3 t% B: P3 r: b0 \! @! s
11.4 Interutility Economy Energy Evaluation / 5210 g+ ^: F% x6 F& h
11.5 Interchange Evaluation with Unit Commitment / 522, Y7 Z# ~6 M8 p
11.6 Multiple Utility Interchange Transactions—Wheeling / 523
) w4 C7 H/ x% t% n+ I& W7 {11.7 Power Pools / 5267 T" q P" O6 \) v) @
contents xv
% w8 M0 b3 \( G% T8 F11.8 The Energy-Broker System / 529+ \. G, k3 c- n, I
11.9 Transmission Capability General Issues / 533* ^2 j0 L* `! T& I+ T3 k8 v( U- e
11.10 Available Transfer Capability and Flowgates / 535' L7 T0 Q) J) E5 h9 N" y* B4 A8 o: S6 l0 T
11.10.1 Definitions / 5367 D2 W5 C( T: u4 H; z/ a% _' {5 j
11.10.2 Process / 5390 h3 ^% \* J }+ ?2 _( {$ i+ y7 h
11.10.3 Calculation ATC Methodology / 540
8 K. ^: H# W7 W- K% ~, I! b11.11 Security Constrained Unit Commitment (SCUC) / 550
1 @/ {# t( `/ l: q M11.11.1 Loads and Generation in a Spot Market Auction / 550) K$ U4 e; T+ F/ L# M
11.11.2 Shape of the Two Functions / 552
- J4 L! C' p6 z+ n& E. `11.11.3 Meaning of the Lagrange Multipliers / 553
8 R7 Y& Y3 e" M& d. F+ t( {* \11.11.4 The Day-Ahead Market Dispatch / 554& m }' o" S% _2 S
11.12 Auction Emulation using Network LP / 555$ b, O, g9 _' B: K1 E1 ^. s J& O
11.13 Sealed Bid Discrete Auctions / 555
$ B" @5 W9 A0 APROBLEMS / 560
( X' ], y; u8 x/ }, U+ f12 Short-Term Demand Forecasting 566
4 ?* |- I( h/ j2 m* G2 t12.1 Perspective / 566
! X" o: P( g6 M! d' Q# f. [( J0 w12.2 Analytic Methods / 5696 O- c. j4 T6 I: X% D3 v' [
12.3 Demand Models / 571+ y F0 s3 T# K5 F- P
12.4 Commodity Price Forecasting / 572" a( H f( U, S, K/ n
12.5 Forecasting Errors / 5737 o) L. B$ Q* \0 J/ C% @
12.6 System Identification / 573
: y/ ?! U! X4 o2 G12.7 Econometric Models / 574
. d) w, D Z( o m4 [12.7.1 Linear Environmental Model / 574
8 W, O6 c# B6 i12.7.2 Weather-Sensitive Models / 5760 K9 p' J* ~, i8 P0 U5 r6 q8 P
12.8 Time Series / 578$ b0 N, }7 ]% n1 Q( D: c( S/ \5 V
12.8.1 Time Series Models Seasonal Component / 578
% b. g4 ^" ~) f: C12.8.2 Auto-Regressive (AR) / 580; S _4 h# A4 G) Y( l, w
12.8.3 Moving Average (MA) / 581; e& @) a6 ?* G0 C
12.8.4 Auto-Regressive Moving Average (ARMA):
$ ] R2 U- Z5 G8 r; dBox-Jenkins / 582
2 J4 ?3 l% i7 @8 C2 k12.8.5 Auto-Regressive Integrated Moving-Average
8 {/ F2 l2 f# V; y6 t(ARIMA): Box-Jenkins / 5845 _5 O8 X% ~; C( \: Y
12.8.6 Others (ARMAX, ARIMAX, SARMAX, NARMA) / 585
0 ^1 m( Z( Y6 z9 ~* {" |12.9 Time Series Model Development / 585
) A% Q a% d: k3 T6 I2 f4 H6 u4 ?: e$ q12.9.1 Base Demand Models / 5867 F0 R/ S7 Y6 f* Q# }& X$ P N- h Q. H
12.9.2 Trend Models / 586
) p2 X- H- L( D: d$ i* l12.9.3 Linear Regression Method / 586, g, a* K4 `6 W1 T9 Y
xvi contents- e) z8 k9 H+ n& h4 d2 l9 X
12.9.4 Seasonal Models / 5882 y9 L% S& c! s: Z; G/ o: V
12.9.5 Stationarity / 5881 [! y+ r6 G( A2 z% @
12.9.6 WLS Estimation Process / 590
2 V, K4 i, c" M' y' J% A7 S12.9.7 Order and Variance Estimation / 591
5 s4 g* n2 _% {9 H& q6 v12.9.8 Yule-Walker Equations / 592
! L2 D* }2 P! S5 \1 j+ @4 V4 P12.9.9 Durbin-Levinson Algorithm / 595& ~$ f' g3 [& m
12.9.10 Innovations Estimation for MA and ARMA
2 s: i- w0 k1 @ {& d. Z- C3 K: [Processes / 598
8 z% w1 u5 d4 Q* b12.9.11 ARIMA Overall Process / 600
: d% C: r8 z1 l2 x; ?5 {12.10 Artificial Neural Networks / 603! ?4 b3 f" ]4 V& {1 i9 _
12.10.1 Introduction to Artificial Neural Networks / 604
, |! K, i2 P- z- e5 E1 z12.10.2 Artificial Neurons / 605
3 y j1 E( I/ Q( P0 \& v12.10.3 Neural network applications / 606
# C+ T* Z4 {( {' o12.10.4 Hopfield Neural Networks / 606
0 O1 X+ E4 K w- F1 F2 J" {4 {12.10.5 Feed-Forward Networks / 607
9 t/ e7 _/ u( ^) D12.10.6 Back-Propagation Algorithm / 610/ {/ ^! ?3 L2 @$ y2 P$ q6 m4 q
12.10.7 Interior Point Linear Programming Algorithms / 613
, o. k+ K2 \ H7 A4 V8 D12.11 Model Integration / 614$ V3 K6 M# G6 Y4 I8 I5 h
12.12 Demand Prediction / 614
% U3 U; q3 k* V12.12.1 Hourly System Demand Forecasts / 615
8 S; }5 C9 }1 B6 J12.12.2 One-Step Ahead Forecasts / 615; y- i: \+ N( R8 `( y: d
12.12.3 Hourly Bus Demand Forecasts / 616
3 T m7 z7 x8 A, B4 m/ M' M2 b3 t12.13 Conclusion / 6162 e7 f0 ?$ h/ A/ C& I i
PROBLEMS / 617 |
|