File Download
Links for fulltext
(May Require Subscription)
- Publisher Website: 10.1109/CDC.2012.6427082
- Scopus: eid_2-s2.0-84874268576
- Find via
Supplementary
-
Citations:
- Scopus: 0
- Appears in Collections:
Conference Paper: Distributed algorithms for optimal power flow problem
Title | Distributed algorithms for optimal power flow problem |
---|---|
Authors | |
Issue Date | 2012 |
Publisher | Institute of Electrical and Electronics Engineers. The Journal's web site is located at http://www.ieeexplore.ieee.org/xpl/conhome.jsp?punumber=1000188 |
Citation | The 51st IEEE Conference on Decision and Control (CDC 2012), Maui, HI., 10-13 December 2012. In IEEE Conference on Decision and Control Proceedings, 2012, p. 430-437 How to Cite? |
Abstract | Optimal power flow (OPF) is an important problem for power generation and it is in general non-convex. With the employment of renewable energy, it will be desirable if OPF can be solved very efficiently so that its solution can be used in real time. With some special network structure, e.g. trees, the problem has been shown to have a zero duality gap and the convex dual problem yields the optimal solution. In this paper, we propose a primal and a dual algorithm to coordinate the smaller subproblems decomposed from the convexified OPF. We can arrange the subproblems to be solved sequentially and cumulatively in a central node or solved in parallel in distributed nodes. We test the algorithms on IEEE radial distribution test feeders, some random tree-structured networks, and the IEEE transmission system benchmarks. Simulation results show that the computation time can be improved dramatically with our algorithms over the centralized approach of solving the problem without decomposition, especially in tree-structured problems. The computation time grows linearly with the problem size with the cumulative approach while the distributed one can have size-independent computation time. |
Persistent Identifier | http://hdl.handle.net/10722/219693 |
ISSN | 2020 SCImago Journal Rankings: 0.395 |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Lam, AYS | - |
dc.contributor.author | Zhang, B | - |
dc.contributor.author | Tse, DN | - |
dc.date.accessioned | 2015-09-23T02:57:44Z | - |
dc.date.available | 2015-09-23T02:57:44Z | - |
dc.date.issued | 2012 | - |
dc.identifier.citation | The 51st IEEE Conference on Decision and Control (CDC 2012), Maui, HI., 10-13 December 2012. In IEEE Conference on Decision and Control Proceedings, 2012, p. 430-437 | - |
dc.identifier.issn | 0191-2216 | - |
dc.identifier.uri | http://hdl.handle.net/10722/219693 | - |
dc.description.abstract | Optimal power flow (OPF) is an important problem for power generation and it is in general non-convex. With the employment of renewable energy, it will be desirable if OPF can be solved very efficiently so that its solution can be used in real time. With some special network structure, e.g. trees, the problem has been shown to have a zero duality gap and the convex dual problem yields the optimal solution. In this paper, we propose a primal and a dual algorithm to coordinate the smaller subproblems decomposed from the convexified OPF. We can arrange the subproblems to be solved sequentially and cumulatively in a central node or solved in parallel in distributed nodes. We test the algorithms on IEEE radial distribution test feeders, some random tree-structured networks, and the IEEE transmission system benchmarks. Simulation results show that the computation time can be improved dramatically with our algorithms over the centralized approach of solving the problem without decomposition, especially in tree-structured problems. The computation time grows linearly with the problem size with the cumulative approach while the distributed one can have size-independent computation time. | - |
dc.language | eng | - |
dc.publisher | Institute of Electrical and Electronics Engineers. The Journal's web site is located at http://www.ieeexplore.ieee.org/xpl/conhome.jsp?punumber=1000188 | - |
dc.relation.ispartof | IEEE Conference on Decision and Control Proceedings | - |
dc.rights | ©2012 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works. | - |
dc.title | Distributed algorithms for optimal power flow problem | - |
dc.type | Conference_Paper | - |
dc.identifier.email | Lam, AYS: ayslam@eee.hku.hk | - |
dc.identifier.authority | Lam, AYS=rp02083 | - |
dc.description.nature | postprint | - |
dc.identifier.doi | 10.1109/CDC.2012.6427082 | - |
dc.identifier.scopus | eid_2-s2.0-84874268576 | - |
dc.identifier.hkuros | 261764 | - |
dc.identifier.spage | 430 | - |
dc.identifier.epage | 437 | - |
dc.publisher.place | United States | - |
dc.customcontrol.immutable | sml 160909 - merged | - |
dc.identifier.issnl | 0191-2216 | - |