Towards a more rigorous and practical unit commitment by Lagrangian relaxation

Author

Zhuang, Fulin ; Galiana, F.D.

Author_Institution

Dept. of Electr. Eng., McGill Univ., Montreal, Que., Canada

Volume

3

Issue

2

fYear

1988

fDate

5/1/1988 12:00:00 AM

Firstpage

763

Lastpage

773

Abstract

A Lagrangian relaxation algorithm for power system generator unit commitment is proposed. The algorithm proceeds in three phases. In the first phase, the Lagrangian dual of the unit commitment is maximized by standard subgradient techniques. The second phase finds a reserve-feasible dual solution, followed by a third phase of economic dispatch. A mathematically based, systematic and generally applicable procedure to search for a reserve-feasible dual solution is presented. The algorithm has been tested on systems of up to 100 units to be scheduled over 168 hours, giving reliable performance and low execution times. Both spinning and time-limited reserve constraints are treated

Keywords

load dispatching; power systems; scheduling; Lagrangian relaxation algorithm; economic dispatch; execution times; generator unit commitment; performance; power systems; reserve constraints; reserve-feasible dual solution; subgradient techniques; Costs; Lagrangian functions; Power generation; Power generation economics; Power system planning; Power system reliability; Scheduling algorithm; Senior members; Spinning; System testing;

fLanguage

English

Journal_Title

Power Systems, IEEE Transactions on

Publisher

ieee

ISSN

0885-8950

Type

jour

DOI

10.1109/59.192933

Filename

192933