Determination of Market Clearing Price in Pool Markets with Elastic Demand

Transcription

1 Determination of Market Clearing Price in Pool Markets with Elastic Demand ijuna Kunju K and P S Nagendra Rao Department of Electrical Engineering Indian Institute of Science, angalore kbijuna@gmail.com, nagendra@ee.iisc.ernet.in Department of Electrical and Electronics Engg T.K.M.College of Engineering, Kollam Abstract Determination of Market Clearing Price is one of the prime functions of a pool operator. In many of the existing markets, market clearing is based on stepped bids received from generators and consumers. However, quadratic bid functions have more information and are more realistic. A simple closed form solution scheme to compute the clearing price from such supply and offer bids submitted to the operator is proposed in this paper. I. INTRODUCTION The most popular form of electricity market so far has been the centralized auction, which has often mimicked the procedures used for central dispatch in the past, reflecting concerns over system security [1], [2], [3]. After the auction, some pool-based electricity markets operate under a systemwide market price [3] while others have elected the approach of nodal (or locational) marginal prices [4]. The bids supplied by the generators/generating companies indicate the quantity of power they are ready to supply at a certain price in terms of a price function [1], [2]. In many pool markets, the consumers also submit offers in terms of quantity of power required and a price function (at which they are prepared to purchase) [5]. In the single-price auction, the market-clearing price is determined by a merit order algorithm [6]: a wellestablished technique where all participating generators bids are ordered according to increasing levels while participating consumers bids are ranked according to decreasing levels. The market clearing price is then defined by the intersection of the aggregate demand and supply curves. This method has the advantage that it is very simple to implement. With this process the total demand that can be met and the individual generations accepted/ loads supplied can be decided fairly easily. The stepped bids in use are approximations of the true cost function of the generating units. A basic requirement for the success of market dictated utility operation is that the bids must reflect the true costs of operation. Hence, it is easy to see that use of quadratic functions to represent the cost of generation would provide a better representation of the true cost of generation. It may also be noted that the use of quadratic functions to represent the cost of generation has been in use in power systems for a long time now. Hence, continuing to use this form of cost functions (bid functions) should be more acceptable to the industry rather than adopting the step form of cost functions. A similar argument holds good for the bids of loads also. It must be pointed out that there has been a considerable body of research which attempts to forecast the MCP [7], [8], [9], [10]. Such forecasts are meant to be used by the bidders in order to tune their bids to maximize their individual profits. Techniques based on artificial intelligence and probability theory have been proposed for this purpose. It is easy to see that such techniques are obviously not intended to maximize the societal benefit and hence, cannot be expected to achieve the desired goals of restructured markets. The aim of this paper is to develop a method for determining the market clearing price in the case of pool markets under the assumption of no congestion. In this development, it is considered that generator bid functions and the load valuation functions are quadratic functions of real power. The maximum and minimum limits on both individual generations and loads are also accounted in this process. The proposed method has been developed by extending an earlier method [11], meant for determining the generation schedules in vertically integrated power systems. However the method in [11] does not consider the bids of consumers and it also requires the total demand to be specified. In this approach, a formula is developed in Section II to find the clearing price where the generator and load bids are quadratic functions of real power. It is then shown how this formula can be used in a systematic way to handle the limits on loads and generators and arrive at the final schedule. A detailed illustration of the algorithm is given in Section III and the paper is concluded in the next Section. In Section III, methods of handling generators bids and consumers offerswith and without limits, fixed demands (block bids) and their combinations are illustrated. II. A FORMULA FOR MARKET CLEARING PRICE Consider a system with N generators and M consumers. Let the generator bid function for the i th generator be C i (Pg i )=a i Pg 2 i + b i Pg i + c i and the consumer benefit function for the j th load be f j (Pd j )=α j Pd 2 j + β j Pd j + γ j 214

2 The objective of the pool market operator is to maximise the social welfare function f j (Pd j ) C i (Pg i ) subject to the power balance constraint, (Pg i )= (Pd j ) (1) Hence, the augmented objective function for unconstrained optimisation is L = C i (Pg i ) f j (Pd j ) λ( (Pg i ) (Pd j )) where λ is the Lagrangian multiplier. The conditions for optimality of L are given by dl dλ = dc i =0 i (2) dp g i and dl dλ = df j =0 j (3) dp d j Equations (2)and (3) imply that for optimality, the incremental cost functions of all the generation as well as the incremental utility function of all loads must be equal to λ. The incremental cost for generators can also be written as dc i = λ =2a i Pg i + b i, i N (4) dp g i At the optimum, the incremental costs of all generators are same and we have, 2a i Pg i +b i =2a k Pg k +b k = λ i N,for a particular k N (5) Pg i = 2a kpg k + b k b i, i N (6) 2a i Let the total demand (total generation) given by (1) be equal to P R. Therefore, (Pg i )= 2a k Pg k + b k b i 2a i = P R (7) N 2a k Pg k ( 1 N )+b k ( 1 ) ( b i )=2P R. (8) a i a i a i Define two parameters A and, and and (8) can be written as A = = ( 1 ) (9) a i ( b i a i ). (10) (2a k Pg k + b k )A =2P R + (11) where (2a k Pg k + b k )=λ Hence the value of λ is obtained as λ = 2P R + A Similarly, with the demand offers, it can be shown that where, A d = d = (12) λ = 2P R + d A d (13) ( 1 ) (14) α i Solving (12) and (13), we have ( β i α i ) (15) P R = A d A d 2(A d A) λ = ( d) (A A d ) (16) (17) The schedules for each of the generators and the demand of each consumer that can be met is obtained as, Pg i = λ b i 2a i i (18) Pd i = λ β i 2α i i (19) A. Incorporating the Limits The formula in (17) for the market clearing price is valid only if the corresponding generators and loads given by (18) and (19) are within their limits. However, this may not always happen. If at any stage of calculation of the system λ using (17), the corresponding schedule results in limit violations, then the violating loads / generations must be constrained at the limits that they are violating and the net difference between such allocated loads and generations has to be first optimally allocated among the non violating generators / loads. For this step also, the formula derived above is made use of. After this step, the cost functions of the non violating generators / loads are modified to reflect the partial allocation of load / generation that has been done to the particular entity. The process of finding the system market clearing price is continued considering only the non violating generators / loads and the modified incremental cost functions of these generators and loads. 215

3 III. ILLUSTRATION OF THE METHOD Consider a system consisting of three generators and two consumers with variable demands. The generator cost functions of the three units as given in [11] are, C 1 =0.003Pg Pg C 2 =0.015Pg Pg C 3 =0.01Pg Pg The offer functions of the two consumers are, Rs/h, Rs/h, Rs/h. f 1 = 0.002Pd Pd Rs/h, f 2 = 0.001Pd Pd Rs/h. A. Case 1: No Limit Constraints For this system the values of A,, A d and d are calculated using (9), (10), (14) and (15)as A = = 500 = = A d = = d = = 8500 Now, the total demand that can be supplied is obtained using (16) as ( ) ( ) P R = = MW. 2( ) The Market Clearing Price is obtained using (12) or (13) as λ = = Rs/MW Or λ = = Rs/MW 1500 The schedules are then found using (18) and (19)as Pg 1 = = 446.5MW Pg 3 = = MW = MW Pd 1 = =80.2MW Pd 2 = = 660.4MW. Case 2: Maximum Limit on Generator Output In addition to the conditions in case 1, suppose that generator 1 has a maximum limit of 400 MW. Hence, the generation of this unit must be constrained to 400 MW, instead of MW calculated above. In addition, this generation has to be allocated optimally among the customers. Pgx 1 = 400MW. The corresponding λ int is computed (13) using the values of A d and d obtained earlier λ int = = Rs/MW 1500 The allocation of 400 MW among the loads would be corresponding to this λ int of This value turn out to be Pd 1 = = 33.3 MW Pd 2 = = MW The negative value implies the violation of minimum limit for Pd 1. So, the full 400 MW is allocated to Pd 2.Now,the remaining generators (No. 2 and No. 3) and demand bids are to be used in the next stage. However, the incremental cost function of Pd 2 is to be changed to 2α 2 Pd 2 + β 2 to account for the allocation of 400 MW and the modified value of β is obtained as β 2 =2 α 2 Pd 2 + β 2 β 2 = = 5.2 With this procedure for accounting of the allocated component of this demand, the slope of the incremental cost function of Pd 2 does not change, only the constant value changes. So, for further scheduling, only the value of d will change to d (A d will remain the same). d 5 = = 7700 Since, the set of available generators has changed, the values of A and (9,10) are to be recalculated and the new values are A = = = = From the new set, the demand that can be supplied is found out as ( ) ( ) P Rn = = MW 2( ) The new system λ being λ = = Rs/MW The individual shares of the loads and generations are calculated using (18,19) and the schedules are = MW 216

4 Pg 3 = = MW Pd 1 = =66.25 MW Pd 2 = = MW The final schedules for the three generators are 400.0, and MW respectively. The values for the two final demands are and MW (i.e.400mw+232.5mw) respectively. The Market Clearing Price is Rs/MW. Since the generator with a lower cost has been constrained at its maximum limit, the total demand supplied reduces from a possible MW level to MW while the clearing price shows a rise from to Rs/MW. It is not difficult to see that the solution obtained by this method satisfies the Kuhn Tucker conditions also. The optimal incremental cost for the total system is Rs/MW where as the incremental cost of the generator constrained at its maximum limit is λ 1 = = 4.4 Rs/MW C. Case 3: Maximum Limit on Load Consider that the schedule is as in case 1, and suppose that, in addition, there is a maximum limit on the load at node 2 (specified) of 600MW. This implies a constraint violation. Hence, first this load (600MW) is to be optimally allocated between generators. An intermediate value of λ for allocating this 600MW among the generators is found using (12) as λ int = 2 Prn+ A = and the corresponding allocation are Pg 1 = = MW = MW = Rs/MW Pg 3 = = MW Now, the incremental cost functions of the generators have to be modified to reflect this allocation. The slope a i of all the generators remain unchanged, and it is easy to see that b i of all the generators must be now taken as Now for the next stage of optimisation, the value of need to be calculated again and is denoted as. = = Now, the demand has to be met is of consumer 1. The new values of A d and d corresponding to this situation are A d = = 500 d = = 2500 The additional demand that can be met is P R ( ) ( ) = = MW 2( ) This turns out to be the demand of consumer 1 Pd 1 = MW. The new clearing price is obtained using (16) as λ = = Rs/MW 500 Or λ = = Rs/MW 500 The contribution of the three generators towards this additional load are Pg 1 =73.61MW 14.72MW Pg 3 =22.08MW Hence, the final schedules for the three generators are ( ), ( ) and ( ) MW respectively. The two demands are and MW. The Market Clearing Price is Rs/MW. Here since the demand with a higher valuation is constrained at the maximum limit, the total demand met gets reduced from MW to MW while the clearing price decreases from to Rs/MW. D. Case 4: Maximum Limits on oth Generators and Consumer Loads Here, we consider both the constraints to be operative simultaneously. The generation 1 has a maximum limit of 400 MW and the maximum demand of consumer 2 is 600 MW. From the optimal schedule of case 1 it is seen that both limits are violated. So Pg 1 is fixed at 400 MW and Pd 2 is fixed at 600 MW. The difference of these two values is 200 MW of demand. This demand is optimally distributed among the two generators not set at their limits as follows. The intermediate value of λ is obtained using values of A and already calculated in (Case 2) as and respectively. λ int = 2 Pr A = =3.55Rs/MW and the corresponding allocation to the two generators are =70MW Pg 3 = = 130MW The incremental cost function of the two generators now have to be modified such that they have the same value of b i equal to 3.55 with their a i values remaining unchanged. So, the value of is calculated again as = =

5 Now, the demand that is to be met is only that of consumer 1. Hence, the new value of A d and d are A d = 500 d = 2500 Hence, the additional load that can be met is P R ( ) ( ) = = MW 2( ) Therefore, the demand of consumer 1 is also MW. Pd 1 = MW. The new clearing price is λ = = Rs/MW Or λ = = Rs/MW 500 The contribution of the two generators towards this load is =36.25 MW Pg 3 = = MW The final schedules are generations 400.0, and MW respectively. The final demands are and MW. The Market Clearing Price is Rs/MW. E. Case 5: Mixed Load - (No Limit violation) This example is provided to illustrate the method when the system has both fixed loads and price sensitive loads. The 30 bus system is used for this illustration. The bids and offers details of the 30 bus system used here is given Tab. I. There are loads which do not submit offer function implying that they are ready to accept power at any cost. In this system the total fixed demand by those consumers is 75.4 MW. TALE I THE IDS OF 30 US SYSTEM Gen No. a i b i Dem No. α i β i The value of A for the set of supply bids is and is The corresponding values for demand bids are A d is 300 and d is In the first step, the fixed demand is allocated to the generators. Considering all the six available generators share the demand, the value of λ int is first calculated λ int = 2 Pr + A = =2.928Rs/MW It is clear that for three generators, 13, 23 and 27 their b i value is greater than this λ int and hence their output is set to zero. The values of A and are then recalculated with three generators only. The new values are A = and = 216. λ int = 2 Pr + A = =2.9787Rs/MW This value of λ int is still lesser than the b i of the generators at 13, 23 and 27 and their output has been correctly allocated to be zero. Using this λ int we get, Pg 1 = MW Pg 2 = MW Pg 22 = MW The incremental cost function of these three generators now have to be modified such that they have the same value of b i as with their a i values remaining unchanged. So, the value of is calculated again as = = The total demand of the nodes with price dependent loads is then determined by (16) P R = ( ) ( ) 2( ) The new clearing price is found by (17) λ =3.862Rs/MW = MW. The individual share of generations and loads are then found from the clearing price by substituting in (18,19) TALE II THE SCHEDULES OTAINED FOR 30 US SYSTEM Gen No. Pg i Pg i Pg final i Dem No. Pd i Gen Var.Dem F. Case 6: Mixed Load with Limit Violation Consider the system as in case 5, and suppose that in addition there is a maximum limit of 50 MW on the demand of consumer 2, Pd max 2 =50MW. The steps of Case 5 are repeated until its last stage, where it is seen that the load assigned to consumer 2 is greater than its maximum value. Hence the demand of consumer 1 is fixedto50mw,pd 2 = 50MW.Afterthefixed demand allocation, this demand is allocated. So the values of A and are taken considering all six generators ( and respectively). Now, this demand is distributed optimally among the generators as demonstrated earlier. The intermediate λ considering all six 218

6 generators, for this load of 50 MW turned out to be Rs/MW. λ int = 2 Pr + A = =3.394Rs/MW The schedules of generators are Pg 1 = MW, Pg 2 = MW Pg 22 =3.3224MW, Pg 27 =8.6403MW Pg 23 =7.88MW, Pg 13 =7.88MW The next step of scheduling requires the modified cost function for all the generators. The value of b i of all generators is now The values of A,, A d and d for the new set of available demands and generators and with the modified cost functions are , , -250 and The value of λ obtained is Rs/MW and the additional demand is MW. There is no additional constraint violation and so the schedule is final. The generations and demands met are λ =3.8499Rs/MW, Pg 1 =46.288MW, Pg 22 = MW, Pg 23 =17.000MW, Pd 2 =50.00MW, P R = 199.1MW MW Pg 27 = MW Pg 13 =17.000MW Pd 7 =13.725MW REFERENCES [1] S. Stoft, Power System Economics: Designing Markets For Electricity. IEEE Press:John Wiley and Sons, [2] M. Ilic, F. Galiana, and L. Fink, Power System Restructuring: Engineering and Economics. Dordrecht: Kluwer, [3] F. A. Wolak and R. H. Patrick, The impact of market rules and market structure on the price determination process in the england & wales electricity market, University California Energy Institute,erkeley,POWER Reports, Tech. Rep. PWP-047, April [4] PJM, PJM Interconnection, PJM Manual 11 : Scheduling Operations, Revision January 31, [5] R. D. Christie,. F. Woolenberg, and I. Wangensteen, Transmission management in the deregulated environment, Proceedings of the IEEE, vol. 88, no. 2, pp , February [6] N. Fabra, N. H. von der Fehr, and D. Harbord, Modelling electricity auctions, The Electricity Journal, Elsevier Science Inc., pp , August/September [7] Y. S. C. Yuen, Experience in day-ahead market price forecasting, in 6th lnternarional Conference on Adrances in Power System Control, Operation and Management, APSCOM 2003, Hong Kong, November 2003, pp [8] E. Ni and P.. Luh, Experience in day-ahead market price forecasting, in IEEE Power Engineering Society Winter Meeting, vol. 3, January/February 2001, pp [9] F. J. Nogales, J. Contreras, A. J. Conejo, and R. Espinola, Forecasting next-day electricity prices by time series models, IEEE Transactions on Power Systems, vol. 17, no. 2, pp , May [10] C.-Y. Hsiao and Y.-Y. Hong, Locational marginal price forecasting in deregulated electricity markets using artificial intelligence, IEE Proceedings- Generation,Transmission & Distribution, vol. 149, no. 5, pp , September [11] P. S. N. Rao, Direct method of determining optimum generation schedules, Institution of Engineers (India) Journal- Electrical, vol. 67, pp , June Pd 8 = MW, Pd 12 =8.7525MW Pd 21 = MW, Pd 30 =3.7525MW. The demand with high valuation is limited in quantity and hence the system incremental price reduces as compared with the previous case. In this case, the fixed demand can be considered as a block bid with infinite offer. The offer can have a format of specified quantity of power at a specified price also. However, in such a case, the fixed demand will be supplied only when the system incremental cost is same as the offer price of the demand (not the first demand to be supplied as done in this case). IV. CONCLUDING REMARKS A method of determining the Market Clearing Price and the schedules based on the bids submitted by the consumers and generators has been proposed in this paper. The bids are assumed to be quadratic functions of real power instead of the stepped bids currently in use. A close form solution (formula) for determining the system λ based on bids has been developed. It is shown that this formula can be used in a systematic way when limits on the generation/loads have to be accounted. The algorithm is simple and give the global optimal solution for this problem. The method can be used to find the market schedules when network constraints need not be considered; such results are also useful in assessing the impact of network constraints on the market schedules and prices. 219