Branch-and-bound scheduling for thermal generating units

Author

Chen, Chem-Lin ; Wang, Shun-Chung

Author_Institution

Dept. of Electr. Eng., Nat. Taiwan Univ., Taipei, Taiwan

Volume

8

Issue

2

fYear

1993

fDate

6/1/1993 12:00:00 AM

Firstpage

184

Lastpage

189

Abstract

A branch-and-bound method for scheduling thermal generating units is presented. The decision variables are the start and stop times and the generation levels of the units. A simple rule is defined to compute the lower bound of each candidate schedule for interim computation usage, and the branching process takes place on the subschedule with the lowest lower bound. The heap data storage structure and space saving encoded data representations for partially fulfilled unit commitment schedules are utilized to facilitate the branch-and-bound procedure. By successive branching and bounding, the unit commitment schedule with the minimum cost can be obtained. Two examples, a 10 unit, 24 h and a 20 unit, 36 h case, are shown to illustrate the effectiveness of the proposed algorithm

Keywords

load dispatching; load distribution; power station control; power station load; scheduling; thermal power stations; 24 h; 36 h; algorithm; bounding; branch-and-bound method; branching process; cost; heap data storage structure; load dispatching; load distribution; power station control; scheduling; short times; space saving encoded data representations; stop times; thermal power stations; unit commitment; Costs; Data structures; Dynamic programming; Fuel economy; Lagrangian functions; Power generation; Power generation economics; Processor scheduling; Production; Scheduling algorithm;

fLanguage

English

Journal_Title

Energy Conversion, IEEE Transactions on

Publisher

ieee

ISSN

0885-8969

Type

jour

DOI

10.1109/60.222703

Filename

222703