A Parallel HAD-Textured Algorithm for Constrained Economic Dispatch Control Problems

Garng Morton Huang, S. C. Hsieh

Research output: Contribution to journalArticle

2 Citations (Scopus)

Abstract

In our earlier papers [1]—[3], 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 [4]-[7] 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.

Original languageEnglish
Pages (from-to)1553-1558
Number of pages6
JournalIEEE Transactions on Power Systems
Volume10
Issue number3
DOIs
Publication statusPublished - 1 Jan 1995
Externally publishedYes

Fingerprint

Agglomeration
Economics
Parallel algorithms
Decomposition

Keywords

  • Cal aggregation-disaggregation
  • Constrained economic dispatch control
  • Hierarchi
  • Lel algorithm
  • Paral
  • Textured decomposition

ASJC Scopus subject areas

  • Energy Engineering and Power Technology
  • Electrical and Electronic Engineering

Cite this

A Parallel HAD-Textured Algorithm for Constrained Economic Dispatch Control Problems. / Huang, Garng Morton; Hsieh, S. C.

In: IEEE Transactions on Power Systems, Vol. 10, No. 3, 01.01.1995, p. 1553-1558.

Research output: Contribution to journalArticle

@article{4dd6f4637e2a48e0a4795108ea137554,
title = "A Parallel HAD-Textured Algorithm for Constrained Economic Dispatch Control Problems",
abstract = "In our earlier papers [1]—[3], 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 [4]-[7] 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 = "Cal aggregation-disaggregation, Constrained economic dispatch control, Hierarchi, Lel algorithm, Paral, Textured decomposition",
author = "Huang, {Garng Morton} and Hsieh, {S. C.}",
year = "1995",
month = "1",
day = "1",
doi = "10.1109/59.466489",
language = "English",
volume = "10",
pages = "1553--1558",
journal = "IEEE Transactions on Power Systems",
issn = "0885-8950",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "3",

}

TY - JOUR

T1 - A Parallel HAD-Textured Algorithm for Constrained Economic Dispatch Control Problems

AU - Huang, Garng Morton

AU - Hsieh, S. C.

PY - 1995/1/1

Y1 - 1995/1/1

N2 - In our earlier papers [1]—[3], 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 [4]-[7] 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.

AB - In our earlier papers [1]—[3], 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 [4]-[7] 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.

KW - Cal aggregation-disaggregation

KW - Constrained economic dispatch control

KW - Hierarchi

KW - Lel algorithm

KW - Paral

KW - Textured decomposition

UR - http://www.scopus.com/inward/record.url?scp=0029354759&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0029354759&partnerID=8YFLogxK

U2 - 10.1109/59.466489

DO - 10.1109/59.466489

M3 - Article

VL - 10

SP - 1553

EP - 1558

JO - IEEE Transactions on Power Systems

JF - IEEE Transactions on Power Systems

SN - 0885-8950

IS - 3

ER -