Multilevel distributed approach for DC Optimal Power Flow

The interest in distributed control methods for power systems is motivated by the need for scalable solutions to handle the coordination of an increasing number of distributed resources. This paper presents a fully distributed multilevel method to solve the DC Optimal Power Flow problem (DC-OPF). Our proposed approach constitutes a distributed iterative mechanism to solve the first order optimality conditions of the DC-OPF problem using the fact that optimality conditions involve local variable couplings. The proposed distributed structure requires each bus to update a few local variables and exchange information with neighboring buses. Our multilevel distributed approach distributes the computation at several levels, i.e., nodes, subareas and areas. It allows for synchronous information exchanges, i.e., after each iteration, at the nodal level and asynchronous communication, i.e., after multiple iterations, between subareas and areas. To define meaningful subareas, we are using a graph theoretic partitioning method derived from an epidemics model. We compare the performance of the proposed partitioning method over a random partitioning method using the IEEE 118-bus system.

[1]  Jure Leskovec,et al.  Empirical comparison of algorithms for network community detection , 2010, WWW '10.

[2]  G. Andersson,et al.  Decentralized Optimal Power Flow Control for Overlapping Areas in Power Systems , 2009, IEEE Transactions on Power Systems.

[3]  Francisco J. Prieto,et al.  A Decomposition Methodology Applied to the Multi-Area Optimal Power Flow Problem , 2003, Ann. Oper. Res..

[4]  Gabriela Hug,et al.  Distributed State Estimation and Energy Management in Smart Grids: A Consensus${+}$ Innovations Approach , 2014, IEEE Journal of Selected Topics in Signal Processing.

[5]  José M. F. Moura,et al.  Role of subgraphs in epidemics over finite-size networks under the scaled SIS process , 2014, J. Complex Networks.

[6]  Stephen P. Boyd,et al.  Dynamic Network Energy Management via Proximal Message Passing , 2013, Found. Trends Optim..

[7]  Tomaso Erseghe,et al.  Distributed Optimal Power Flow Using ADMM , 2014, IEEE Transactions on Power Systems.

[8]  Satu Elisa Schaeffer,et al.  Graph Clustering , 2017, Encyclopedia of Machine Learning and Data Mining.

[9]  Stephen Boyd,et al.  Security Constrained Optimal Power Flow via proximal message passing , 2014, 2014 Clemson University Power Systems Conference.

[10]  Mo-Yuen Chow,et al.  Convergence Analysis of the Incremental Cost Consensus Algorithm Under Different Communication Network Topologies in a Smart Grid , 2012, IEEE Transactions on Power Systems.

[11]  B. H. Kim,et al.  A comparison of distributed optimal power flow algorithms , 2000 .

[12]  José M. F. Moura,et al.  Diffusion in Social Networks as SIS Epidemics: Beyond Full Mixing and Complete Graphs , 2014, IEEE Journal of Selected Topics in Signal Processing.

[13]  Gabriela Hug,et al.  Impact of partitioning on the performance of decomposition methods for AC Optimal Power Flow , 2015, 2015 IEEE Power & Energy Society Innovative Smart Grid Technologies Conference (ISGT).

[14]  Reza Olfati-Saber,et al.  Consensus and Cooperation in Networked Multi-Agent Systems , 2007, Proceedings of the IEEE.

[15]  Jian-Xin Xu,et al.  Consensus based approach for economic dispatch problem in a smart grid , 2013, IECON 2013 - 39th Annual Conference of the IEEE Industrial Electronics Society.

[16]  Gabriela Hug,et al.  Distributed Approach for DC Optimal Power Flow Calculations , 2014 .

[17]  Charu C. Aggarwal,et al.  Graph Clustering , 2010, Encyclopedia of Machine Learning and Data Mining.