Parallel implementation of the unit commitment problem on NOWs

Author

Lau, K.K. ; Kumar, M.J.

Author_Institution

Dept. of Comput. Sci., Curtin Univ. of Technol., Perth, WA, Australia

fYear

1997

fDate

28 Apr-2 May 1997

Firstpage

128

Lastpage

133

Abstract

This paper proposes the application of parallelization techniques for solving the unit commitment problem (UCP) on NOWs (networks of workstations). A modified parallel dynamic programming method that takes advantage of NOWs is presented. Our algorithm performs better than the general parallel dynamic programming algorithm for UCP. In order to demonstrate the usefulness of our technique, we apply our parallel programs in some case studies. Studies reveal that our parallel dynamic programming algorithm has the potential to enhance the dynamic control of unit commitment in real time situations

Keywords

dynamic programming; load dispatching; load distribution; local area networks; parallel algorithms; power engineering computing; real-time systems; case studies; dynamic control; networks of workstations; parallel algorithm; parallel dynamic programming method; parallel implementation; parallelization techniques; power systems; real time; unit commitment problem; Costs; Dynamic programming; Fuels; Heuristic algorithms; Load forecasting; Power generation; Power system dynamics; Power systems; Thermal loading; Workstations;

fLanguage

English

Publisher

ieee

Conference_Titel

High Performance Computing on the Information Superhighway, 1997. HPC Asia '97

Conference_Location

Seoul

Print_ISBN

0-8186-7901-8

Type

conf

DOI

10.1109/HPC.1997.592135

Filename

592135