TY - JOUR
AU - Lenin, K.
PY - 2018/06/30
Y2 - 2024/06/23
TI - CROWDING DISTANCE BASED PARTICLE SWARM OPTIMIZATION ALGORITHM FOR SOLVING OPTIMAL REACTIVE POWER DISPATCH PROBLEM
JF - International Journal of Research -GRANTHAALAYAH
JA - Int. J. Res. Granthaalayah
VL - 6
IS - 6
SE - Articles
DO - 10.29121/granthaalayah.v6.i6.2018.1369
UR - https://www.granthaalayahpublication.org/journals/granthaalayah/article/view/IJRG18_A06_1479
SP - 226-237
AB - <p>In this paper, Crowding Distance based Particle Swarm Optimization (CDPSO) algorithm has been proposed to solve the optimal reactive power dispatch problem. Particle Swarm Optimization (PSO) is swarm intelligence-based exploration and optimization algorithm which is used to solve global optimization problems. In PSO, the population is referred as a swarm and the individuals are called particles. Like other evolutionary algorithms, PSO performs searches using a population of individuals that are updated from iteration to iteration. The crowding distance is introduced as the index to judge the distance between the particle and the adjacent particle, and it reflects the congestion degree of no dominated solutions. In the population, the larger the crowding distance, the sparser and more uniform. In the feasible solution space, we uniformly and randomly initialize the particle swarms and select the no dominated solution particles consisting of the elite set. After that by the methods of congestion degree choosing (the congestion degree can make the particles distribution more sparse) and the dynamic e infeasibility dominating the constraints, we remove the no dominated particles in the elite set. Then, the objectives can be approximated. Proposed crowding distance based Particle Swarm Optimization (CDPSO) algorithm has been tested in standard IEEE 30 bus test system and simulation results shows clearly the improved performance of the projected algorithm in reducing the real power loss and static voltage stability margin has been enhanced.</p>
ER -