Reactive Power Planning Based on Fuzzy Clustering, Gray Code, and Simulated Annealing

2011 ◽  
Vol 26 (4) ◽  
pp. 2246-2255 ◽  
Author(s):  
Yurong Wang ◽  
Fangxing Li ◽  
Qiulan Wan ◽  
Hao Chen
Keyword(s):  
Simulated Annealing ◽  
Fuzzy Clustering ◽  
Reactive Power ◽  
Gray Code ◽  
Reactive Power Planning

A novel adequate bi-level reactive power planning strategy

2016 ◽  
Vol 78 ◽  
pp. 897-909 ◽  
Author(s):  
Abdullah M. Shaheen ◽  
Ragab A. El-Sehiemy ◽  
Sobhy M. Farrag
Keyword(s):  
Reactive Power ◽  
Planning Strategy ◽  
Reactive Power Planning

Distribution Network Reactive Power Planning Based on Improved Evolutionary Strategy Theory

2013 ◽  
Vol 732-733 ◽  
pp. 1023-1028
Author(s):  
Si Qing Sheng ◽  
Xing Li ◽  
Yang Lu
Keyword(s):  
Reactive Power ◽  
Distribution Network ◽  
Load Condition ◽  
Optimal Solution ◽  
Evolution Strategy ◽  
Evolutionary Strategy ◽  
Initial Population ◽  
Fitness Value ◽  
Cauchy Mutation ◽  
Reactive Power Planning

In this paper a distribution network reactive power planning mathematical model was established, taking the minimized sum of electrical energy loss at the different load operation modes and the investment for reactive power compensation equipments as objective function to solve the planning question respectively and taking the transformer tap as equality constraint. The evolution strategy is improved, The Euclidean distance is introduced into the formation of the initial population, and the initial population under the max load operation mode is based on the optimal solution of the min load condition. The Cauchy mutation and variation coefficient are introduced into the evolution strategy method. By means of improvement of fitness to ensure diversity of population in early and accuracy of the fitness value.

Optimal long-term reactive power planning using decomposition techniques

1993 ◽  
Vol 26 (1) ◽  
pp. 41-52 ◽  
Author(s):  
Maurice K. Mangoli ◽  
Kwang Y. Lee ◽  
Young Moon Park
Keyword(s):  
Reactive Power ◽  
Decomposition Techniques ◽  
Reactive Power Planning

scholarly journals AMPLIFIED NELDER-MEAD ALGORITHM FOR SOLVING OPTIMAL REACTIVE POWER PROBLEM

2018 ◽  
Vol 6 (11) ◽  
pp. 299-306
Author(s):  
K. Lenin
Keyword(s):  
Simulated Annealing ◽  
Power Loss ◽  
Reactive Power ◽  
Superior Performance ◽  
Real Power ◽  
Last Stage ◽  
Simulation Results ◽  
Power Problem ◽  
Nelder Mead Algorithm ◽  
Prime Solution

This paper presents Hybridization of Simulated Annealing with Nelder-Mead algorithm (SN) is proposed to solve optimal reactive power problem. The proposed Hybridized - Simulated Annealing, Nelder-Mead algorithm starts with a prime solution, which is produced arbitrarily and then the solution is disturbed into partitions. The vicinity zone is created, arbitrary numbers of partitions are selected and variables modernizing procedure is started in order to create a trail of neighbour solutions. This procedure helps the SN algorithm to explore the region around an existing iterate solution. The Nelder- Mead algorithm is used in the last stage in order to progress the most excellent solution found so far and hasten the convergence in the closing stage. The proposed Hybridization of Simulated Annealing with Nelder-Mead algorithm (SN) has been tested in standard IEEE 57,118 bus systems and simulation results show the superior performance of the proposed SN algorithm in reducing the real power loss and voltage profiles are within the limits.

Sign in / Sign up

Export Citation Format

Share Document