A Stochastic Model for Self-scheduling Problem

The unit commitment (UC) problem is a typical application of optimization techniques in the power generation and operation. Given a planning horizon, the UC problem is to find an optimal schedule of generating units, including on/off status and production level of each generating unit at each time period, in order to minimize operational costs, subject to a series of technical constraints. Because technical constraints depend on the characteristics of energy systems, the formulations of the UC problem vary with energy systems. The self-scheduling problem is a variant of the UC problem for the power generating companies to maximize their profits in a deregulated energy market. The deterministic self-scheduling UC problem is known to be polynomial-time solvable using dynamic programming. In this thesis, a stochastic model for the self-scheduling UC problem is presented and an efficient dynamic programming algorithm for the deterministic model is extended to solve the stochastic model. Solutions are compared to those obtained by traditional mixed integer programming method, in terms of the solution time and solution quality. Computational results show that the extended algorithm can obtain an optimal solution faster than Gurobi mixed-integer quadratic solver when solving a stochastic self-scheduling UC problem with a large number of scenarios. Furthermore, the results of a simulation experiment show that solutions based on a large number of scenarios can generate more average revenue or less average loss