Generation scheduling in large-scale hydrothermal power systems with fuel constrained units
A major problem in the operation of a power system is the determination of an optimal commitment schedule for generating units such that a series of operating constraints would be satisfied simultaneously. Various approaches such as Dynamic Programming, Mixed Integer Programming, Benders Decomposition and Lagrangian Relaxation have been proposed for solving this mixed integer optimization problem. However, available methods are not feasible and/or practical as the size of the system increases. Some methods have trouble in dealing with a combination of fuel constrained, hydro and thermal units. Although recent studies show the potentials of the Lagrangian Relaxation approach in the scheduling of large scale power systems, present methods based on this approach usually show poor performance if the commitment states of generating units in the system are sensitive to changes of Lagrangian multipliers. An algorithm is proposed for scheduling large scale power systems with all three types of generating units. The development of this algorithm is based on the Lagrangian Relaxation approach, which provides a suboptimal solution of the problem. To overcome the sensitivity problem, a set of upper bounds is added to limit the excess in spinning reserves at different periods. A revised economic dispatch routine is incorporated as a postprocessor, which performs the optimal allocation of the system demand among the committed units and refines the suboptimal schedule by modifying the status of unnecessarily committed generating units.
- Research Organization:
- Illinois Inst. of Tech., Chicago, IL (USA)
- OSTI ID:
- 7125378
- Resource Relation:
- Other Information: Thesis (Ph. D.)
- Country of Publication:
- United States
- Language:
- English
Similar Records
Stochastic scheduling of generating units with weekly energy storage: A hybrid decomposition approach
Optimal scheduling of large hydrothermal power systems