Conference Paper

Control of Reactive Power Based on Lévy Flight

Authors:
To read the full-text of this research, you can request a copy directly from the authors.

No full-text available

Request Full-text Paper PDF

To read the full-text of this research,
you can request a copy directly from the authors.

ResearchGate has not been able to resolve any citations for this publication.
Article
Full-text available
This paper proposes a simple particle swarm optimization with constriction factor (PSO-CF) method for solving optimal reactive power dispatch (ORPD) problem. The proposed PSO-CF is the conventional particle swarm optimization based on constriction factor which can deal with different objectives of the problem such as minimizing the real power losses, improving the voltage profile, and enhancing the voltage stability and properly handle various constraints for reactive power limits of generators and switchable capacitor banks, bus voltage limits, tap changer limits for transformers, and transmission line limits. The proposed method has been tested on the IEEE 30-bus and IEEE 118-bus systems and the obtained results are compared to those from other PSO variants and other methods in the literature. The result comparison has shown that the proposed method can obtain total power loss, voltage deviation or voltage stability index less than the others for the considered cases. Therefore, the proposed PSO-CF can be favorable solving the ORPD problem.
Article
Full-text available
p>This paper solves an optimal reactive power scheduling problem in the deregulated power system using the evolutionary based Cuckoo Search Algorithm (CSA). Reactive power scheduling is a very important problem in the power system operation, which is a nonlinear and mixed integer programming problem. It optimizes a specific objective function while satisfying all the equality and inequality constraints. In this paper, CSA is used to determine the optimal settings of control variables such as generator voltages, transformer tap positions and the amount of reactive compensation required to optimize the certain objective functions. The CSA algorithm has been developed from the inspiration that the obligate brood parasitism of some Cuckoo species lay their eggs in nests of other host birds which are of other species. The performance of CSA for solving the proposed optimal reactive power scheduling problem is examined on standard Ward Hale 6 bus, IEEE 30 bus, 57 bus, 118 bus and 300 bus test systems. The simulation results show that the proposed approach is more suitable, effective and efficient compared to other optimization techniques presented in the literature.</p
Article
Full-text available
In this paper, a new and powerful algorithm called Flower Pollination Algorithm (FPA) is proposed for optimal allocations and sizing of capacitors in various distribution systems. First the most candidate buses for installing capacitors are suggested using Power Loss Index (PLI). Then the proposed FPA is employed to deduce the size of capacitors and their locations from the elected buses. The objective function is designed to reduce the total cost and consequently to increase the net saving per year. The proposed algorithm is tested on 15, 69 and 118-bus radial distribution systems. The obtained results via the proposed algorithm are compared with other algorithms like Genetic Algorithm (GA), Particle Swarm Optimization (PSO), Plant Growth Simulation Algorithm (PGSA), Direct Search Algorithm (DSA), Teaching Learning-Based Optimization (TLBO), Cuckoo Search Algorithm (CSA), Artificial Bee Colony (ABC) and Harmony Search Algorithm (HSA) to highlight the benefits of the proposed algorithm. Moreover, the results are introduced to verify the effectiveness of the suggested algorithm to minimize the losses and total cost and to enhance the voltage profile and net saving for various distribution systems.
Article
Full-text available
Knapsack problems are one of the classical NP-hard problems and it offers many practical applications in vast field of different areas. Several traditional as well as population based metaheuristic algorithms are applied to solve this problem. In this paper we introduce the binary version of cuckoo search algorithm (CSA) for solving knapsack problems, specially 01 knapsack problem. The proposed algorithm utilizes the balanced combination of local random walk and global explorative random walk. So far CSA is generally applied to continuous optimization problems. In order to investigate the performance of CSA on combinatorial optimization problem, an attempt is made in this paper. To demonstrate the efficiency of the proposed algorithm an extensive computational study is provided with standard benchmark problem instances and comparison with particle swarm optimization is also carried out.
Article
Full-text available
This paper presents an enhanced Particle Swarm Optimization (PSO) algorithm applied to the reactive power compensation (RPC) problem. It is based on the combination of Genetic Algorithm (GA) and PSO. Our approach integrates the merits of both genetic algorithms (GAs) and particle swarm optimization (PSO) and it has two characteristic features. Firstly, the algorithm is initialized by a set of a random particle which traveling through the search space, during this travel an evolution of these particles is performed by a hybrid PSO with GA to get approximate no dominated solution. Secondly, to improve the solution quality, dynamic version of pattern search technique is implemented as neighborhood search engine where it intends to explore the less-crowded area in the current archive to possibly obtain more nondominated solutions. The proposed approach is carried out on the standard IEEE 30-bus 6-generator test system. The results demonstrate the capabilities of the proposed approach to generate true and well-distributed Pareto optimal nondominated solutions of the multiobjective RPC.
Article
Full-text available
We consider Lévy flights subject to external force fields. This anomalous transport process is described by two approaches, a Langevin equation with Lévy noise and the corresponding generalized Fokker-Planck equation containing a fractional derivative in space. The cases of free flights, constant force, and linear Hookean force are analyzed in detail, and we corroborate our findings with results from numerical simulations. We discuss the non-Gibbsian character of the stationary solution for the case of the Hookean force, i.e., the deviation from Boltzmann equilibrium for long times. The possible connection to Tsallis’s q statistics is studied.
Conference Paper
Full-text available
This paper presents a comparison of swarm intelligence and evolutionary techniques based approaches for minimization of system losses and improvement of voltage profiles in a power network. Efficient distribution of reactive power in an electric network can be achieved by adjusting the excitation on generators, the on-load tap changer positions of transformers, and proper switching of discrete portions of inductors or capacitors. This is a mixed integer non-linear optimization problem where metaheuristics techniques have proven suitable for providing optimal solutions. Four algorithms explored in this paper include differential evolution (DE), particle swarm optimization (PSO), a hybrid combination of DE and PSO, and a mutated PSO (MPSO) algorithm. The effectiveness of these algorithms is evaluated based on their solution quality and convergence characteristic. Simulation studies on the Nigerian power system show that a PSO based solution is more effective than a DE approach in reducing real power losses while keeping the voltage profiles within acceptable limits. The results also show that MPSO allows for further reduction of the real power losses while maintaining a satisfactory voltage profile.
Article
Full-text available
A new metaheuristic optimisation algorithm, called Cuckoo Search (CS), was developed recently by Yang and Deb (2009). This paper presents a more extensive comparison study using some standard test functions and newly designed stochastic test functions. We then apply the CS algorithm to solve engineering design optimisation problems, including the design of springs and welded beam structures. The optimal solutions obtained by CS are far better than the best solutions obtained by an efficient particle swarm optimiser. We will discuss the unique search features used in CS and the implications for further research. Comment: 14 pages; Yang, X.-S., and Deb, S. (2010), Engineering Optimisation by Cuckoo Search
Article
Full-text available
The Dommel-Tinney approach to the calculation of optimal power-system load flows has proved to be very powerful and general. This paper extends the problem formulation and solution scheme by incorporating exact outage-contingency constraints into the method, to give an optimal steady-state-secure system operating point. The controllable system quantities in the base-case problem (e.g. generated MW, controlled voltage magnitudes, transformer taps) are optimised within their limits according to some defined objective, so that no limit-violations on other quantities (e. g. generator MVAR and current loadings, transmission-circuit loadings, load-bus voltage magnitudes, angular displacements) occur in either the base-case or contingency-case system operating conditions.
Article
Full-text available
The key of reactive power planning (RPP), or Var planning, is the optimal allocation of reactive power sources considering location and size. Traditionally, the locations for placing new Var sources were either simply estimated or directly assumed. Recent research works have presented some rigorous optimization-based methods in RPP. This paper will first review various objectives of RPP. The objectives may consider many cost functions such as variable Var cost, fixed Var cost, real power losses, and fuel cost. Also considered may be the deviation of a given voltage schedule, voltage stability margin, or even a combination of different objectives as a multi-objective model. Secondly, different constraints in RPP are discussed. These different constraints are the key of various optimization models, identified as optimal power flow (OPF) model, security-constrained OPF (SCOPF) model, and SCOPF with voltage-stability consideration. Thirdly, the optimization-based models will be categorized as conventional algorithms, intelligent searches, and fuzzy set applications. The conventional algorithms include linear programming, nonlinear programming, mixed-integer nonlinear programming, etc. The intelligent searches include simulated annealing, evolutionary algorithms, and tabu search. The fuzzy set applications in RPP address the uncertainties in objectives and constraints. Finally, this paper will conclude the discussion with a summary matrix for different objectives, models, and algorithms.
Article
Optimal power flow (OPF) is the most requisite tool in the power system analysis. The OPF is relatively a difficult constrained optimisation problem and broadly solved by conventional as well as modern intelligent methods. In this paper the authors proposed a Levy flight spider monkey optimisation (LFSMO) algorithm to solve the standard OPF problem for IEEE 30-bus system, which is proposed to improve the exploitation capability of spider monkey optimisation (SMO) algorithm. The performance of LFSMO is evaluated by testing it over 25 benchmark functions.
Conference Paper
This paper proposes an improved Cuckoo search algorithm to solve optimal power flow problems in electric power system. The proposed Self-learning Cuckoo search algorithm enhances the performance of Cuckoo eggs by employing the learner phase of Teaching-learning-based optimization. The learner phase leads Cuckoo eggs to follow better solutions. The proposed method has been applied for solving optimal power flow problems on the standard IEEE 30-bus and 57-bus systems to investigate its effectiveness. The objective of the optimal power flow problem is to minimize the total fuel cost while satisfying generator operational constraints of generators, transformers, shunt capacitors and capacity of transmission lines. The results indicate that the proposed method gives better solutions than the conventional Cuckoo search algorithm and other algorithms in literature.
Chapter
In this chapter, a metaheuristic method so-called cuckoo search (CS) algorithm is utilized to determine optimum design of structures for both discrete and continuous variables. This algorithm is recently developed by Yang [1] and Yang and Deb [2, 3], and it is based on the obligate brood parasitic behavior of some cuckoo species together with the Lévy flight behavior of some birds and fruit flies. The CS is a population-based optimization algorithm and, similar to many other metaheuristic algorithms, starts with a random initial population which is taken as host nests or eggs. The CS algorithm essentially works with three components: Selection of the best by keeping the best nests or solutionsReplacement of the host eggs with respect to the quality of the new solutions or cuckoo eggs produced based randomization via Lévy flights globally (exploration)Discovering of some cuckoo eggs by the host birds and replacing according to the quality of the local random walks (exploitation) [2]
Article
The optimal power flow (OPF) problem in power system is a very large problem, which can be solved using soft computing techniques. The problem has many equality and inequality constraints. A new population based search algorithm called cuckoo search algorithm (CSA) solves the problem fast and accurate. The cuckoo search algorithm is based on the behavior of cuckoo birds in its breeding, is formed as the mathematical formulation to solve a real world nonlinear problems. In this paper CSA algorithm is used to solve the OPF problem. The performance of the algorithm is compared with the particle swarm optimization (PSO) algorithm and genetic algorithm (GA). MATLAB programing is used to program the concept of the solution. IEEE-62 bus Indian utility system is used to test the performance.
Article
This paper proposes a cuckoo search (CS) algorithm, a stochastic heuristic algorithm, combined with the most familiar genetic algorithm (GA) to seek optimal location(s) of FACTS devices in a multi-machine power system. The intention of hybridizing GA with CS algorithm is to improve the quality of solution through expanding the search space and speed of convergence. The run time and the required function evaluation number(generations) for acquiring optimum by the modified algorithm are generally smaller than the basic algorithm. Identification of the best location for FACTS is a vital task as they are expensive to use. Here, three emerging and dissimilar kinds of FACTS devices, namely Unified Power Flow Controller, Thyristor Controlled Series Capacitor and Interline Power Flow Controller, are chosen for optimum locations and are modeled for steady-state studies. The optimal location and size of these FACTS devices, including installation costs, are computed utilizing the real power losses of the system as the objective function to be minimized. The feasibility of the proposed method is demonstrated for IEEE 30 bus power system network using MATLAB working platform. The results show that the proposed approach, with good stability, has better convergence and the simultaneous use of several kinds of FACTS controllers is the most efficient solution to improve the voltage profile with minimum power loss of the system.
Article
This paper presents an algorithm for solving the multi-objective reactive power dispatch problem in a power system. Modal analysis of the system is used for static voltage stability assessment. Loss minimization and maximization of voltage stability margin are taken as the objectives. Generator terminal voltages, reactive power generation of the capacitor banks and tap changing transformer setting are taken as the optimization variables. Evolutionary algorithm and Swarm Intelligence algorithm (EA, SI), a part of Bio inspired optimization algorithm, have been widely used to solve numerous optimization problem in various science and engineering domains. This paper presents, a new novel cuckoo search optimization algorithm (NCSA) based on Gauss distribution is presented to solve the reactive power dispatch problem. The simulation results demonstrate good performance of the NCSA in solving an optimal reactive power dispatch problem. In order to evaluate the proposed algorithm, it has been tested on IEEE 30 bus system and compared to other algorithms reported those before in literature. Results show that NCSA is more efficient than others for solution of single-objective ORPD problem.
Article
The cuckoo search algorithm is a recently developed meta-heuristic optimization algorithm, which is suitable for solving optimization problems. To enhance the accuracy and convergence rate of this algorithm, an improved cuckoo search algorithm is proposed in this paper. Normally, the parameters of the cuckoo search are kept constant. This may lead to decreasing the efficiency of the algorithm. To cope with this issue, a proper strategy for tuning the cuckoo search parameters is presented. Considering several well-known benchmark problems, numerical studies reveal that the proposed algorithm can find better solutions in comparison with the solutions obtained by the cuckoo search. Therefore, it is anticipated that the improved cuckoo search algorithm can successfully be applied to a wide range of optimization problems.
Article
Optimal reactive power flow is an optimization problem with one or more objective of minimizing the active power losses for fixed generation schedule. The control variables are generator bus voltages, transformer tap settings and reactive power output of the compensating devices placed on different bus bars. Biogeography-Based Optimization (BBO) technique has been applied to solve different kinds of optimal reactive power flow problems subject to operational constraints like power balance constraint, line flow and bus voltages limits etc. BBO searches for the global optimum mainly through two steps: Migration and Mutation. In the present work, BBO has been applied to solve the optimal reactive power flow problems on IEEE 30-bus and standard IEEE 57-bus power systems for minimization of active power loss. The superiority of the proposed method has been demonstrated. Considering the quality of the solution obtained, the proposed method seems to be a promising one for solving these problems.
Article
This paper presents a unified method for optimal real and reactive power dispatch for the economic operation of power systems. As in other methods, the problem is decomposed into a P-optimization module and a Q-optimization module, but in this method both modules use the same generation cost objective function. The control variables are generator real power outputs for the real power module; and generator reactive power outputs, shunt capacitors/reactors, and transformer tap settings for the reactive power module. The constraints are the operating limits of the control variables, power line flows, and bus voltages.
A united approach to optimal real and reactive power dispatch
  • M K Y Lee
  • J L Paruy
  • Oritz
Article Swarm Optimization with Constriction Factor for Optimal Reactive Power Dispatch
  • Ngoc Vo
  • Le Dieu
  • Anh Dung
  • And Nguyen Phuc Khai
Optimal Reactive Power Planning for Loss Reduction and Improvement of Voltage Profile Using Cuckoo Search Algorithm
  • vadivelu
Unconstraint Optimal Power Flow using Improved Cuckoo Search Algorithm
  • solaimani