scholarly journals Enhanced Particle Swarm Optimization Based Local Search for Reactive Power Compensation Problem

2012 ◽  
Vol 03 (10) ◽  
pp. 1276-1284 ◽  
Author(s):  
Abd Allah A. Mousa ◽  
Mohamed A. El-Shorbagy
2012 ◽  
Vol 229-231 ◽  
pp. 1030-1033
Author(s):  
Wei Cui ◽  
Lin Chuan Li ◽  
Lei Zhang ◽  
Qian Sun

The reactive power compensation optimization in distribution network has the important meaning in maintaining system voltage stability, decreasing network loss and reducing operation costs. In order to meet factual conditions, we assume the system operates in minimum, normal and maximum three load modes and the objective function of problem includes the costs of power loss and the dynamic reactive power compensation devices allocated. In this paper we use Artificial Immune Algorithm(AIA) and Particle Swarm Optimization Algorithm(PSO) to determine compensate nodes and use the back/forward sweep algorithm calculate load flows. After applied into 28-nodes system, the result demonstrates the method is feasible and effective.


Energies ◽  
2020 ◽  
Vol 13 (11) ◽  
pp. 2862 ◽  
Author(s):  
Mini Vishnu ◽  
Sunil Kumar T. K.

Well-structured reactive power policies and dispatch are major concerns of operation and control technicians of any power system. Obtaining a suitable reactive power dispatch for any given load condition of the system is a prime duty of the system operator. It reduces loss of active power occurring during transmission by regulating reactive power control variables, thus boosting the voltage profile, enhancing the system security and power transfer capability, thereby attaining an improvement in overall system operation. The reactive power dispatch (RPD) problem being a mixed-integer discrete continuous (MIDC) problem demands the solution to contain all these variable types. This paper proposes a methodology to achieve an optimal and practically feasible solution to the RPD problem through the diversity-enhanced particle swarm optimization (DEPSO) technique. The suggested method is characterized by the calculation of the diversity of each particle from its mean position after every iteration. The movement of the particles is decided based on the calculated diversity, thereby preventing both local optima stagnation and haphazard unguided wandering. DEPSO accounts for the accuracy of the variables used in the RPD problem by providing discrete values and integer values compared to other algorithms, which provide all continuous values. The competency of the proposed method is tested on IEEE 14-, 30-, and 118-bus test systems. Simulation outcomes show that the proposed approach is feasible and efficient in attaining minimum active power losses and minimum voltage deviation from the reference. The results are compared to conventional particle swarm optimization (PSO) and JAYA algorithms.


Sign in / Sign up

Export Citation Format

Share Document