Solving multi-contingency transient stability constrained optimal power flow problems with an improved GA

K. Y. Chan; S. H. Ling; Ka Wing Chan; H. H C Iu; G. T Y Pong

doi:10.1109/CEC.2007.4424840

Solving multi-contingency transient stability constrained optimal power flow problems with an improved GA

K. Y. Chan, S. H. Ling, Ka Wing Chan, H. H C Iu, G. T Y Pong

Research output: Chapter in book / Conference proceeding › Conference article published in proceeding or book › Academic research › peer-review

21 Citations (Scopus)

Abstract

In this paper, an improved genetic algorithm has been proposed for solving multi-contingency transient stability constrained optimal power flow (MC-TSCOPF) problems. The MC-TSCOPF problem is formulated as an extended optimal power flow (OPF) with additional generator rotor angle constraints and is converted into an unconstrained optimization problem, which is suitable for genetic algorithms to deal with, using a penalty function. The improved genetic algorithm is proposed by incorporating an orthogonal design in exploring solution spaces. A case study indicates that the improved genetic algorithm outperforms the existing genetic algorithm-based method in terms of robustness of solutions and the convergence speed while the solution quality can be kept.

Original language	English
Title of host publication	2007 IEEE Congress on Evolutionary Computation, CEC 2007
Pages	2901-2908
Number of pages	8
DOIs	https://doi.org/10.1109/CEC.2007.4424840
Publication status	Published - 1 Dec 2007
Event	2007 IEEE Congress on Evolutionary Computation, CEC 2007 - , Singapore Duration: 25 Sep 2007 → 28 Sep 2007

Conference

Conference	2007 IEEE Congress on Evolutionary Computation, CEC 2007
Country/Territory	Singapore
Period	25/09/07 → 28/09/07

ASJC Scopus subject areas

Artificial Intelligence
Software
Theoretical Computer Science

More information

10.1109/CEC.2007.4424840

Cite this

@inproceedings{024039da1793464b971d353cc89d01bd,

title = "Solving multi-contingency transient stability constrained optimal power flow problems with an improved GA",

abstract = "In this paper, an improved genetic algorithm has been proposed for solving multi-contingency transient stability constrained optimal power flow (MC-TSCOPF) problems. The MC-TSCOPF problem is formulated as an extended optimal power flow (OPF) with additional generator rotor angle constraints and is converted into an unconstrained optimization problem, which is suitable for genetic algorithms to deal with, using a penalty function. The improved genetic algorithm is proposed by incorporating an orthogonal design in exploring solution spaces. A case study indicates that the improved genetic algorithm outperforms the existing genetic algorithm-based method in terms of robustness of solutions and the convergence speed while the solution quality can be kept.",

author = "Chan, {K. Y.} and Ling, {S. H.} and Chan, {Ka Wing} and Iu, {H. H C} and Pong, {G. T Y}",

year = "2007",

month = dec,

day = "1",

doi = "10.1109/CEC.2007.4424840",

language = "English",

isbn = "1424413400",

pages = "2901--2908",

booktitle = "2007 IEEE Congress on Evolutionary Computation, CEC 2007",

note = "2007 IEEE Congress on Evolutionary Computation, CEC 2007 ; Conference date: 25-09-2007 Through 28-09-2007",

}

Solving multi-contingency transient stability constrained optimal power flow problems with an improved GA. / Chan, K. Y.; Ling, S. H.; Chan, Ka Wing; Iu, H. H C; Pong, G. T Y.

2007 IEEE Congress on Evolutionary Computation, CEC 2007. 2007. p. 2901-2908 4424840.

Research output: Chapter in book / Conference proceeding › Conference article published in proceeding or book › Academic research › peer-review

TY - GEN

T1 - Solving multi-contingency transient stability constrained optimal power flow problems with an improved GA

AU - Chan, K. Y.

AU - Ling, S. H.

AU - Chan, Ka Wing

AU - Iu, H. H C

AU - Pong, G. T Y

PY - 2007/12/1

Y1 - 2007/12/1

N2 - In this paper, an improved genetic algorithm has been proposed for solving multi-contingency transient stability constrained optimal power flow (MC-TSCOPF) problems. The MC-TSCOPF problem is formulated as an extended optimal power flow (OPF) with additional generator rotor angle constraints and is converted into an unconstrained optimization problem, which is suitable for genetic algorithms to deal with, using a penalty function. The improved genetic algorithm is proposed by incorporating an orthogonal design in exploring solution spaces. A case study indicates that the improved genetic algorithm outperforms the existing genetic algorithm-based method in terms of robustness of solutions and the convergence speed while the solution quality can be kept.

AB - In this paper, an improved genetic algorithm has been proposed for solving multi-contingency transient stability constrained optimal power flow (MC-TSCOPF) problems. The MC-TSCOPF problem is formulated as an extended optimal power flow (OPF) with additional generator rotor angle constraints and is converted into an unconstrained optimization problem, which is suitable for genetic algorithms to deal with, using a penalty function. The improved genetic algorithm is proposed by incorporating an orthogonal design in exploring solution spaces. A case study indicates that the improved genetic algorithm outperforms the existing genetic algorithm-based method in terms of robustness of solutions and the convergence speed while the solution quality can be kept.

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

U2 - 10.1109/CEC.2007.4424840

DO - 10.1109/CEC.2007.4424840

M3 - Conference article published in proceeding or book

SN - 1424413400

SN - 9781424413409

SP - 2901

EP - 2908

BT - 2007 IEEE Congress on Evolutionary Computation, CEC 2007

T2 - 2007 IEEE Congress on Evolutionary Computation, CEC 2007

Y2 - 25 September 2007 through 28 September 2007

ER -

Solving multi-contingency transient stability constrained optimal power flow problems with an improved GA

Abstract

Conference

ASJC Scopus subject areas

More information

Other files and links

Cite this