Home Coordinated Action of Fast and Slow Reserves for Optimal Sequential and Dynamic Emergency Reserve Activation
Article
Licensed
Unlicensed Requires Authentication

Coordinated Action of Fast and Slow Reserves for Optimal Sequential and Dynamic Emergency Reserve Activation

  • Surender Reddy Salkuti EMAIL logo , P. R. Bijwe and A. R. Abhyankar
Published/Copyright: February 13, 2016

Abstract

This paper proposes an optimal dynamic reserve activation plan after the occurrence of an emergency situation (generator/transmission line outage, load increase or both). An optimal plan is developed to handle the emergency situation, using coordinated action of fast and slow reserves, for secure operation with minimum overall cost. This paper considers the reserves supplied by generators (spinning reserves) and loads (demand-side reserves). The optimal backing down of costly/fast reserves and bringing up of slow reserves in each sub-interval in an integrated manner is proposed. The simulation studies are performed on IEEE 30, 57 and 300 bus test systems to demonstrate the advantage of proposed integrated/dynamic reserve activation plan over the conventional/sequential approach.

Nomenclature

ai, bi, ci, di, ei

Cost coefficients of thermal generator i.

ak,bk,ck

Cost coefficients of demand-side reserve offers for kth demand.

CGi

Fuel cost function of ith generating unit.

Ck

Demand-side reserves cost function for kth load/demand.

Gij, Bij

Transfer conductance and susceptance between bus i and bus j.

n

Number of buses in the system.

ND

Number of loads/demands.

NG

Number of thermal generators.

PDit,QDit

Forecasted real and reactive power demands in sub-interval “t”.

PGimin,PGimax

Minimum and maximum power limits of ith generator in MWs.

PGit

Power output from ith generator (MW) in sub-interval “t”.

PGit1

Power output (MW) of ith generating unit in previous sub-interval “(t–1)”.

Pit,Qit

Active and reactive power injection at bus i in sub-interval “t”.

Pshd,kt

Amount of demand-side reserve (MW) provided by kth demand in sub-interval “t”.

PSRit

Scheduled spinning reserve of ith generator (MW) in sub-interval “t”.

RGiup,RGidown

Ramp up and ramp down limits of ith generator.

t

Sub-interval (10 min) index.

T

Scheduling period.

VDkt

Load bus voltage magnitude in sub-interval “t”.

Vit,Vjt

Voltage magnitudes at bus i and bus j in sub-interval “t”.

δit,δjt

Voltage angles at bus i and bus j in sub-interval “t”.

Appendix A

Genetic algorithm (GA) fitness function evaluation [28]

Penalty function adds some terms to the objective function, which punishes a solution that is not feasible. A review of constraint handling techniques in GA is described in Ref. [29]. This paper uses static penalty function [26, 23] approach to handle constraints. Infeasible solutions are penalized by applying a constant penalty to those solutions, which violate feasibility in any way. The penalized objective function would then be the unpenalized objective function plus a penalty. Initial values of penalty weights, and their modifications during the solution run depend largely on the power system [23]. Poor choices of these values lead to excessive oscillation of the solution process between the feasible and infeasible regions, or to very slow convergence. Initial penalty weights are selected based on experience and they are multiplied by a factor 5 after every iteration, if violation still exists. The objective function can be formulated as follows,

(22)FitnessFunction=K1+Faug

where K is a constant (taken as 100), and Faug is the augmented objective function.

(23)Faug=F+λsPG1PG1limit2+λVk=1NDVDkVDklimit2+λQi=1NGQGiQGilimit2+λli=1NιLlilimit2

where F is objective function, Ni is number of lines in the system. λs, λV, λl are penalty factors. Xlimit is the limit value of the dependent variable X given as,

(24)Xlimit={XmaxifX>XmaxXmaxifX>Xmin

Appendix B

Generator parameters for IEEE 30 bus system

Table 8 presents the generator cost coefficients with valve point effect, ramp rate limits, real power minimum and maximum limits for IEEE 30 bus system.

Table 8:

Generator parameters for IEEE 30 bus system.

Bus noReal power (MW)Previous Gen. (t=0) (MW)Ramp rates (MW/10 min)Cost coefficients
MinMaxDownUpabcef
1502001503020100300160506.3
2208035151540250100409.8
51550152020030062500
810351588022583.400
1110301088020025000
131240151010025045000

Appendix C

Generator parameters for IEEE 57 bus system

Table 9 presents the generator cost coefficients with valve point effect, ramp rate limits, real power minimum and maximum limits for IEEE 57 bus system.

Table 9:

Generator parameters for IEEE 57 bus system.

Bus noReal power (MW)Previous Gen. (t = 0) (MW)Ramp rates (MW/10 min)Cost coefficients
MinMaxDownUpabcef
10575.88480404050300160506.3
2010050303020250100409.8
30140703030030062500
60100404040030062500
80100502020022583.400
905504602020020025000
120100602020025045000

References

1. NERC Operating policy-10 on interconnected operations services. Technical Report, Draft-3.1, Feb. 2000.Search in Google Scholar

2. Ela E, Milligan M, Kirby B. Operating reserves and variable generation. Technical Report, NREL/TP-5500-51978, Aug. 2011.10.2172/1023095Search in Google Scholar

3. Arroyo JM, Galiana FD. Energy and reserve pricing in security and network-constrained electricity markets. IEEE Trans Power Syst 2005;20:634–43.10.1109/TPWRS.2005.846221Search in Google Scholar

4. Ruiz PA, Sauer PW. Spinning contingency reserve: economic value and demand functions. IEEE Trans Power Syst 2008;23:1071–8.10.1109/TPWRS.2008.922230Search in Google Scholar

5. Strbac G, Ahmed S, Kirschen D, Allan RA. Method for computing the value of corrective security. IEEE Trans Power Syst 1998;13:1096−102.10.1109/59.709105Search in Google Scholar

6. Philpott AB, Pettersen E. Optimizing demand-side bids in day-ahead electricity markets. IEEE Trans Power Syst 2006;21:488−98.10.1109/TPWRS.2006.873119Search in Google Scholar

7. Monticelli A, Pereira MVF, Granville S. Security constrained optimal power flow with post contingency corrective rescheduling. IEEE Trans Power Syst 1987;2:175−80.10.1109/TPWRS.1987.4335095Search in Google Scholar

8. Wu L, Shahidehpour M, Liu C. MIP-based post-contingency corrective action with quick-start units. IEEE Trans Power Syst 2009;24:1898−9.10.1109/TPWRS.2009.2030262Search in Google Scholar

9. Maharana MK, Swarup KS. Particle swarm optimization based corrective strategy to alleviate overloads in power system. World Congress on Nature & Biologically Inspired Computing 2009;37−42.10.1109/NABIC.2009.5393597Search in Google Scholar

10. Karangelos E, Bouffard F. Towards full integration of demand-side resources in joint forward energy/reserve electricity markets. IEEE Trans Power Syst 2012;27:280−9.10.1109/TPWRS.2011.2163949Search in Google Scholar

11. Wang J, Shahidehpour M, Li Z. Contingency-constrained reserverequirements in joint energy and ancillary services auction. IEEE Trans Power Syst 2009;24:1457−68.10.1109/TPWRS.2009.2022983Search in Google Scholar

12. Wang J, Redondo NE, Galiana FD. Demand-side reserve offers in joint energy/reserve electricity markets. IEEE Trans Power Syst 2003;18:1300−6.10.1109/TPWRS.2003.818593Search in Google Scholar

13. Gan D, Litvinov E. Energy and reserve market designs with explicit consideration to lost opportunity costs. IEEE Trans Power Syst. 2003;18:53−9.10.1109/MPER.2002.4311914Search in Google Scholar

14. Amjady N, Aghaei A, Shayanfar HA. Market clearing of joint energy and reserves auctions using augmented payment minimization. IEEE Trans Power Syst 2003;18:53−9.10.1016/j.energy.2009.06.048Search in Google Scholar

15. Capitanescu F, Ramos JL, Panciatici P, Kirschen D, Marcolini AM, Platbrood L, et al. Start-of-art, challenges, and future trends in security constrained optimal power flow. Electr Power Syst Res 2011;81:1731−41.10.1016/j.epsr.2011.04.003Search in Google Scholar

16. Capitanescu F, Wehenkel L. Improving the statement of the corrective security-constrained optimal power-flow problem. IEEE Trans Power Syst 2007;22:887−9.10.1109/TPWRS.2007.894850Search in Google Scholar

17. Delourme B, Lasnier A, Lefevbre H, Simeant G. Minimizing the cost of generation redispatching taking into account remedial actions. paper C2-103, in: CIGRE Conference, France, 2006.Search in Google Scholar

18. Hazra J, Sinha AK. Congestion management using multi-objective particle swarm optimization. IEEE Trans Power Syst 2007;22:1726−34.10.1109/TPWRS.2007.907532Search in Google Scholar

19. Reddy SS, Abhyankar AR, Bijwe PR. Co-optimization of energy and demand- side reserves in day-ahead electricity markets. Int J Emerg Electr Power Syst 2015;16:195−206.10.1515/ijeeps-2014-0020Search in Google Scholar

20. PJM Manual: Energy and Ancillary Services Market Operations [Online]. Available at: http://www.pjm.comSearch in Google Scholar

21. Gaing ZL, Chang RF. Security-constrained optimal power flow by mixed-integer genetic algorithm with arithmetic operators. IEEE Power Engineering Society General Meeting, 2006:1−8.10.1109/PES.2006.1709334Search in Google Scholar

22. Reddy SS, Momoh JA. Realistic and transparent optimum scheduling strategy for hybrid power system. IEEE Trans Smart Grid 2015;6:3114−25.10.1109/TSG.2015.2406879Search in Google Scholar

23. Alsac O, Stott B. Optimal load flow with steady state security. IEEE Trans Power Apparatus Syst 1974;93:745−51.10.1109/TPAS.1974.293972Search in Google Scholar

24. Gen M, Cheng R. Genetic algorithms and engineering design. New York: John Wiley & Sons, 1997.10.1002/9780470172254Search in Google Scholar

25. University of Washington, Power system test case archive 2007. [Online]. Available at: http://www.ee.washington.edu/research/pstca.Search in Google Scholar

26. Lai LL, Ma JT, Yokoyama R, Zhao M. Improved genetic algorithms for optimal power flow under both normal and contingent operating states. Electr Power Energy Syst 1997;19:287−92.10.1016/S0142-0615(96)00051-8Search in Google Scholar

27. Pai MA. Computer Techniques in Power System Analysis, 2nd ed. New Delhi, India: Tata McGraw-Hill, 2006.Search in Google Scholar

28. Reddy SS, Abhyankar AR, Bijwe PR. Reactive power price clearing using multi-objective optimization. Energy 2011;36:3579−89.10.1016/j.energy.2011.03.070Search in Google Scholar

29. Osman MS, Abo-Sinna MA, Mousa AA. A solution to the optimal power flow using genetic algorithms. Appl Math Comput 2003;155:391−405.10.1016/S0096-3003(03)00785-9Search in Google Scholar

Received: 2015-8-30
Revised: 2015-12-16
Accepted: 2016-1-17
Published Online: 2016-2-13
Published in Print: 2016-4-1

©2016 by De Gruyter

Downloaded on 13.9.2025 from https://www.degruyterbrill.com/document/doi/10.1515/ijeeps-2015-0150/html
Scroll to top button