Experiments with hybrid Bernstein global optimization algorithm for the OPF problem in power systems

Abstract

This paper presents an algorithm based on the Bernstein form of polynomials for solving the optimal power flow (OPF) problem in electrical power networks. The proposed algorithm combines local and global optimization methods and is therefore referred to as a `hybrid' Bernstein algorithm in the context of this work. The proposed algorithm is a branch-and-bound (B&B) procedure wherein a local search method is used to obtain a good upper bound on the global minimum at each branching node. Subsequently, the Bernstein form of polynomials is used to obtain a lower bound on the global minimum. The performance of the proposed algorithm is compared with the previously reported Bernstein algorithm to demonstrate its effi cacy in terms of the chosen performance metrics. Furthermore, the proposed algorithm is tested by solving the OPF problem for several benchmark IEEE power system examples and its performance is compared with generic global optimization solvers such as BARON and COUENNE. The test results demonstrate that the algorithm HBBB delivers satisfactory performance in terms of solution optimality.