scholarly journals Solving optimal reactive power problem by improved variable mesh optimization algorithm

Author(s):  
Kanagasabai Lenin

<p>In this work Improved Variable Mesh Optimization Algorithm (IVM) has been applied to solve the optimal reactive power problem. Projected Improved VMO algorithm has been modeled by hybridization of Variable mesh optimization algorithm with Clearing-Based Niche Formation Technique, Differential Evolution (DE) algorithm. Mesh formation and exploration has been enhanced by the hybridization. Amongst of niche development process, clearing is a renowned method in which general denominator is the formation of steady subpopulations (niches) at all local optima (peaks) in the exploration space. In Differential Evolution (DE) population is formed by common sampling within the stipulated smallest amount and maximum bounds. Subsequently DE travel into the iteration process where the progressions like, mutation, crossover, and selection, are followed. Proposed Improved Variable Mesh Optimization Algorithm (IVM) has been tested in standard IEEE 14,300 bus test system and simulation<br />results show the projected algorithm reduced the real power loss extensively.</p>

2017 ◽  
Vol 5 (3) ◽  
pp. 243-251
Author(s):  
K. Lenin

In this paper, we propose a new Unified Algorithm (UA) by combination of Variable mesh optimization algorithm (VMO) with Differential Evolution (DE) for solving reactive power problem. VMO has mainly three search operators, one for global exploration and two for local optima exploitation. DE is a simple yet commanding evolutionary algorithm for solving optimization problems. In all iteration VMO serve as the initial population of DE and obtains a population of more quality with this population VMO begins a new cycle.  The proposed UA has been tested in standard IEEE 30 bus test system 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.


2015 ◽  
Vol 2015 ◽  
pp. 1-16 ◽  
Author(s):  
Lijin Wang ◽  
Yiwen Zhong ◽  
Yilong Yin ◽  
Wenting Zhao ◽  
Binqing Wang ◽  
...  

The backtracking search optimization algorithm (BSA) is a new nature-inspired method which possesses a memory to take advantage of experiences gained from previous generation to guide the population to the global optimum. BSA is capable of solving multimodal problems, but it slowly converges and poorly exploits solution. The differential evolution (DE) algorithm is a robust evolutionary algorithm and has a fast convergence speed in the case of exploitive mutation strategies that utilize the information of the best solution found so far. In this paper, we propose a hybrid backtracking search optimization algorithm with differential evolution, called HBD. In HBD, DE with exploitive strategy is used to accelerate the convergence by optimizing one worse individual according to its probability at each iteration process. A suit of 28 benchmark functions are employed to verify the performance of HBD, and the results show the improvement in effectiveness and efficiency of hybridization of BSA and DE.


2018 ◽  
Vol 6 (8) ◽  
pp. 105-113
Author(s):  
K. Lenin

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.


Author(s):  
Kanagasabai Lenin ◽  
Bhumanapally Ravindhranath Reddy ◽  
Munagala Surya Kalavathi

In this paper a Progressive particle swarm optimization algorithm (PPS) is used to solve optimal reactive power problem. A Particle Swarm Optimization algorithm maintains a swarm of particles, where each particle has position vector and velocity vector which represents the potential solutions of the particles. These vectors are modernized from the information of global best (Gbest) and personal best (Pbest) of the swarm. All particles move in the search space to obtain optimal solution. In this paper a new concept is introduced of calculating the velocity of the particles with the help of Euclidian Distance conception. This new-fangled perception helps in finding whether the particle is closer to Pbest or Gbest and updates the velocity equation consequently. By this we plan to perk up the performance in terms of the optimal solution within a rational number of generations. The projected PPS has been tested on standard IEEE 30 bus test system and simulation results show clearly the better performance of the proposed algorithm in reducing the real power loss with control variables are within the limits.


Author(s):  
Kanagasabai Lenin

<div data-canvas-width="397.2735184438622">This paper proposes enhanced fruit fly optimization algorithm (EFF) and status of material algorithm (SMA) to solve the optimal reactive power problem. Fruit fly optimization algorithm is based on the food finding behavior of the fruit fly. There are two steps in food finding procedure of fruit fly: At first it smells the food source by means of osphresis organ and it flies in that direction; afterwards, when it gets closer to the food site, through its sensitive vision it will find the food. At the beginning of the run by diminishing the inertia weight from a large value to a small value, will lead to enhance the global search capability and more local search ability will be in process the end of the run of the EFF algorithm. Then SMA is projected to solve the problem. Three state of material are solid, liquid, and gas. For evolution procedure direction vector operator assign a direction to every molecule consecutively to guide the particle progression. Collision operator imitates the collisions factor in which molecules are interacting to each other. Proposed enhanced EFF, SMA has been tested in standard IEEE 30 bus test system and simulation results show the projected algorithms reduced the real power loss considerably.</div>


2018 ◽  
Vol 6 (11) ◽  
pp. 323-329
Author(s):  
K. Lenin

In this paper wolf optimization algorithm (WOA) has been applied for solving reactive power problem. In order to enhance the search procedure the basic qualities of particle swarm optimization has been intermingled to improve the capability of the search to reach a global solution. Efficiency of the projected wolf optimization algorithm (WOA) is tested in standard IEEE 30 bus test system. Simulation study indicates wolf optimization algorithm (WOA) performs well in tumbling the actual power losses& particularly voltage stability has been enriched.


Author(s):  
Kanagasabai Lenin

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.


2018 ◽  
Vol 6 (5) ◽  
pp. 149-156
Author(s):  
K. Lenin

In this paper, Synthesized Algorithm (SA) proposed to solve the optimal reactive power problem. Proposed Synthesized Algorithm (SA) is a combination of three well known evolutionary algorithms, namely Differential Evolution (DE) algorithm, Particle Swarm Optimization (PSO) algorithm, and Harmony Search (HS) algorithm. It merges the general operators of each algorithm recursively. This achieves both good exploration and exploitation in SA without altering their individual properties. In order to evaluate the performance of the proposed SA, it has been tested in Standard IEEE 57,118 bus systems and compared to other standard reported algorithms. Simulation results show’s that Synthesized Algorithm (SA) successfully reduces the real power loss and voltage profiles are within the limits.


2018 ◽  
Vol 6 (6) ◽  
pp. 346-356
Author(s):  
K. Lenin

This paper projects Volition Particle Swarm Optimization (VP) algorithm for solving optimal reactive power problem. Particle Swarm Optimization algorithm (PSO) has been hybridized with the Fish School Search (FSS) algorithm to improve the capability of the algorithm. FSS presents an operator, called as collective volition operator, which is capable to auto-regulate the exploration-exploitation trade-off during the algorithm execution. Since the PSO algorithm converges faster than FSS but cannot auto-adapt the granularity of the search, we believe the FSS volition operator can be applied to the PSO in order to mitigate this PSO weakness and improve the performance of the PSO for dynamic optimization problems. In order to evaluate the efficiency of the proposed Volition Particle Swarm Optimization (VP) algorithm, it has been tested in standard IEEE 30 bus test system and compared to other reported standard algorithms.  Simulation results show that Volition Particle Swarm Optimization (VP) algorithm is more efficient then other algorithms in reducing the real power losses with control variables are within the limits.


2018 ◽  
Vol 6 (11) ◽  
pp. 355-365
Author(s):  
K. Lenin

In this paper optimal reactive power dispatch problem (ORPD), has been solved by Enriched Red Wolf Optimization (ERWO) algorithm. Projected ERWO algorithm hybridizes the wolf optimization (WO) algorithm with swarm based algorithm called as particle swarm optimization (PSO) algorithm. In the approach each Red wolf has a flag vector, and length is equivalent to the whole sum of numbers which features in the dataset of the wolf optimization (WO). Exploration capability of the projected Red wolf optimization algorithm has been enriched by hybridization of both WO with PSO. Efficiency of the projected Enriched Red wolf optimization (ERWO) evaluated in standard IEEE 30 bus test system. Simulation study indicates Enriched Red wolf optimization (ERWO) algorithm performs well in tumbling the actual power losses& particularly voltage stability has been enriched.


Sign in / Sign up

Export Citation Format

Share Document