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.

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 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 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 Two bio-inspired algorithms for solving optimal reactive power problem

2020 ◽  
Vol 9 (3) ◽  
pp. 180
Author(s):  
Lenin Kanagasabai
Keyword(s):  
Sperm Motility ◽  
Optimization Algorithm ◽  
Power Loss ◽  
Reactive Power ◽  
Spontaneous Movement ◽  
Real Power ◽  
The Real ◽  
Test Systems ◽  
Power Problem

<span>In this work two ground-breaking algorithms called; Sperm Motility (SM) algorithm &amp; Wolf Optimization (WO) algorithm is used for solving reactive power problem. In sperm motility approach spontaneous movement of the sperm is imitated &amp; species chemo attractant, sperms are enthralled in the direction of the ovum. In wolf optimization algorithm the deeds of wolf is imitated in the formulation &amp; it has a flag vector also length is equivalent to the whole sum of numbers in the dataset the optimization. Both the projected algorithms have been tested in standard IEEE 57,118, 300 bus test systems. Simulated outcomes reveal about the reduction of real power loss &amp; with variables are in the standard limits. Almost both algorithms solved the problem efficiently, yet wolf optimization has slight edge over the sperm motility algorithm in reducing the real power loss.</span>

scholarly journals REDUCTION OF REAL POWER LOSS BY LAVA HERON OPTIMIZATION ALGORITHM

2017 ◽  
Vol 5 (8) ◽  
pp. 85-93
Author(s):  
K. Lenin
Keyword(s):  
Optimization Algorithm ◽  
Power Loss ◽  
Reactive Power ◽  
Saline Water ◽  
Real Power ◽  
The Real ◽  
Simulation Results ◽  
Power Problem

This paper presents a new Lava Heron Optimization (LHO) Algorithm for solving reactive power problem. This algorithm is inspired by the grab skill of the Lava Heron bird. Lava heron bird live in on the freshwater or saline water, swampy marshes or wetlands with tuft of trees mostly in low lying areas, where there are abundant convenience of fishes as their prey. By using the prey catching skill of the Lava Heron bird algorithm has been framed and utilized to minimize the real power loss. Proposed Lava Heron Optimization (LHO) Algorithm has been tested in standard IEEE 57,118 bus systems and simulation results demonstrate the commendable performance of the projected Lava Heron Optimization (LHO) Algorithm in reducing the real power loss.

Propagation Algorithm for Solving Optimal Reactive Power Problem

2016 ◽  
Vol 24 ◽  
pp. 103-111
Author(s):  
K. Lenin ◽  
B. Ravindhranath Reddy ◽  
M. Suryakalavathi
Keyword(s):  
Optimization Algorithm ◽  
Power Loss ◽  
Reactive Power ◽  
Natural Phenomenon ◽  
Heuristic Optimization ◽  
Real Power ◽  
Test Systems ◽  
Propagation Algorithm ◽  
Simulation Results ◽  
Power Problem

This paper presents a nature inspired heuristic optimization algorithm based on lightning progression called the propagation algorithm (PA) to solve optimal reactive power problem. It is from the imitated natural phenomenon of lightning and the procedure of step frontrunner propagation using the theory of fast particles. Three particle kinds are established to distinguish the transition particles that produce the first step frontrunner population, the space particles that attempt to turn out to be the frontrunner, and the prime particle that epitomize the particle thrilled from best positioned step frontrunner. The proposed PA has been tested in standard IEEE 30,57,118 bus test systems and simulation results show clearly about the better performance of the proposed algorithm in reducing the real power loss with control variables within the limits.

scholarly journals REDUCTION OF ACTIVE POWER LOSS BY IMPROVED FROG LEAPING ALGORITHM

2017 ◽  
Vol 5 (9) ◽  
pp. 44-51
Author(s):  
K. Lenin
Keyword(s):  
Particle Swarm Optimization ◽  
Local Search ◽  
Power Loss ◽  
Reactive Power ◽  
Active Power ◽  
Swarm Optimization ◽  
Real Power ◽  
The Real ◽  
Simulation Results ◽  
Power Problem

This paper presents Improved Frog Leaping (IFL) algorithm for solving optimal reactive power problem.  Comprehensive exploration capability of Particle Swarm Optimization (PSO) and   good local search ability of Frog Leaping Algorithm (FLA) has been hybridized to solve the reactive power problem and it overcomes the shortcomings of premature convergence. In order to evaluate the validity of the proposed Improved Frog Leaping (IFL) algorithm, it has been tested in Standard IEEE 57,118 bus systems and compared to other standard algorithms. Simulation results show that proposed Improved Frog Leaping (IFL) algorithm has reduced the real power loss considerably and voltage profiles are within the limits.

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 Tailored Flower Pollination (TFP) Algorithm for Diminution of Real Power Loss

2019 ◽  
Vol 8 (2) ◽  
pp. 94
Author(s):  
Dr.Lenin Kanagasabai
Keyword(s):  
Chaos Theory ◽  
Power Loss ◽  
Reactive Power ◽  
Flower Pollination Algorithm ◽  
Real Power ◽  
Flower Pollination ◽  
Test Systems ◽  
Shuffled Frog Leaping ◽  
Simulation Results ◽  
Power Problem

In this paper, Tailored Flower Pollination (TFP) algorithm is proposed to solve the optimal reactive power problem. Comprising of the elements of chaos theory, Shuffled frog leaping search and Levy Flight, the performance of the flower pollination algorithm has been improved. Proposed TFP algorithm has been tested in standard IEEE 118 &amp; practical 191 bus test systems and simulation results show clearly the better performance of the proposed algorithm in reducing the real power loss.

scholarly journals MINIMIZATION OF REAL POWER LOSS BY ENHANCED GREAT DELUGE ALGORITHM

2017 ◽  
Vol 5 (8) ◽  
pp. 207-216
Author(s):  
K. Lenin
Keyword(s):  
General Solution ◽  
Power Loss ◽  
Reactive Power ◽  
Selection Strategy ◽  
Real Power ◽  
The Real ◽  
Test Systems ◽  
Great Deluge Algorithm ◽  
Power Problem

This paper presents Enhanced Great Deluge Algorithm (EDA) for solving reactive power problem. Alike other local exploration methods, this Enhanced Great Deluge Algorithm (EDA) also swap general solution (fresh_Config) with most excellent results (most excellent_Config) that have been found by then. This deed prolong until stop conditions is offered. In this algorithm, new solutions are selected from neighbours. Selection strategy is different from other approaches. In order to evaluate validity of the proposed Enhanced Great Deluge Algorithm (EDA) algorithm, it has been tested on standard IEEE 118 & practical 191 bus test systems and compared to other standard reported algorithms. Results show that Enhanced Great Deluge Algorithm (EDA) reduces the real power loss and voltage profiles are within the limits.

Sign in / Sign up

Export Citation Format

Share Document