View Item 

Essential issues on solving optimal power flow problems using soft-computing

Access Status
Open access
Authors
Chan, Kit Yan
Yu, Changjun
Teo, Kok Lay
Nordholm, Sven
Date
2014
Type
Journal Article

Metadata
Show full item record
Citation
Chan, K.Y. and Yu, C. and Teo, K.L. and Nordholm, S. 2014. Essential issues on solving optimal power flow problems using soft-computing. Numerical Algebra, Control and Optimization. 4 (4): pp. 341-351.
Source Title
Numerical Algebra, Control and Optimization
DOI
ISSN
School
Department of Electrical and Computer Engineering
Remarks

This is a pre-copy-editing, author-produced PDF of an article accepted for publication in Numerical Algebra, Control and Optimization following peer review. Chan, K.Y. and Yu, C. and Teo, K.L. and Nordholm, S. 2014. Essential issues on solving optimal power flow problems using soft-computing. Numerical Algebra, Control and Optimization. 4 (4): pp. 341-351 is available online at: https://www.aimsciences.org/journals/contentsListnew.jsp?pubID=739

URI
Collection
Abstract

Optimal power ow (OPF) problems are important optimization problems in power systems which aim to minimize the operation cost of generators so that the load demand can be met and the loadings are within the feasible operating regions of the generators. This brief paper emphasizes two essential issues related to solving the OPF problems and which are rarely addressed in recent research into power systems: 1) the necessity to validate operational constraints on OPF, which determine the feasibility of power systems designed for the OPF problems; and 2) and the necessity to developconventional methods for solving OPF problems which can be more effective than the commonly-used heuristic methods.