Optimal Re-Dispatching of Cascaded Hydropower Plants Using Quadratic Programming and Chance-Constrained Programming

Abstract

Stochastic production from wind power plants imposes additional uncertainty in power system operation. It can cause problems in load and generation balancing in the power system and can also cause congestion in the transmission network. This paper deals with the problems of congestion in the transmission network, which are caused by the production of wind power plants. An optimization model for corrective congestion management is developed. Congestions are relieved by re-dispatching several cascaded hydropower plants. Optimization methodology covers the optimization period of one day divided into the 24 segments for each hour. The developed optimization methodology consists of two optimization stages. The objective of the first optimization stage is to obtain an optimal day-ahead dispatch plan of the hydropower plants that maximizes profit from selling energy to the day-ahead electricity market. If such a dispatch plan, together with the wind power plant production, causes congestion in the transmission network, the second optimization stage is started. The objective of the second optimization stage is the minimization of the re-dispatching of cascaded hydropower plants in order to avoid possible congestion. The concept of chance-constrained programming is used in order to consider uncertain wind power production. The first optimization stage is defined as a mixed-integer linear programming problem and the second optimization stage is defined as a quadratic programming (QP) problem, in combination with chance-constrained programming. The developed optimization model is tested and verified using the model of a real-life power system.