Scribd Logo
Upload

Welcome to Scribd!

  • Lab 7-8

    Uploaded by

    Nabeel Anwar
    3 views10 pages

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document

    Copyright:

    © All Rights Reserved
    Download as PDF or read online from Scribd
    Flag for inappropriate content
    3 views10 pages

    Lab 7-8

    Uploaded by

    Nabeel Anwar

    Copyright:

    © All Rights Reserved
    Download as PDF or read online from Scribd
    Flag for inappropriate content
    of 10
    EXPERIMENT No.7 t SOLUTION OF UNIT COMMITMENT PROBLEM BY ENUMERATION 1 METHOD PURPOSE: To lean 1, Mathematical formulation of Unit Commitment (UC) problem 2. Solution of Unit Commitment problem using Enumeration Method SOFTWARE USED: MATLAB INTRODUCTION: ‘The Unit Commitment (UC) is an important research challenge and vital optimization task in the daily operational planning of modern power systems due to its combinatorial nature. Because the total load of the power system varies throughout the day and reaches a different as to decide in advance which generators peak value from one day to another, the electric utility he to start up and when to connect them to the network and the sequence in which the operating units should be shut down and for how long, The computational procedure for making such decisions is called unit commitment, and a unit when scheduled for connection to the system is said to be committed. non-linear, large scale, mixed-integer In general, the UC problem may be formulated as a combinatovial optimization problem with both binary (unit status variable) and continuous (unit output power) variables. Objective Function: Je of the generating units in every sub-period day or 1 week) in order to serve the load ion cost (fuel cost, startup cost, and shut. to prepare on/off schedul planning period (typically 1 at minimum total producti and system constraints. The principal qbjective is (typically 1h) of the given demand and spinning reserve down cost), while meeting all unit, The following costs are considered. .d it is mathematically @ Fuel Cost The quadratic approximation is mostly used for fuel cost function an represented asi! Ah) FCP) = ai + biPi + oyPP (i) Start-up Cost Start-up cost is’ ‘warmth-depent dent. Mathematically it js represented as a step function: STin = Hot — Cost: TP" < x2/l(h) < (TPO™™ + Cold — Start Hours) “ STiy = Cold — Cost: X°*f (h) > (TPe™" + Cold — Start Hours) ii) Shut down Cost The typical value of the shut down cost is zero in the standard systems. This cost is considered as a fixed cost: Ch) : SDiy = KPin ‘Where K is the incremental shut-down cost. Thus objective function of the unit commitment problem is to minimize the total production cost and is mathematically formulated as: nw Minimize TPC =)” Y [Fi(Pin) + STin + SPin} fee SS nai tet The UC Problem is subjected to many constraints that include: © The total power generated must meet the load demand. © There must be enough spinning reserve to cover any shortfalls in generation. © The lodding of each unit must be within its minimum and maximum allowable rating Cimits), ‘The minimum up and down times of each unit must be observed. Unit avoilability constraint is either unit is available / not available, out aged/Must out... Must run, and Fixed Output Power (F.0.P). Unit initial status +/- either already up or already down. ‘The constraints which are taken into consideration in this experiment are Power balance equation, spinning reserve and loading limits only. 0000 ENUMERATON METHOD: This method takes all the combinations cach unit, Where N = number of units, H = number of hours, (24). For a total interval, the maximum number of possible combinations is eye (28-1) and then calculated the economic dispatch of period of H PROCEDURE: PROCEDURE: ‘The procedure to find solution of unit commitment problem for a given power system is given below: { fag 1. Write down all the possible combinations of generation units using the relation (2-1). city of each combination by using >. Calculate the minimum and maximum generation capa the given loading limits. 3, Find out the feasible combinations among all combinations that can satisfy the given power demand. (Those combinations whose maximum generation capacity as calculated in step-2 is greater than given load demand) 4, For every feasible combination, calculate lambda () using analytical method by considering only the units that are in the ON state. ! a-b, 3. Calculate ‘the individual cost of each generator by substituting the value of power (obtained in step-3) in the respective fuel cost equations and write down in Table-1. 4. Calculate total cost of generation by adding up the individual costs as ! Frat =F = Gt BE HOP?) ta And record the results in Table-1 5, Select the combination with the lowest cost which is the most feasible combination. in MATLAB Now obtained results are verified through MATLAB. Open anew M-file i and type the following code: MATLAB CODE: lamda_iteration.m function [p1,lamdal cost! ]-lamda_jteration(costl pul .pll,pdl lamdal) ni=length(pl1); dp1=500; for i1=1:nl al(il,1)=cost1 (1,1); bI(il,1)=cost! (1,2); ylGl,1)seostl (il,3)s end i while(abs(dp1)>5) pl=(amdal-b1)/2*yl)s for jl=I:nl if(p1G1,1)>puli) pl@l1)=pul i end iffp1G1.=pd for u=1:n if p(vu)—=1 e(1)=cost(u,1); e(f,2)=cost(u,2); e(£,3)=cost(u,3); pli(1,Q=pl(1u); pul(1,f)=pu(1,u); ‘fef1; end end {pl,lamdal,cost!]-lamda_iteration (e,pul,pll,péslamd); 1; for x=1 ifpx=l p(vnt2+x)=pl Gs mrt, end end end end n2=Iength(pl); for i2=1:n2, a2(i2,1)=cost(i 2(i2,1)=cost(i2,2); y2(i2,1)=cost(i2,3); end for z=1:n for b=1:(com+1) iptbm242)>0 peo 2ent242)-a2(an)#b2¢z I DOOD yA)" ACOH 27)" ‘p(b,nt2+z); end end end for d=1:(com+1) p(d,3*nt3)=0; for h=1:n p(ds3*nr3)=pld.2%n+2+b)4p(d 3m); end end EXERCISE: 3-machine system given for the Unit Commitment Problem is as: F.C=1.1$/MBtu F.C=1.0S/MBtu 2 H,(P,) = 510 + 7.2P, + 0.00142P,7 150 The constraints which are taken into consideration in this experiment are power balance e000 equation, spinning reserve and loading limits only. PRIORITY LIST SCHEME: This approach is based on conventional priority list method. A priority order is created based on the Full Load Average Production Cost (FLAPC). The UC schedule is based on FLAPC and ED is based on Lambda Iteration Method. In this method, units are committed to service by observing their heat rate values. Units with the lowest heat rate are put into operation first. For shutting down the reserve order is followed, i.e. the units with the highest heat rate is withdrawn first. The load dispatcher takes into account the hourly forecasted load and spinning reserve requirement, and then schedules the units to match the load and spinning reserve. The industry, however, still mostly used the simple "meritorder" method. Priority List Scheme is a method of solving Unit Commitment Problem. PROCEDURE: ; The procedure of. implementation of priority list scheme to find solution of unit commitment problem for a given system is given below: 1. Calculate full load average production cost (FLAPC) of each generating unit according to following equation: (FLAPC), = (a; + byP7™ + PP) / PR Where qj, b; and cj are fuel cost coefficients and P’"** is maximum generation capacity of respective unit. Arrange the units in the ascending order according to their FLAPC in Table-1 Select the combination of highest priority which makes use of the plants with minimum FLAPC. 4, Calculate lamda for that particular combination using the formula 2 8 Poth 0+ Dis, 1 4 2¢, Lamda(A) = 5. Calculate generation sharing of individual generators using the equation Calculate the individual cost of each generator by substituting the value of power (obtained in step-5) in the respective fuel cost equations and write down in Table-2. Calculate total cost of generation by adding up the individual costs as: Fro =F = 3 (a, +52, + 6P?) ot i= And record the results in Table-2. This approach is also demonstrated through MATLAB. Open anew M-file in MATLAB and type the following code MATLAB CODE: Do it by yourself and ask if any Ques ! Record the MATLAB result in Table-3 EXERCIS! 3-machine system given for the Unit Commitment Problem is as: H,(P,) = 510 + 7.2P, + 0.00142P,2 ; 150

    You might also like