Implementation of the unit commitment problem on supercomputers

Author

Misra, N. ; Baghzouz, Y.

Author_Institution

Dept. of Electr. & Comput. Eng., Nevada Univ., Las Vegas, NV, USA

Volume

9

Issue

1

fYear

1994

fDate

2/1/1994 12:00:00 AM

Firstpage

305

Lastpage

310

Abstract

This paper proposes the application of vectorization and parallelization techniques for solving the unit commitment problem on supercomputers. A modified dynamic programming method which takes full advantage of the vector processors present in a supercomputer is presented. Parallel processing is used to further speedup the computation time. Computer simulation of a 26-unit power system is performed on a CRAY Y-MP2/216 in both scalar and vector codes. The computation time results for the conventional dynamic programming algorithm and modified algorithm are compared to demonstrate the effectiveness of the proposed method

Keywords

Cray computers; digital simulation; dynamic programming; load dispatching; load distribution; parallel processing; power system analysis computing; CRAY Y-MP2/216; algorithm; computation time; computer simulation; dynamic programming; parallel processing; parallelization; power system; supercomputers; unit commitment; vector processors; vectorization; Application software; Computer simulation; Concurrent computing; Dynamic programming; Heuristic algorithms; Parallel processing; Power system dynamics; Power system simulation; Supercomputers; Vector processors;

fLanguage

English

Journal_Title

Power Systems, IEEE Transactions on

Publisher

ieee

ISSN

0885-8950

Type

jour

DOI

10.1109/59.317597

Filename

317597