A parallel HAD-textured algorithm for constrained economic dispatch control problems

Author

Huang, G. ; Hsieh, S.-C.

Author_Institution

Dept. of Electr. Eng., Texas A&M Univ., College Station, TX, USA

Volume

10

Issue

3

fYear

1995

fDate

8/1/1995 12:00:00 AM

Firstpage

1553

Lastpage

1558

Abstract

In our earlier papers we developed a parallel textured algorithm to solve the constrained economic dispatch control (CEDC) problems. The exact convergence theorem and its proof were provided to guarantee the convergence of the algorithm to the true solution; and some examples were given to show the impact of exact convergence conditions. In this paper, we incorporate the hierarchical aggregation-disaggregation (HAD) concept and the textured concept to solve the CEDC. The algorithm is then implemented on an nCUBE2 machine and tested on a modified IEEE 14-bus system, a modified IEEE 57-bus system, a 114-bus system, and a 228-bus system. Some test results are given to show the speedup advantage of the proposed algorithm over the one without textured decomposition. Even when the proposed algorithm is executed sequentially, the speedup is still essential

Keywords

economics; load dispatching; parallel algorithms; power system analysis computing; power system control; 114-bus system; 228-bus system; constrained economic dispatch control; hierarchical aggregation-disaggregation concept; modified IEEE 14-bus system; modified IEEE 57-bus system; nCUBE2 machine; parallel HAD-textured algorithm; Costs; Distributed control; Environmental economics; Power generation; Power generation economics; Power system control; Power system modeling; Power system reliability; Power system security; Power systems;

fLanguage

English

Journal_Title

Power Systems, IEEE Transactions on

Publisher

ieee

ISSN

0885-8950

Type

jour

DOI

10.1109/59.466489

Filename

466489