Congestion and Price Prediction under Load Variation
In market-based planning and operation, it is very useful to have the information of generation dispatch, congestion, and price as load increases. Therefore, it is beneficial to system planners if the congestion or locational marginal pricing (LMP) versus load is readily available. This can certainly be obtained by repetitively running an optimization model at different load levels. However, this approach is too brute-force to be practical. In this paper, an efficient algorithm is proposed to identify the new binding constraint and the new marginal unit set when the system load increases from the present load level. It addresses the challenge of step changes in generation dispatch when a generation or transmission limit becomes binding. The algorithm also gives the new sensitivity of the new marginal units. Therefore, the generation dispatch, congested lines, and LMP at a new critical load level (CLL) can be easily calculated. Test results are presented in matrix formulation to clearly demonstrate and verify the proposed algorithm. Since the proposed approach is based on linearized model, it should be particularly suitable for short-term planning or operation, although application to long-term planning is also possible.
F. Li and R. Bo, "Congestion and Price Prediction under Load Variation," IEEE Transactions on Power Systems, vol. 24, no. 2, pp. 911-922, Institute of Electrical and Electronics Engineers (IEEE), Apr 2009.
The definitive version is available at https://doi.org/10.1109/TPWRS.2009.2016599
Electrical and Computer Engineering
Keywords and Phrases
Congestion Management; Critical Load Level (CLL); Energy Markets; Generation Sensitivity; Locational Marginal Pricing (LMP); Optimal Power Flow (OPF); Power Markets; Acoustic Generators; Binding Energy; Commerce; Costs; Electric Load Flow; Optimization; Power Electronics; Loads (forces)
International Standard Serial Number (ISSN)
Article - Journal
© 2009 Institute of Electrical and Electronics Engineers (IEEE), All rights reserved.