A Simple Two Stage Optimization Algorithm for Constrained Power Economic Dispatch

Research output: Contribution to journalArticle

5 Citations (Scopus)

Abstract

A simple two stage optimization algorithm is proposed and investigated for fast computation of constrained power economic dispatch control problems. The method is a simple demonstration of, the hierarchical aggregation-disaggregation (HAD) concept. The algorithm first solves an agregated: Problem to obtain all initial solution. This aggregated problem turns out to be classical economic dispatch formulation, and it can be solved in 1% of overall computation time. In the second stage linear programming method finds optimal solution which satisfies power balance constraints, generation and transmission inequality constraints and security constraints. Implementation of the algorithm for IEEE systems and EPRI Scenario systems shows that the two stage method obtains average speedup ratio 10.64 as compared to classical LP-Based method.

Original languageEnglish
Pages (from-to)1818-1824
Number of pages7
JournalIEEE Transactions on Power Systems
Volume9
Issue number4
DOIs
Publication statusPublished - 1 Jan 1994
Externally publishedYes

Fingerprint

Economics
Linear programming
Demonstrations
Agglomeration

ASJC Scopus subject areas

  • Energy Engineering and Power Technology
  • Electrical and Electronic Engineering

Cite this

A Simple Two Stage Optimization Algorithm for Constrained Power Economic Dispatch. / Huang, Garng Morton; Song, K.

In: IEEE Transactions on Power Systems, Vol. 9, No. 4, 01.01.1994, p. 1818-1824.

Research output: Contribution to journalArticle

@article{98662400194e474a88036f91be8265f9,
title = "A Simple Two Stage Optimization Algorithm for Constrained Power Economic Dispatch",
abstract = "A simple two stage optimization algorithm is proposed and investigated for fast computation of constrained power economic dispatch control problems. The method is a simple demonstration of, the hierarchical aggregation-disaggregation (HAD) concept. The algorithm first solves an agregated: Problem to obtain all initial solution. This aggregated problem turns out to be classical economic dispatch formulation, and it can be solved in 1{\%} of overall computation time. In the second stage linear programming method finds optimal solution which satisfies power balance constraints, generation and transmission inequality constraints and security constraints. Implementation of the algorithm for IEEE systems and EPRI Scenario systems shows that the two stage method obtains average speedup ratio 10.64 as compared to classical LP-Based method.",
author = "Huang, {Garng Morton} and K. Song",
year = "1994",
month = "1",
day = "1",
doi = "10.1109/59.331436",
language = "English",
volume = "9",
pages = "1818--1824",
journal = "IEEE Transactions on Power Systems",
issn = "0885-8950",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "4",

}

TY - JOUR

T1 - A Simple Two Stage Optimization Algorithm for Constrained Power Economic Dispatch

AU - Huang, Garng Morton

AU - Song, K.

PY - 1994/1/1

Y1 - 1994/1/1

N2 - A simple two stage optimization algorithm is proposed and investigated for fast computation of constrained power economic dispatch control problems. The method is a simple demonstration of, the hierarchical aggregation-disaggregation (HAD) concept. The algorithm first solves an agregated: Problem to obtain all initial solution. This aggregated problem turns out to be classical economic dispatch formulation, and it can be solved in 1% of overall computation time. In the second stage linear programming method finds optimal solution which satisfies power balance constraints, generation and transmission inequality constraints and security constraints. Implementation of the algorithm for IEEE systems and EPRI Scenario systems shows that the two stage method obtains average speedup ratio 10.64 as compared to classical LP-Based method.

AB - A simple two stage optimization algorithm is proposed and investigated for fast computation of constrained power economic dispatch control problems. The method is a simple demonstration of, the hierarchical aggregation-disaggregation (HAD) concept. The algorithm first solves an agregated: Problem to obtain all initial solution. This aggregated problem turns out to be classical economic dispatch formulation, and it can be solved in 1% of overall computation time. In the second stage linear programming method finds optimal solution which satisfies power balance constraints, generation and transmission inequality constraints and security constraints. Implementation of the algorithm for IEEE systems and EPRI Scenario systems shows that the two stage method obtains average speedup ratio 10.64 as compared to classical LP-Based method.

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

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

U2 - 10.1109/59.331436

DO - 10.1109/59.331436

M3 - Article

VL - 9

SP - 1818

EP - 1824

JO - IEEE Transactions on Power Systems

JF - IEEE Transactions on Power Systems

SN - 0885-8950

IS - 4

ER -