Robustness Assessment of Distributed Optimal Power Flow Under Communication Non-Idealities

Abstract

In recent years, distributed optimal power flow (OPF) algorithms have found applications to distribution system operations. These algorithms decompose the system into small areas, each solving a local optimization problem and periodically sharing boundary variable values with neighbors. Unlike centralized approaches, the performance of distributed algorithms is significantly affected by non-ideal communication conditions. This article assesses the performance of a fast distributed algorithm, named Equivalent Network Approximation method (ENApp), for three-phase radial distribution system under four different non-ideal communication scenarios, erroneous data transfer, packet loss, additive noise effect, and communication delays. First, the paper proposes ENApp-based distributed OPF algorithms for normal and stressed main grid conditions. Communication non-idealities are considering the physical aspects of two widely used wide-area network mediums, viz. power line communication and optical fiber. The performance is evaluated using the IEEE 123 bus test system in a cyber-physical co-simulation environment based on the Hierarchical Engine for Large-scale Infrastructure Co-Simulation (HELICS), providing insights into ENApp's robustness in terms of convergence time and success rate. © 1972-2012 IEEE.