Efficient constraint handling for optimal reactive power dispatch problems

Rammohan Mallipeddi

doi:10.1016/j.swevo.2012.03.001

Return

Efficient constraint handling for optimal reactive power dispatch problems

2012-08-01

102

PRE

Rammohan Mallipeddi *

S. Jeyadevi

Ponnuthurai Nagaratnam Suganthan

S. Baskar

DOI：10.1016/j.swevo.2012.03.001

Original

Original request for help

Save

Abstract

En 中文

In power power engineering, minimizing the power loss in the transmission lines and/or minimizing the voltage deviation at the load buses by controlling the reactive power is referred to as optimal reactive power dispatch (ORPD). Recently, the use of evolutionary algorithms (EAs) such as differential evolution (DE), particle swarm optimization (PSO), evolutionary programming (EP), and evolution strategies (ES) to solve ORPD is gaining more importance due to their effectiveness in handling the inequality constraints and discrete values compared to that of conventional gradient-based methods. EAs generally perform unconstrained searches, and they require some additional mechanism to handle constraints. In the literature, various constraint handling techniques have been proposed. However, to solve ORPD the penalty function approach has been commonly used, while the other constraint handling methods remain untested. In this paper, we evaluate the performance of different constraint handling methods such as superiority of feasible solutions (SF), self-adaptive penalty (SP), E-constraint (EC), stochastic ranking (SR), and the ensemble of constraint handling techniques (ECHT) on ORPD. The proposed methods have been tested on IEEE 30-bus, 57-bus, and 118-bus systems. Simulation results clearly demonstrate the importance of employing an efficient constraint handling method to solve the ORPD problem effectively. (C) 2012 Elsevier B.V. All rights reserved.

Keywords:

Differential evolution

Constraint handling

Optimal reactive power dispatch

Ensemble