Experiments with hybrid Bernstein global optimization algorithm for the OPF problem in power systems. Issue 8 (3rd August 2019)

• Record Type: Journal Article
• Authors: Patil, Bhagyesh V.; Sampath, L.P.M.I.; Krishnan, Ashok; Maciejowski, J. M.; Ling, K. V.; Gooi, H. B.
• Is Part Of: Engineering optimization. Volume 51:Issue 8(2019)
• Page Start: 1446
• Page End: 1461
• Publication Date: 2019-08-03
• Subjects: Bernstein polynomials -- global optimization -- power system -- optimal power flow -- non-convex problem; Engineering design -- Periodicals; Mathematical optimization -- Periodicals; 620.0042
• DOI: 10.1080/0305215X.2018.1521399
• Languages: English
• ISSNs: 0305-215X

Abstract

ABSTRACT: This article 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 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 efficacy in terms of the chosen performance metrics. Furthermore, the proposed algorithm is tested on 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 hybrid Bernstein global optimization algorithm delivers satisfactory performance in terms of solution optimality.