Abstract
In this paper, the chaotic bat algorithm (CBA) is applied to solve the optimal reactive power dispatch (ORPD) problem taking into account small-scale, medium-scale and large-scale power systems. ORPD plays a key role in the power system operation and control. The ORPD problem is formulated as a mixed integer nonlinear programming problem, comprising both continuous and discrete control variables. The most outstanding benefit of the bat algorithm (BA) is its good convergence for optimal solutions. The BA, however, together with other metaheuristics, often gets stuck into local optima and in order to cope with this shortcoming, the use of the CBA is proposed in this paper. The CBA results from introducing the chaotic sequences into the standard BA to enhance its global search ability. The CBA is utilized to find the optimal settings of generator bus voltages, tap setting transformers and shunt reactive power sources. Three objective functions such as minimization of active power loss, total voltage deviations and voltage stability index are considered in this study. The effectiveness of the CBA technique is demonstrated for standard IEEE 14-bus, IEEE 39 New England bus, IEEE 57-bus, IEEE 118-bus and IEEE 300-bus test systems. The results yielded by the CBA are compared with other algorithms available in the literature. Simulation results reveal the effectiveness and robustness of the CBA for solving the ORPD problem.
Highlights
In 1962, Carpentier introduced for the first time the optimal power flow (OPF) problem [1] and later on it was developed by Dommel and Tinney [2]
The rest of the paper is organized as follows: Section II presents the mathematical formulation of the optimal reactive power dispatch (ORPD) problem, the chaotic bat algorithm (CBA) algorithm is described in Section III, the implementation of the CBA algorithm on the ORPD problem is described in Section IV, Section V presents the simulation results along with the discussions, and Section VI draws the conclusion of this paper
In order to verify the performance and effectiveness of the CBA algorithm for ORPD problem, the standard bat algorithm (BA) and two different variants of CBA namely CBA-III and CBA-IV have been tested on standard IEEE 14-bus, IEEE 39 New England bus, IEEE 57-bus, IEEE 118-bus and IEEE 300-bus test systems for the minimization of the active power loss, total voltage deviations and voltage stability index objective functions
Summary
In 1962, Carpentier introduced for the first time the optimal power flow (OPF) problem [1] and later on it was developed by Dommel and Tinney [2]. Extensive efforts have been undertaken to solve the ORPD problem using many classical optimization techniques including quadratic programming [7]–[10], mixed integer programming [11], interior point method [12]–[14], Newton-based method [15], linear programming [16], [17], non-linear programming [18], dynamic programming [19], gradient-based algorithm [20], decomposition approach [21] etc Despite their excellent convergence characteristics, these classical optimization techniques fail to find the global solution due to their non-convexity characteristics. The rest of the paper is organized as follows: Section II presents the mathematical formulation of the ORPD problem, the CBA algorithm is described in Section III, the implementation of the CBA algorithm on the ORPD problem is described in Section IV, Section V presents the simulation results along with the discussions, and Section VI draws the conclusion of this paper
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
