Scribd
Upload
14 views11 pages

Unit Commitment

The document discusses unit commitment in power generation, emphasizing the predictable patterns of electrical consumption and the need for optimal scheduling of power plants to meet demand. It outlines cost function formulations for operating units, including running and startup costs, and constraints for plant commitment schedules. Additionally, it introduces dynamic programming as a method for optimizing unit commitment decisions based on sequential decision processes.

Uploaded by

lokendrapratapsingh594
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF or read online on Scribd
14 views11 pages

Unit Commitment

The document discusses unit commitment in power generation, emphasizing the predictable patterns of electrical consumption and the need for optimal scheduling of power plants to meet demand. It outlines cost function formulations for operating units, including running and startup costs, and constraints for plant commitment schedules. Additionally, it introduces dynamic programming as a method for optimizing unit commitment decisions based on sequential decision processes.

Uploaded by

lokendrapratapsingh594
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF or read online on Scribd
5 UNIT COMMITMENT ——e—e—oSSSa9aaaanna —— elie syle of a modem man follows regular habits and hence the present soc sows regularly repeated cycles or pattern in daly life. Therefore, the consumption of electrical also follows a predictable daily, weekly and seasonal pattern. There are periods of high veconsumption as well as low power consumption. It is therefore possible to commit the eating units from the available capacity into service to meet the demand. The previous cisions all deal with the computational aspects for allocating load to a plant in the most ‘nical manner Fora given combination of plants the determination of optimal combination {ls for operation at any one time is also desired for carrying out the aforesaid task. The ‘stconmitment and unit ordering schedules extend the period of optimization from a fe ®autsio several hours. From daily schedules weekly pattems can be developed. Likewiss, ty seasonal and annual schedules can be prepared taking into consideration the repetits wate lad demand and seasonal variations. Unit commitment schedules ae hisses ‘scconically committing the units in plants to service with the time at which individ “Sstoud be taken out from or returned to service. { CostFunction Formulation tap wi ‘ethe cost of operating the ith unit when supplyins 8 00st coefficient an output of P, Then, if C's the F,=C,P; ss i= CPi : Bs ere C, may vary depending on the loading condition Operation and Contr, . Sie, 7 variable cost coefMicient C; for ith unit when open we my ts ring active power is Py. Since the level of operagine sag he comes ay be described with yet another index roan f coefficient may be fenote she re, the cast © a the sub interval t corresponding to a poms time, on, so that it Becomes Cy, fOr oupue is eapable of operation at kdiserete levels, then the running nq each unit is ca 1 in be oa interval t is given by i Fe = LCuPie a If there are N units available for service in the interval t then the total run N units during the period tis, Ne Fan = 2 Cie Pie a ing coy For the entire time period of optimization, having T such sub-intervals of tine, overall running cost for all the units may be put in the form Ne 2X LCP wt ft fl Suppose that fora plant tobe brought into service, an additional expenditure C. bats be incured in addition to the running cost, then the start up cost of the unit i the oe « Starting X units during any subinterval is given by x R= Seu, where 8, if the ith unit is started in sub-interval t and is zero other wise snus smilar manner, ifa plant is taken out of service during scheduling period, the ost of att down also must be taken into account. If Y units are to be shutdown during ‘ub*nerval tthe shutdown cost may be represented by a pendire Of the unit, tes x Fe pe tial expression for the ost function hen have the form, incuding run Bad [$euo, + ach sub-interval of time t, the numbe generators to be shut-down anc pri Constraints for Plant Commitment Schedules ‘optimal point generation scheduli wate cia ape seedling tou of cc ee Prin = ‘he Plans are given by ’ Ca Saving P= 1) Rokkeal : 4. The pi P= Los RSkcal P= 12 Rskkcal 34 Dyna: The full oag ion &t plant 1 This method “10°07 + 04 te Osi y, “aken in defi; “935 x 193 iw of, He The fy) load Verage Produetio, tt Plant 2 Peration att "1D (754, .002 400); 05 “DUnciateg by 10 0.8)1 95 8 ‘he initiay Stat The fal toag Average Policy wi vel ly Tay The jtment commit i! ~ onder of inereasing Costs the Follo { unit |__RyMwiir | yi nu 2 8.715 x10] aw) " 84 0¢ |__Min (my 1 | 935x10% | ae vin MW) 10.56 « 10° vu Pes ued NE) —_ 200 | ist for supplying a load upto 1 20 ne priority | . qe prion? 000 Mw is pre ajenat0 Prepared as follows w Units 2,1 and3 al Table 5.1 Priority list for supply of 100MW rr general procedure can be then stated as : \, Check at the end of every hour of operation, if t . has decreased check if the 1 ne He so demand has fallen. If th deman Hens last unit in the priority list is d - demand can be met, satisfying the spinning reserve requirement. Status roped, the load ifthe demand cannot be met. 3 oes 1 Hitis possible to drop the unit in step 1, then determine the number of hours “h” before te unit is required again for service. If this “h” is less than the shut down and start - times for the unit, it has to be left in service without removal. 3, Then, calculate the cost of floating the unit within the system without supplying any cost of shut down and start up processes and if there is sufficient for service it can be removed. generation and the savings from shutting it down, and starting it again 4, The process is to be repeated for the next unit on the priority list and continued. ‘4 Dynamic Programming Tismethod can be applied to problems in which many sequential ri indefining the optimum operation of a system or process comp a sts, However, itis suitable only when the decisions at the later stages do not afte we ‘ontion atthe earlier stages Dynamic programming is based on the principle xs got i ; i Wi oo byBellman in 1957, It states that “an optimal policy hasthe proest “ee ee and the initial decisions are, the remaining decisions must const 4 i ision”. regard to the state resulting from the first deci vga Ke sci whe! oe, the method is suitable only to multistage decision processes Wi fect only vi decisions are required to be osed of a distinct number aken one ence ing events in the sequenct a routing problem Ways ee does not influence the preceding °Y Jaine The principle and methodology will be exp! Opera nd Controt in — 3 nom ne S84, By gio sap shown in Fig. 5.1, The values onthe routes ae the cost op oe Tt ae goal to be reached from any of the locations 4. ° ta, Pe i oe acetone shown on the routes, * 8,0, 7 along the direction s! " : a i wher 5 Unit bm I eral 1 onic P ercost ch : ‘is inform applied 20) Let s c z . Fig. 5.1. The Routing Problem E A sitet reach the goal G of destination G ftom the Vatious locations. The areas indicated a : From D to reach G s @ ° oe = Minko, Cry + C8, Minl6,1+.4)=5 ic = ee + C9 ; Cc es i *Chol=1+5,44 506 shone Pactlac, + Con =B+sjog m § Zs =8 along ho = Mino +0850, +2 . w’BCDG | . lcatig £2 thus cope At + Ch nT sar: anioee MBE "eaton R vig ¢ i SOMCMUde that ty aia : Biven by H 6051 t0 move trom ne location P to another sub (= ~ 7G "Em +0, To start wi 08 the cose ma i : Q Once ait th ‘%' the optimal cost to move fom a at Q is taken based Cha = MiniCoig wee QIK, Q2R sos QNR ate the ma whet it Commitment by Dyna . mie Pretthdag . ss ; oad changes in smal steps, For th in amming method for uni anes = it commitment. For this {amie ER erties ofthese units and the tment. Fortis the number fei load cycle ae the its wah is made available, the functional r urreice relat st formation i nits in service supply a total load of Se The total operating cost for this generation = Fy( $2) can be divided into two components as fllows This co: the cost of operating (N-1) units to supply a ‘The first component is 0 demand of Yee “The operating cost for this generation is Fy. SR (i The second component is the cost of operating the [Nth unit at an active power output of Py; is fyPy)- ‘The cost of supplying the total load DP, = Px + Fp, is given now by rs a (35) oh + Sn) py) + Fx 28) st 5, along EFHDS =) x Pi \ i offn)eadarorre \\ # ‘a AEF HD subject to constraints. istage secon POC i mult sting ation PP soot Thus, the problem of unit commit ent is converte ee. Hecision pre of elects Tota withthe solution to the problem oy erthe sng SAB ce ofthe one unit that will provide the lowest cost OF ne is compet Once such a unit is picked up, the firs at Ste Ope ration ang Controt i cost of operating this first unit be £,(, ) When supp ing p ly, un . = F\(P,) = £(P,) ES © optimal combination of this unit with a second Unit can be derive ng +P, for which the optimal cost is "Ext gg EP, + P,) = min [£@,) + FP] Since F,(P,) is already the optimal value, the best Unit to sy 7 (N-1) units will be picked up during this second stage oF optimization fo, lors hy So of production, ible |na similar way, the best 3 unit combination is found from AC, +P, +P.) = min (5@,) + F, +P) Subject to Constraints and so Nn, So that finally we arrive at = is Nei 2R *minfy(Py)+Fy_, Ee) a at Which is the Tequired solutio, l. o . programming method. che anton St Possipie co FQ) *8G)7 08 X34 25 «3-72 0750p = FG) = min (£00) * 49), £0) + FQ), Fa) «er, ¢ in [0+ 82.2, 1.2+22+32+ 50,4 = min (82.2, 76.4, 75.6, 76.8] ~ 74.6 spemost economical combination unit suppying MW ang +08 Units to be commited in

You might also like