File Download
  Links for fulltext
     (May Require Subscription)

Conference Paper: Distributed algorithms for optimal power flow problem

TitleDistributed algorithms for optimal power flow problem
Authors
Issue Date2012
PublisherInstitute 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?
AbstractOptimal 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 Identifierhttp://hdl.handle.net/10722/219693
ISSN

 

DC FieldValueLanguage
dc.contributor.authorLam, AYS-
dc.contributor.authorZhang, B-
dc.contributor.authorTse, DN-
dc.date.accessioned2015-09-23T02:57:44Z-
dc.date.available2015-09-23T02:57:44Z-
dc.date.issued2012-
dc.identifier.citationThe 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.issn0191-2216-
dc.identifier.urihttp://hdl.handle.net/10722/219693-
dc.description.abstractOptimal 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.languageeng-
dc.publisherInstitute 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.ispartofIEEE Conference on Decision and Control Proceedings-
dc.rightsIEEE Conference on Decision and Control Proceedings. Copyright © Institute of Electrical and Electronics Engineers.-
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.rightsCreative Commons: Attribution 3.0 Hong Kong License-
dc.titleDistributed algorithms for optimal power flow problem-
dc.typeConference_Paper-
dc.identifier.emailLam, AYS: ayslam@eee.hku.hk-
dc.identifier.authorityLam, AYS=rp02083-
dc.description.naturepostprint-
dc.identifier.doi10.1109/CDC.2012.6427082-
dc.identifier.scopuseid_2-s2.0-84874268576-
dc.identifier.hkuros261764-
dc.identifier.spage430-
dc.identifier.epage437-
dc.publisher.placeUnited States-
dc.customcontrol.immutablesml 160909 - merged-

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats