scholarly journals WIDE-RANGING VICINITY ALGORITHM FOR SOLVING OPTIMAL REACTIVE POWER PROBLEM

2017 ◽  
Vol 5 (10) ◽  
pp. 361-368
Author(s):  
K. Lenin
Keyword(s):  
Power Loss ◽  
Reactive Power ◽  
Search Space ◽  
Global Search ◽  
The Other ◽  
Superior Performance ◽  
Real Power ◽  
Optimal Value ◽  
Simulation Results ◽  
Power Problem

In this paper, Wide-ranging vicinity Algorithm (WVA) is proposed to solve optimal reactive power problem. Wide-ranging vicinity Algorithm equally improves the local & global search. From the global search space a set of arbitrary solutions are primarily generated and then the most excellent solution will give the optimal value. After that, the algorithm will iterate, & there will be two sets of generated solutions in iteration’s, one from the global search space, the other from the set of solutions & it will be produced from the vicinity of the most excellent solution. The proposed Wide-ranging vicinity Algorithm (WVA) has been tested on standard IEEE 118 & practical 191 bus test systems and simulation results show clearly the superior performance of the proposed Wide-ranging vicinity Algorithm (WVA) in reducing the real power loss & voltage profiles are within the limits.

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.

scholarly journals ENHANCED MINE BLAST ALGORITHM FOR SOLVING REACTIVE POWER PROBLEM

2017 ◽  
Vol 5 (9) ◽  
pp. 206-216
Author(s):  
K. Lenin
Keyword(s):  
Power Loss ◽  
Reactive Power ◽  
Convergence Speed ◽  
Superior Performance ◽  
Real Power ◽  
The Real ◽  
Test Systems ◽  
Simulation Results ◽  
Bomb Explosion ◽  
Power Problem

In this paper Enhanced Mine Blast (EMB) algorithm which based on mine bomb explosion concept is proposed to solve optimal reactive power problem.The clue of the projected Enhanced Mine Blast (EMB) algorithm is based on the examination of a mine bomb explosion, in which the thrown pieces of shrapnel crash with other mine bombs near the explosion area resulting in their explosion. In this paper convergence speed has been enhanced. Proposed Enhanced Mine Blast (EMB) algorithm has been tested in standard IEEE 118 & practical 191 bus test systems and simulation results show clearly the superior performance of the projected Enhanced Mine Blast (EMB) algorithm in reducing the real power loss.

scholarly journals REAL POWER LOSS REDUCTION ENHANCED ARTIFICIAL BEE COLONY ALGORITHM

2018 ◽  
Vol 6 (3) ◽  
pp. 203-213
Author(s):  
K. Lenin
Keyword(s):  
Power Loss ◽  
Artificial Bee Colony ◽  
Reactive Power ◽  
Search Space ◽  
Loss Reduction ◽  
Real Power ◽  
Bee Colony ◽  
Power Loss Reduction ◽  
Simulation Results ◽  
Power Problem

In this paper, Enhanced Artificial Bee Colony (EABC) algorithm is proposed for solving optimal reactive power problem. The projected method assimilates crossover operation from Genetic Algorithm (GA) with artificial bee colony (ABC) algorithm. The EABC strengthens the exploitation phase of ABC as crossover enhances exploration of search space.  Projected EABC algorithm has been tested on has been tested on standard IEEE 118 & practical 191 bus test systems and simulation results show clearly about the premium performance of the proposed algorithm in reducing the real power loss.

scholarly journals Power loss reduction by gryllidae optimization algorithm

2020 ◽  
Vol 9 (3) ◽  
pp. 179
Author(s):  
Kanagasabai Lenin
Keyword(s):  
Optimization Algorithm ◽  
Power Loss ◽  
Reactive Power ◽  
The Other ◽  
Loss Reduction ◽  
Real Power ◽  
Test Systems ◽  
Power Loss Reduction ◽  
Simulation Results ◽  
Power Problem

<p><span lang="EN-US">This paper projects Gryllidae Optimization Algorithm (GOA) has been applied to solve optimal reactive power problem. Proposed GOA approach is based on the chirping characteristics of Gryllidae. In common, male Gryllidae chirp, on the other hand some female Gryllidae also do as well. Male Gryllidae draw the females by this sound which they produce. Moreover, they caution the other Gryllidae against dangers with this sound. The hearing organs of the Gryllidae are housed in an expansion of their forelegs. Through this, they bias to the produced fluttering sounds. Proposed Gryllidae Optimization Algorithm (GOA) has been tested in standard IEEE 14, 30 bus test systems and simulation results show that the projected algorithms reduced the real power loss considerably.</span></p>

Factual Power Loss Diminution by Enhanced Frog Leaping Algorithm

2020 ◽  
Vol 3 (2) ◽  
pp. 114-118
Author(s):  
Kanagasabai Lenin
Keyword(s):  
Local Search ◽  
Power Loss ◽  
Reactive Power ◽  
Test System ◽  
Premature Convergence ◽  
Speed Of Convergence ◽  
Real Power ◽  
The Real ◽  
Simulation Results ◽  
Power Problem

This paper proposes Enhanced Frog Leaping Algorithm (EFLA) to solve the optimal reactive power problem. Frog leaping algorithm (FLA) replicates the procedure of frogs passing though the wetland and foraging deeds. Set of virtual frogs alienated into numerous groups known as “memeplexes”. Frog’s position’s turn out to be closer in every memeplex after few optimization runs and certainly, this crisis direct to premature convergence. In the proposed Enhanced Frog Leaping Algorithm (EFLA) the most excellent frog information is used to augment the local search in each memeplex and initiate to the exploration bound acceleration. To advance the speed of convergence two acceleration factors are introduced in the exploration plan formulation. Proposed Enhanced Frog Leaping Algorithm (EFLA) has been tested in standard IEEE 14,300 bus test system and simulation results show the projected algorithm reduced the real power loss considerably.

scholarly journals ENHANCED SPIDER ALGORITHM FOR MINIMIZATION OF REAL POWER LOSS

2018 ◽  
Vol 6 (4) ◽  
pp. 301-311
Author(s):  
K. Lenin
Keyword(s):  
Power Loss ◽  
Reactive Power ◽  
High Quality ◽  
Quality Performance ◽  
Real Power ◽  
Social Spiders ◽  
The Real ◽  
Spider Web ◽  
Simulation Results ◽  
Power Problem

In this paper Enhanced Spider (ES) algorithm is proposed to solve reactive power Problem. Enthused by the spiders, a new Enhanced Spider (ES) algorithm is utilized to solve reactive power problem. The composition is primarily based on the foraging approach of social spiders, which make use of of the vibrations spread over the spider web to choose the position of prey. The simulation results demonstrate high-quality performance of Enhanced Spider (ES) algorithm in solving reactive power problem.  The projected Enhanced Spider (ES) algorithm has been tested in standard IEEE 57,118 bus systems and compared to other reported standard algorithms. Results show that Enhanced Spider (ES) algorithm is more efficient than other algorithms in reducing the real power loss.

scholarly journals Shrinkage of Real Power Loss by Enriched Brain Storm Optimization Algorithm

2019 ◽  
Vol 8 (1) ◽  
pp. 1
Author(s):  
Lenin Kanagasabai
Keyword(s):  
Optimization Algorithm ◽  
Power Loss ◽  
Reactive Power ◽  
Human Being ◽  
New Approach ◽  
Real Power ◽  
Brain Storm Optimization ◽  
Course Of Action ◽  
Simulation Results ◽  
Power Problem

<p class="Author">This paper proposes Enriched Brain Storm Optimization (EBSO) algorithm is used for soving reactive power problem. Human being are the most intellectual creature in this world. Unsurprisingly, optimization algorithm stimulated by human being inspired problem solving procedure should be advanced than the optimization algorithms enthused by collective deeds of ants, bee, etc. In this paper, we commence a new Enriched brain storm optimization algorithm, which was enthused by the human brainstorming course of action. In the projected Enriched Brain Storm Optimization (EBSO) algorithm, the vibrant clustering strategy is used to perk up the k-means clustering process. The most important view of the vibrant clustering strategy is that; regularly execute the k-means clustering after a definite number of generations, so that the swapping of information wrap all ideas in the clusters to accomplish suitable searching capability. This new approach leads to wonderful results with little computational efforts. In order to evaluate the efficiency of the proposed Enriched Brain Storm Optimization (EBSO) algorithm, has been tested standard IEEE 118 &amp; practical 191 bus test systems and compared to other standard reported algorithms. Simulation results show that Enriched Brain Storm Optimization (EBSO) algorithm is superior to other algorithms in reducing the real power loss.</p>

scholarly journals Real power loss diminution by predestination of particles wavering search algorithm

2020 ◽  
Vol 9 (2) ◽  
pp. 92
Author(s):  
Kanagasabai Lenin
Keyword(s):  
Power Loss ◽  
Reactive Power ◽  
Search Algorithm ◽  
Optimal Solution ◽  
Real Power ◽  
Gradient Based ◽  
Local Optimal Solution ◽  
Simulation Results ◽  
Power Problem ◽  
Steady Velocity

In this work Predestination of Particles Wavering Search (PPS) algorithm has been applied to solve optimal reactive power problem. PPS algorithm has been modeled based on the motion of the particles in the exploration space. Normally the movement of the particle is based on gradient and swarming motion.  Particles are permitted to progress in steady velocity in gradient-based progress, but when the outcome is poor when compared to previous upshot, immediately particle rapidity will be upturned with semi of the magnitude and it will help to reach local optimal solution and it is expressed as wavering movement. In standard IEEE 14, 30, 57,118,300 bus systems Proposed Predestination of Particles Wavering Search (PPS) algorithm is evaluated and simulation results show the PPS reduced the power loss efficiently.

scholarly journals REDUCTION OF TRUE POWER LOSS BY IMPROVED ALGORITHM

2018 ◽  
Vol 6 (8) ◽  
pp. 105-113
Author(s):  
K. Lenin
Keyword(s):  
Optimization Algorithm ◽  
Power Loss ◽  
Reactive Power ◽  
Test System ◽  
New Approach ◽  
Real Power ◽  
Brain Storm Optimization ◽  
Course Of Action ◽  
Simulation Results ◽  
Power Problem

This paper proposes Improved Brain Storm Optimization (IBSO) algorithm is used for solving reactive power problem. predictably, optimization algorithm stimulated by human being inspired problem-solving procedure should be highly developed than the optimization algorithms enthused by collective deeds of ants, bee, etc. In this paper, a new Improved brain storm optimization algorithm defined, which was stimulated by the human brainstorming course of action. In the projected Improved Brain Storm Optimization (IBSO) algorithm, the vibrant clustering strategy is used to perk up the k-means clustering process & exchange of information wrap all ideas in the clusters to accomplish suitable searching capability. This new approach leads to wonderful results with little computational efforts. In order to evaluate the efficiency of the proposed Improved Brain Storm Optimization (IBSO) algorithm, has been tested standard IEEE 30 bus test system and compared to other standard reported algorithms. Simulation results show that Improved Brain Storm Optimization (IBSO) algorithm is superior to other algorithms in reducing the real power loss.

scholarly journals Real power loss reduction by dolphin swarm algorithm

2019 ◽  
Vol 8 (4) ◽  
pp. 285
Author(s):  
Kanagasabai Lenin
Keyword(s):  
Power Loss ◽  
Reactive Power ◽  
Test System ◽  
Loss Reduction ◽  
Real Power ◽  
Power Loss Reduction ◽  
Spinner Dolphin ◽  
Simulation Results ◽  
Swarm Algorithm ◽  
Power Problem

<p>In this work Spinner Dolphin Swarm Algorithm (SDSA) has been applied to solve the optimal reactive power problem. Dolphins have numerous remarkable natural distinctiveness and living behavior such as echolocation, information interactions, collaboration, and partition of labor. Merging these natural distinctiveness and living behavior with swarm intelligence has been modeled to solve the reactive power problem. Proposed Spinner Dolphin Swarm Algorithm (SDSA) has been tested in standard IEEE 14,300 bus test system and simulation results show the projected algorithm reduced the real power loss extensively.</p>

Sign in / Sign up

Export Citation Format

Share Document