Essential issues on solving optimal power flow problems using soft-computing
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 issue...
| Main Authors: | , , , |
|---|---|
| Format: | Journal Article |
| Published: |
American Institute of Mathematical Science
2014
|
| Online Access: | http://hdl.handle.net/20.500.11937/23686 |
| _version_ | 1848751218919211008 |
|---|---|
| author | Chan, Kit Yan Yu, Changjun Teo, Kok Lay Nordholm, Sven |
| author_facet | Chan, Kit Yan Yu, Changjun Teo, Kok Lay Nordholm, Sven |
| author_sort | Chan, Kit Yan |
| building | Curtin Institutional Repository |
| collection | Online Access |
| description | 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. |
| first_indexed | 2025-11-14T07:49:14Z |
| format | Journal Article |
| id | curtin-20.500.11937-23686 |
| institution | Curtin University Malaysia |
| institution_category | Local University |
| last_indexed | 2025-11-14T07:49:14Z |
| publishDate | 2014 |
| publisher | American Institute of Mathematical Science |
| recordtype | eprints |
| repository_type | Digital Repository |
| spelling | curtin-20.500.11937-236862017-09-13T16:03:35Z Essential issues on solving optimal power flow problems using soft-computing Chan, Kit Yan Yu, Changjun Teo, Kok Lay Nordholm, Sven 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. 2014 Journal Article http://hdl.handle.net/20.500.11937/23686 10.3934/naco.2014.4.341 American Institute of Mathematical Science fulltext |
| spellingShingle | Chan, Kit Yan Yu, Changjun Teo, Kok Lay Nordholm, Sven Essential issues on solving optimal power flow problems using soft-computing |
| title | Essential issues on solving optimal power flow problems using soft-computing |
| title_full | Essential issues on solving optimal power flow problems using soft-computing |
| title_fullStr | Essential issues on solving optimal power flow problems using soft-computing |
| title_full_unstemmed | Essential issues on solving optimal power flow problems using soft-computing |
| title_short | Essential issues on solving optimal power flow problems using soft-computing |
| title_sort | essential issues on solving optimal power flow problems using soft-computing |
| url | http://hdl.handle.net/20.500.11937/23686 |