Sei sulla pagina 1di 4
2004 IEEE ternational Coaferene on Elect Utility Deregulation, Restructuring and Power Technologies (DRPT2004) April 2004 Hong Kong A decentralized optimization for risk based regional congestion management FU Rong, GE Zhao-giang, LI Yang, TANG Guo-qing. Abstract—A ew decentralized risk-based congestion ‘management method is proposed, in which the object fanetion is represented by uty value in eletrcty marke, Centralized optimization ‘employed in congestion management study , however, Aecentraized opt regional markets. Ta this paper, partilpants in Aitferent regions are allowed to pursue their own profs approaches are primarily tons are used fo make decisions in and uty functions are defined to synthesize the profit and the congestion risk. The system operator with more priority ‘coordinates the relations between the decentralized schemes, ts evkdent thatthe decentralized scheme is more realistic {in regional market management. Congestion management Wh thermal sk assessment ‘Miiency of transmision network and obey the cules of market operation. The utility function is based Power Flow (OPF) coupled with short-term ansmission line thermal overload rlisk asses I coordinate the on Optins ‘Simulation tess on IEEE. 30-bus system demonstrate that the predicted risk of thermal overload is useful for oaline ‘cision making and the decentralized risk based ‘congestion management approach is transparent and ficient tothe market participants Index Terms — power market; risk ecentralized optimization; sessment; tity val regional congestion LNTRODUCTION na competitive market environment, the uncertain and seally complexity in power operations and operational planning. To maintain sytem reisbilty under uncertainty, studies are performed to aid in operating decisions. The curent practice uses deterministic methods with significant Trassmissio Reliability Margins (TRAM) t cover ll the posible operation pattems [1] As the weaknesses in using deterministic method for diverse market patterns have increased performing security assessment, this paper motivates and escribes sn assessment method that called Decentralized Risk-based Congestion Management (DRCM). Then, the short-term transmission lie thermal 0-7803-8237-4104817 00020041EEE on ‘overload risk assessment is used in optimal power flow (OFF) to compute generation unit commitment and transmission Dow plan, Finally, simulation tess on IEEE. 30-bus system testify the value of risk assessment for decision-making. ILINE OVERLOADING RISK. ‘The thermal overioad risk isthe product of the thermal ‘overload probability and its expectation of costs), Given the current J, we may compute thermal overlotd tisk as the probability of the temperature being greater than the maximum design temperature Oye, times its related impacts: RD [AOD «gD HapalO\ D9 (0) Here 0 is the conductor temperature with the ambient conditions and R(/) is the risk regarding the line loading. (| 1), the probebilty density function of @ iven I isthe summation ofthe joint probability of all ambient conditions (2) such that the temperature determined by them under the given curent POID=>. pe) vee{si0e.0 a @ Where p(z)= (3 1) plu), ® “ ‘The random behaviors of sir temperature @ and wind speed u are modeled as Normal and Weibull distribution respectively, where the optimal parameters of distribution fumetions can be obiained using point estimation form historical data. If the correlation e berween US \u) and wis negligible, then (9) in equation Here, 11,07 7 and fae the scale and shape parameters for both distributions. IL MATHIMATICAL MODEL, Before further discussion, underlying assumptions: 2. Power flow loss is neglected and direct current power flow model is used. The Power Transfer Distribution Factor (PTDF) is fixed. All the market participants bid to maximize the profits rationally and independently All the market information can be issued timely is useful sate the form the ceniral servers. For Nb system nodes and NI system buses in a market driven environment, the power transmission load flow value under transtction m is 2) = XACAT AY" = Where X —NI*N line eactance diagonal matrix; A. _NI*(Nb-1) correlated node-tine matrix without the line of slack node; Hq ) the injected power vector under transaction m; 2%") the power tensmission load flow value under transaction m; 1H the power transfer distribution factor; ‘The objective function of decentralized congestion ‘management optimization is: Bd) —Sc i) aR) © 0 o Here, B, is the benefit of power consumer d, and C,, is the cost of power supplier g,. 2) is the transmission load flow besides the congestion lines. 2004 KEEE lnemational Conference on Elerc Utility Deregulation, Restrocturing and Power Technologies (DRPT20O4) April 2008 Hong Kong. is the weighting factor. ‘The optimized function means the maximization of the tly funetion. It is recognized as the satisfied degree of the utility in valuation of strategies. According to ‘equation (6), the optimized utility is improved with the increase of expected benefit and reduced with the increase of the overload risk can be modified according to the impact of risk to wslty3). ‘The distribution congestion management is achieved With the communication and multiagent techniques. Each agent as one transaction coordination operator receives information from the Intemet and calculates the utility fanction in equation (6) in this transaction. The security server has the optimized transaction data fom all agents and update the congestion management info in web. The character of DRCM is the independence Dberween differont agents (ol, g""”), Bach ansection coordination operator can seek the optim n of transaction schedule (d""", g"). 1V EXAMPLE The effect ofthe utility algorithm in DRCM is illustrated using the classical IBEF-30 bus system [2]. The partition and combination of areas is shown in Figure 1 and there have been 9 consumers and 6 producers for bidding. The assumed market demand and supply functions are shown jin Table 1. Bach market group gets all market participants’ data, but only optimizes the demands and producers in its own area. ns Figure | IEEE 30-bus system tis supposed that all the generators and loads bid price according to the marginal supply and demand function. \With normal optimal power low calculation, line 6-8 have congestion problem and the node price in load 6-8 is much higher than other node prices. In DRCM, the line thermal overload risk is firstly cateulated. It is Know that the parameters of the air “Area Generator Supply Load Demand and wind speed: No___No.__—Function_No._ Function 63°C.y=Im/s,B =04m/ 5,9, =100°C- 300g According 19 equation (1) the overload thermal risk 4 : 0g? 4 39.0084 values of dtferent current in line 6-8 shows i Fig.2 ee aes os 1238-00089 1 OOsat3 5 395.0024 ®| 2 0.025933 : 1732-0024 8 3.600% od 2 ossg 4 3.6054 c 26 3.80044 a4 27 0,00834q13.28 : 30__3.7.0024 CS =o ‘Table 2 Resulis of decentralized risk-based congestion optimization ‘Optimization in ‘Optimization in Node No. Area C Sum Area A 1 45.06 ° 0 45.06 2 59.53 ° ° 5983 3 1.856 oi 0373 240 4 s912 0537 List 7.60 7 16393 1.882 402s 22.80 B 8.298 0.928 1978 11.20 B ° 1968 ° 19.68 Is 6.504 0540 1.186 820 "7 6.196 0893 Lent 9.00 2 ° ° 238 23.80 2 ° 17 ° 19.70 24 5276 1.108 2316 8.70 26 2591 0291 sis 350 u ° ° 46.57 4437 30 297 1.052 2251 1060 ‘With the incorporating analysis of line overload risk, the whole welfare can be maximized 10 system security operators. Figure 3 is a comparison to the whole welfare 716 2004 IEEE Intemational Conference on Ekesrc Utility Deregulation, Resrvetiring and Power Technologies (DRPT2004) April 2004 Hong Kong, Figure 2 Risk of different current ‘Table | Assumed market demand and supply functions forthe example ‘between Toad power constraints and load risks without power constraint

Potrebbero piacerti anche

  • Kalay Atway - Add Say
    Kalay Atway - Add Say
    Documento133 pagine
    Kalay Atway - Add Say
    api-3697505
    Nessuna valutazione finora
  • Loads Combination Method Based Core Schema Genetic Shortest-Path Algorithm For Distribution N
    Loads Combination Method Based Core Schema Genetic Shortest-Path Algorithm For Distribution N
    Documento5 pagine
    Loads Combination Method Based Core Schema Genetic Shortest-Path Algorithm For Distribution N
    api-3697505
    Nessuna valutazione finora
  • 01356300
    01356300
    Documento5 pagine
    01356300
    api-3697505
    Nessuna valutazione finora
  • Distribution Network Reconfiguration For Reliability Worth Enhancement
    Distribution Network Reconfiguration For Reliability Worth Enhancement
    Documento4 pagine
    Distribution Network Reconfiguration For Reliability Worth Enhancement
    api-3697505
    Nessuna valutazione finora
  • Ba Luu Doe' Ywar (U Thaung)
    Ba Luu Doe' Ywar (U Thaung)
    Documento126 pagine
    Ba Luu Doe' Ywar (U Thaung)
    yeyint
    Nessuna valutazione finora
  • Historyof Mankind
    Historyof Mankind
    Documento162 pagine
    Historyof Mankind
    api-3697505
    Nessuna valutazione finora
  • 01509819
    01509819
    Documento4 pagine
    01509819
    api-3697505
    Nessuna valutazione finora
  • 01349721
    01349721
    Documento4 pagine
    01349721
    api-3697505
    Nessuna valutazione finora
  • 01347592
    01347592
    Documento6 pagine
    01347592
    api-3697505
    Nessuna valutazione finora
  • 01338518
    01338518
    Documento6 pagine
    01338518
    api-3697505
    Nessuna valutazione finora
  • 01348243
    01348243
    Documento4 pagine
    01348243
    api-3697505
    Nessuna valutazione finora
  • 01343686
    01343686
    Documento5 pagine
    01343686
    api-3697505
    Nessuna valutazione finora
  • 01347595
    01347595
    Documento5 pagine
    01347595
    api-3697505
    Nessuna valutazione finora
  • 01338475
    01338475
    Documento6 pagine
    01338475
    api-3697505
    Nessuna valutazione finora
  • 01338070
    01338070
    Documento6 pagine
    01338070
    api-3697505
    Nessuna valutazione finora
  • 01338515
    01338515
    Documento4 pagine
    01338515
    api-3697505
    Nessuna valutazione finora
  • 01338466
    01338466
    Documento5 pagine
    01338466
    api-3697505
    Nessuna valutazione finora
  • 01338460
    01338460
    Documento4 pagine
    01338460
    api-3697505
    Nessuna valutazione finora
  • 01338041
    01338041
    Documento6 pagine
    01338041
    api-3697505
    Nessuna valutazione finora
  • 01338470
    01338470
    Documento7 pagine
    01338470
    api-3697505
    Nessuna valutazione finora
  • 01338078
    01338078
    Documento6 pagine
    01338078
    api-3697505
    Nessuna valutazione finora
  • 01338068
    01338068
    Documento6 pagine
    01338068
    api-3697505
    Nessuna valutazione finora
  • 01338074
    01338074
    Documento6 pagine
    01338074
    api-3697505
    Nessuna valutazione finora
  • 01338048
    01338048
    Documento5 pagine
    01338048
    api-3697505
    Nessuna valutazione finora
  • 01337997
    01337997
    Documento6 pagine
    01337997
    api-3697505
    Nessuna valutazione finora
  • 01309843
    01309843
    Documento9 pagine
    01309843
    api-3697505
    Nessuna valutazione finora
  • 01338007
    01338007
    Documento6 pagine
    01338007
    api-3697505
    Nessuna valutazione finora
  • 01338030
    01338030
    Documento5 pagine
    01338030
    api-3697505
    Nessuna valutazione finora
  • 01007714
    01007714
    Documento5 pagine
    01007714
    api-3697505
    Nessuna valutazione finora