Identifying Multiple Local Optima for Optimal Power Flow Based on Nonlinear Dynamics
An optimal power flow (OPF) problem of power systems can have multiple local optimal solutions, which is worthwhile studying both in theory and practice. Based on the existing nonlinear dynamic systems, this paper proposes an efficient deterministic algorithm to solve multiple or all local optimal s...
| Główni autorzy: | , |
|---|---|
| Format: | Artykuł |
| Język: | English |
| Wydane: |
IEEE
2020-01-01
|
| Seria: | IEEE Access |
| Hasła przedmiotowe: | |
| Dostęp online: | https://ieeexplore.ieee.org/document/9139956/ |
| _version_ | 1829140196056104960 |
|---|---|
| author | Ji'Ang Zhang Zonghang Han |
| author_facet | Ji'Ang Zhang Zonghang Han |
| author_sort | Ji'Ang Zhang |
| collection | DOAJ |
| description | An optimal power flow (OPF) problem of power systems can have multiple local optimal solutions, which is worthwhile studying both in theory and practice. Based on the existing nonlinear dynamic systems, this paper proposes an efficient deterministic algorithm to solve multiple or all local optimal solutions of OPF, which takes some numerical improving measures to enhance the numerical convergence for integration process of dynamics and adapt to OPF problem. The steps of this algorithm are as follows: 1. The reflected gradient system (RGS) is used to calculate the decomposition points to locate different feasible components. 2. The quotient gradient system (QGS) is used to calculate feasible points in different feasible components, and we numerically integrate projected gradient system (PGS) with these feasible points as initial points forward until the trajectories approach the local optima. 3. Slack variable perturbation method (SVPM) is proposed to help escape from the saddle points to the adjacent local optima when the trajectories fall into saddle points. Compared with the interior point method (IPM) with random initialization, multiple IEEE test cases show that the proposed algorithm can identify much more local optimal solutions, and meanwhile, significantly reduce the calculation time. |
| first_indexed | 2024-12-14T19:49:27Z |
| format | Article |
| id | doaj.art-a5aee4abfa3547b3a9a50fbf54eb068c |
| institution | Directory Open Access Journal |
| issn | 2169-3536 |
| language | English |
| last_indexed | 2024-12-14T19:49:27Z |
| publishDate | 2020-01-01 |
| publisher | IEEE |
| record_format | Article |
| series | IEEE Access |
| spelling | doaj.art-a5aee4abfa3547b3a9a50fbf54eb068c2022-12-21T22:49:27ZengIEEEIEEE Access2169-35362020-01-01812987812988810.1109/ACCESS.2020.30092589139956Identifying Multiple Local Optima for Optimal Power Flow Based on Nonlinear DynamicsJi'Ang Zhang0https://orcid.org/0000-0003-1451-729XZonghang Han1https://orcid.org/0000-0001-5473-3734School of Electrical and Information Engineering, Tianjin University, Tianjin, ChinaDepartment of Electrical Engineering, Tsinghua University, Beijing, ChinaAn optimal power flow (OPF) problem of power systems can have multiple local optimal solutions, which is worthwhile studying both in theory and practice. Based on the existing nonlinear dynamic systems, this paper proposes an efficient deterministic algorithm to solve multiple or all local optimal solutions of OPF, which takes some numerical improving measures to enhance the numerical convergence for integration process of dynamics and adapt to OPF problem. The steps of this algorithm are as follows: 1. The reflected gradient system (RGS) is used to calculate the decomposition points to locate different feasible components. 2. The quotient gradient system (QGS) is used to calculate feasible points in different feasible components, and we numerically integrate projected gradient system (PGS) with these feasible points as initial points forward until the trajectories approach the local optima. 3. Slack variable perturbation method (SVPM) is proposed to help escape from the saddle points to the adjacent local optima when the trajectories fall into saddle points. Compared with the interior point method (IPM) with random initialization, multiple IEEE test cases show that the proposed algorithm can identify much more local optimal solutions, and meanwhile, significantly reduce the calculation time.https://ieeexplore.ieee.org/document/9139956/Global optimizationnonlinear dynamicsmultiple solutions for OPFKKT conditions |
| spellingShingle | Ji'Ang Zhang Zonghang Han Identifying Multiple Local Optima for Optimal Power Flow Based on Nonlinear Dynamics IEEE Access Global optimization nonlinear dynamics multiple solutions for OPF KKT conditions |
| title | Identifying Multiple Local Optima for Optimal Power Flow Based on Nonlinear Dynamics |
| title_full | Identifying Multiple Local Optima for Optimal Power Flow Based on Nonlinear Dynamics |
| title_fullStr | Identifying Multiple Local Optima for Optimal Power Flow Based on Nonlinear Dynamics |
| title_full_unstemmed | Identifying Multiple Local Optima for Optimal Power Flow Based on Nonlinear Dynamics |
| title_short | Identifying Multiple Local Optima for Optimal Power Flow Based on Nonlinear Dynamics |
| title_sort | identifying multiple local optima for optimal power flow based on nonlinear dynamics |
| topic | Global optimization nonlinear dynamics multiple solutions for OPF KKT conditions |
| url | https://ieeexplore.ieee.org/document/9139956/ |
| work_keys_str_mv | AT jiangzhang identifyingmultiplelocaloptimaforoptimalpowerflowbasedonnonlineardynamics AT zonghanghan identifyingmultiplelocaloptimaforoptimalpowerflowbasedonnonlineardynamics |