Security-constrained optimal generation scheduling for GENCOs

This paper presents an approach for maximizing a GENCO's profit in a constrained power market. The proposed approach considers the Interior Point Method (IPM) and Benders decomposition for solving the security-constrained optimal generation scheduling (SC-GS) problem. The master problem represents the economic dispatch problem for a GENCO which intends to optimize its profit. The formulation of the master problem does not bear any transmission network constraints. The subproblem will be used by the same GENCO to check the viability of its proposed bidding strategy in the presence of transmission network constraints. In this case if the subproblem does not yield a certain level of financial return for the GENCO or if the subproblem results in an infeasible solution of the GENCO's proposed bidding strategy, the GENCO will modify its proposed solution according to the Benders cuts that stem out of the subproblem. The study shows a more flexible scheduling paradigm for a GENCO in a competitive arena. The proposed approach proves practical for modeling the impact of transmission congestion on a GENCO's expected profit in a competitive environment.

[1]  M. Aganagic,et al.  A practical resource scheduling with OPF constraints , 1995 .

[2]  Mohammad Shahidehpour,et al.  Maintenance Scheduling in Restructured Power Systems , 2000 .

[3]  Zuyi Li,et al.  Market Operations in Electric Power Systems : Forecasting, Scheduling, and Risk Management , 2002 .

[4]  Mohammad Shahidehpour,et al.  Market operations in electric power systems , 2002 .

[5]  I Deeb,et al.  Decomposition Approach For Minimising Real Power Losses in Power Systems(Continued) , 1991 .

[6]  S. M. Shahidehpour,et al.  Short-term generation scheduling with transmission and environmental constraints using an augmented Lagrangian relaxation , 1995 .

[7]  E. Rezania.  Calculation of Transfer Capability of Power Systems Using an Efficient Predictor-Corrector Primal-Dual Interior-Point Algorithm , 1999 .

[8]  S. Granville.  Optimal reactive dispatch through interior point methods , 1994 .

[9]  Jacek Gondzio,et al.  Multiple centrality corrections in a primal-dual method for linear programming , 1996, Comput. Optim. Appl..

[10]  Francisco D. Galiana,et al.  A survey of the optimal power flow literature , 1991 .

[11]  S. M. Shahidehpour,et al.  Transmission-constrained unit commitment based on Benders decomposition , 1998 .

[12]  Sanjay Mehrotra,et al.  On the Implementation of a Primal-Dual Interior Point Method , 1992, SIAM J. Optim..

[13]  O. Alsac,et al.  Security analysis and optimization , 1987, Proceedings of the IEEE.

[14]  S. M. Shahidehpour,et al.  Cross decomposition for multi-area optimal reactive power planning , 1993 .

[15]  S. M. Shahidehpour,et al.  New approach for dynamic optimal power flow using Benders decomposition in a deregulated power market , 2003 .

[16]  S. M. Shahidehpour,et al.  Decomposition approach to unit commitment with reactive constraints , 1997 .

[17]  A. Monticelli,et al.  Security-Constrained Optimal Power Flow with Post-Contingency Corrective Rescheduling , 1987, IEEE Transactions on Power Systems.

[18]  A. M. Geoffrion.  Generalized Benders decomposition , 1972 .

[19]  K. A. Clements,et al.  Stochastic OPF via Bender's method , 2001, 2001 IEEE Porto Power Tech Proceedings (Cat. No.01EX502).

[20]  Antonio J. Conejo,et al.  Multiperiod optimal power flow using Benders decomposition , 2000 .

[21]  Narendra Karmarkar,et al.  A new polynomial-time algorithm for linear programming , 1984, Comb..

[22]  S. M. Shahidehpour,et al.  Linear programming applications to power system economics, planning and operations , 1992 .