# POWER FLOW OPTIMIZATION USING SEEKER OPTIMIZATION ALGORITHM AND PSO

Save this PDF as:

Size: px
Start display at page:

Download "POWER FLOW OPTIMIZATION USING SEEKER OPTIMIZATION ALGORITHM AND PSO"

## Transcription

1 POWER FLOW OPTIMIZATION USING SEEKER OPTIMIZATION ALGORITHM AND PSO VIGNESH.P Department of Electrical & Electronics Engineering Anna University Veerammal Engineering College, Dindigul, Tamilnadu India Abstract: - The objective of an Optimal Power Flow (OPF) algorithm is to find steady state operation point which minimizes generation cost, loss etc. or maximizes social welfare, loadability etc. while maintaining an acceptable system performance in terms of limits on generators real and reactive powers, line flow limits, output of various compensating devices etc. This paper aims to find a solution for the Optimal Power Flow (OPF) problem with security constraints by the seeker optimization algorithm (SOA). The major objective is to minimize the overall operating cost and real power losses while satisfying the power flow equations and system security. The SOA is based on the concept of simulating the act of human searching, where the search direction is based on the empirical gradient by evaluating the response to the position changes. To demonstrate its robustness, the proposed algorithm was tested on IEEE 30 System and the proposed approach results were simulated using MATLAB. The performance of this algorithm is compared with the performance of PSO. Key-Words: - global optimization, power system, seeker optimization algorithm 1 Introduction The optimal power flow is an inherently nlinear optimization problem with a n-linear objective function and a set of n-linear equality and inequality constraints. Optimal power flow is one of the main functions of power generation operation and control. It determines the optimal setting of generating units[1]. It is therefore of great importance to solve this problem as quickly and accurately as possible. In the past two decades, a wide variety of optimization techniques have been applied in solving the optimal power flow problem, such as linear programming, n-linear programming, Newton-based techniques, and interior point methods. The optimal power flow problem is a highly n-linear and a multi-modal optimization problem which exists more than one local optimum. Hence, most of these techniques are t suitable for such a problem. Recently, genetic algorithm and particle swarm optimization (PSO) have been proposed for solving the optimal power flow problem[3]. Particle swarm optimization, first introduced by Eberhart and Kennedy, has been used extensively in many fields, Including function optimization, neutral network and system control, etc. Unfortunately, the premature convergence of particle swarm optimization algorithm degrades its performance. 2 Problem formulation Optimal Power flow (OPF) is allocating loads to plants for minimum cost while meeting the network constraints. It is formulated as an optimization problem of minimizing the total fuel cost of all committed plant while meeting the network (power flow) constraints. The variants of the problems are numerous which model the objective and the constraints in different ways. The basic OPF problem can described mathematically as a minimization of problem of minimizing the total fuel cost of all committed plants subject to the constraints[1]. Minimize (1) F(Pi) is the fuel cost equation of the i th plant. It is the variation of fuel cost (\$ or ISBN:

3 Applied Mathematics and Materials topological neighbors, the best value is a global best and is called gbest.the particle swarm optimization concept consists of, at each time step, changing the velocity of (accelerating) each particle toward its pbest and lbest locations (local version of PSO). Acceleration is weighted by a random term, with separate random numbers being generated for acceleration toward pbest and lbest locations. 4.1 Implementation of PSO for OPF problem A swarm consists of a set of particles moving within the search space, each representing a potential solution (fitness). In a physical ndimensional search space, the position and velocity of each particle are represented as the vectors = (1 ) and = ( 1,, ), respectively. Let b e s t = ( b e s t 1,, b e s t n) and b e s t = ( b e s t 1,, b e s t ) be the position of the individual and its neighbor s best position so far. Using this information, the modified velocity of each individual can be calculated using the current velocity and the distance from Pbest and Gbest as shown in +1 = + 1r a n d1 ( b e s t ) + 2r a n d ( P ) (4) 2 best where is current velocity of individual i at iteration, + 1 modified velocity of individual i at iteration + 1, current position of individual i atiteration k, inertiaweightparamet er, 1, 2 acceleration factors, r a n d1, r a n d2: random numbers between 0 and 1, b e s t : best position of individual until iteration, b e s t : best position of the group until iteration. Each individual moves from the current position to the next one by the modified velocity using the following equation: + 1= (5) The parameters 1and 2are set to constant values. Low values allow individual to roam far from the target regions before being tugged back. On the other hand, high values result in abrupt movement towards target regions. Hence the acceleration constants 1and 2are rmally set as 2.0 whereas r a n d1and r a n d2 are random values, and they are uniformly distributed between zero and one. These values are t the same for each iteration because they are generated randomly every time. ISBN: Fig 1: PSO Flow diagram PSO algorithm The technique is initialized with a population of random solutions or particles and then searches the optima by updating generations. Each individual particle I has the three following properties: a current position in search space, a current velocity, and a personal best position in search space. In every iteration, each particle is updated by the following two best values. The first one is the personal best position which is the position of the particle in the search space, where it has reached the best solution so far. The second one is the global best solution which is the position yielding the best solution among all the s. The pbest and gbest values are updated at time t using the equations 1 and 2. Here it is assumed that the swarm has particles. Therefore, 1,, and assuming the minimization of the objective function F, Yi(t+1)= (6) Y*(t) {y1(t),,ys(t)} f(y*(t))=min{f(y1(t)), f(ys(t))} (7) After finding the two best values, each particle updates its velocity and current position. The velocity of the particle is updated according to its own previous best position and the previous best position of its companions which is given.this new velocity is added to the current position of the particle to obtain its next position. 190

4 The acceleration coefficients control the distance moved by a particle in the iteration. The inertia weight controls the convergence behavior of PSO. Initially the inertia weight was considered as a constant value. However, experimental results indicated that it is better to initially set the inertia weight to larger value and gradually reduce it to get refined solutions. A new inertia weight which is neither set to a constant value r set as a linearly decreasing time-varying function is used in this paper 5 Seeker Optimization Algorithm The SOA is based on the concept of simulating the act of human searching, where the search direction is based on the empirical gradient by evaluating the response to the position changes and the step length is based on uncertainty reasoning by using a simple Fuzzy rule[2]. SOA operates on a set of solutions called search population. The individual of this population is called seeker.[2] In order to add a social component for social sharing of information, a neighborhood is defined for each seeker. In the present simulations, the population is randomly categorized into K=3 subpopulations in order to search over several different domains of the search space and all seekers in the same subpopulation constitute a neighborhood. Assume that the optimization problems to be solved are minimization problems. The main characteristics features of this algorithm are the following; The algorithm uses search direction and step length to update the positions of seekers. The calculations of search direction are based on a compromise among egotistic behavior, altruistic behavior and pro-activeness behavior. Fuzzy reasoning is used to generate the step length because the uncertain reasoning of human searching could be the best described by natural linguistic variables and a simple if else control rule. search direction d ij (t) and a step length α ij (t) are computed separately for each seeker i on each dimension j for each time step t where α ij (t 0 and d ij (t) {-1,0,1} ). 5.1 Implementation of SOA In SOA, a search direction d ij (t) and a step length α ij (t) are computed separately for each seeker i on each dimension j for each time step t where α ij (t 0 and d ij (t) {-1,0,1} ). d ij (t)=1 means the i-th seeker goes towards the positive direction of the coordinate axis on the dimension j. d ij (t)=-1 means the seeker goes towards the negative direction and d ij (t)=0 means the seeker stays at the current position. For each seeker i (1 I s, s is the population size), position update on each dimension j (1 j D) is given by the following: X ij (t+1) = X ij (t)+ α ij (t) d ij (t) (8) Since the subpopulations are searching using their own informations, they are easy to converge to a local optimum[2]. In order to avoid this situation the positions of the worst k=1 seekers of each subpopulation are combined with the best one in each of the other k-1 subpopulations using the following bimial crossover operator: x knj,worst = (9) where R j is a uniformly random real number within [0, 1], x knj,worst is deted as the j-th dimension of the n-th worst position in the K-th subpopulation, X lj,best is the j-th dimension of the best position in the l-th subpopulation with n,k,l=1,2, k-1 and k l. 5.2 SOA Flow chart and Algorithm The basic form of the proposed SOA algorithm can only handle continuous variables. However, both tap position of transformations and reactive power source installations are discrete or integer variables in optimal reactive power dispatch problem. To handle integer variables without any effect on the implementation of SOA, the seekers will still search in a continuous space regardless of the variable type, and then truncating the corresponding dimensions of the seekers realvalue positions into the integers is only performed in evaluating the objective function. The reactive power optimization based on SOA can be described as follows. Step 1) Read the parameters of power system and the proposed algorithm, and specify the lower and upper limits of each variable. Step 2) Initialize the positions of the seekers in the search space Randomly and uniformly. Set the time step t=0 Step 3) Calculate the fitness values of the initial positions using the objective function based on ISBN:

5 6 Simulation techniques and results Fig 3: IEEE 30bus Test System Fig 2: SOA Flow chart Step 4) Let t=t+1 Step 5) Select the neighbors of each seeker. Step 6) Determine the search direction and step length for each seeker, and update his position. Step 7) Calculate t h e f i t n e s s va l u e s o f t h e n e w p o s i tions using the objective function based on the Newton Raphson power Flow analysis results. Update the historical best position among the population and the historical best position of each seeker. Step 8) Go to Step 4 until a stopping criterion is satisfied. In particle swarm optimization Default population size: 24 Number of particles used: 20 Number of iterations set: 30 Initial inertia weight: 0.9 and final inertia weight: 0.4 Pso seed, default=0 =0 for initial positions all random =1 for initial particles as user input The table shows, variation of global best value of the generation for the number of iterations. In the end of all iterations the generation of all plants is maximum with reduced losses. And the bus voltages in each bus in the end of iteration are given. This graph depicts the variation of voltage in each bus. The bus voltage drops due to the losses in the bus. This problem derived for without considering the constrains and simulation results are produced in 10 seconds. ISBN:

6 Voltage voltage Table 1: PSO output 6.1 Simulation Output of SOA Seeker optimization algorithm for optimal power flow is similar to the Particle swarm optimization where as it is based on behavior of human searching. Although PSO is easy to implement, the performance of PSO also depends on its parameters and may be influenced by premature convergence and stagnation problem. So the disadvantage of PSO algorithm is overcome and best result for optimal power flow problem is obtained by seeker optimization algorithm Fig 5: SOA voltage variations Table 2: SOA without capacitor The figure 4 shows the variation of voltage in accordance with the number of iterations, and the figure 5 shows that the variation voltage in accordance with the angle. As the number of iterations increases, some voltage on the bus decreases with the increased value of angle.the bus voltage drop is reduced by adding STATCOM in the bus and is given in the next table. SOA with capacitor When we connecting the STATCOM into the bus, it injects the reactive power. Here the controlled capacitor is considered to inject the reactive power. Finally the increased bus voltage and the injected reactive power are given. A STATCOM can compensate for system needs for reactive power system needs for reactive power almost instantaneously preventing variations of voltage. Fig 4: SOA voltage variations ISBN:

7 S data Vsh pu Thst Table 3: SOA with capacitor Qsh pu Conclusion SOA is a vel heuristic stochastic optimization algorithm based on simulating the act of human searching. The algorithm has the additional advantage of being easy to understand, simple to implement so that it can be used for a wide variety of design and optimization tasks. In this paper, a SOA-based reactive power optimization approach is proposed, and the benefits of SOA for optimal reactive power dispatch problem are studied. The simulation results show that SOA has better performance in balancing global search ability and convergence speed than other algorithms. So, it is believed that the proposed SOA approach is capable of quickly and effectively solving reactive power dispatch problem and will become a promising candidate for the OPF problems. GA is used for optimal placement of FACTS devices that GA based reactive power dispatch algorithm is able to minimize the power loss in the system. Overall performance of the SOA-GA algorithm and its advantages were discussed and the algorithm shows that it is easy to implement and also produces good results for optimal power flow problem than other algorithms. References: [1]J. Carpentier, Optimal power flow, uses, methods and development, Planning and operation of electrical energy system Proc. Of IFAC symposium, Brazil, 1985, pp [2] Seeker optimization algorithm for optimal reactive power dispatch Chaohua Dai, Weirong Chen, Member, IEEE, Yunfang Zhu, and Xuexia Zhang IEEE transactions on power systems vol24 3 aug 2009 [3]Q. H. Wu, Y. J. Cao, and J. Y. Wen, Optimal reactive power dispatch using an adaptive genetic algorithm, Int. J. Elect. Power Energy Syst., vol. 20, pp , Aug [4]G. A. Bakare, G. Krost, G. K. Venayagamoorthy, and U. O. Aliyu, Comparative application of differential evolution and particle swarm techniques to reactive power and voltage control, in Proc. Int. Conf. Intelligent Systems Applications to Power Systems, 2007, pp [5]Stephane Gerbex, Rachid Cherkaoui, andalain J.Germond. (2001). Optimal Location of Multi-type FACTS Devices in a Power System by Means of Genetic Algorithm, IEEE Trans on Power System, Vol.16, No.3, pp [6]L. dos Santos Coelho and B. M. Herrera, Fuzzy identification based on a chaotic particle swarm optimization approach applied to a nlinear yo-yo motion system, IEEE Trans. Ind. Electron., vol. 54,. 6, pp , [7]Enhanced Particle Swarm Optimization Approach for Solving the Non-Convex Optimal Power Flow by M. R. AlRashidi, M. F. AlHajri, and M. E. El-Hawary World Academy of Science, Engineering and Techlogy [8]Zhao B. Guo C.X. and Cao Y.J.(2005) A multiagent based particle swarm optimization approach for optimal reactive power dispatch, IEEE Trans on power system, May,Vol.20.No.2, pp [8]G. Cai, Z. Ren, and T. Yu, Optimal reactive power dispatch based on modified particle swarm optimization considering voltage stability, in Proc. IEEE Power Eng. Soc. General Meeting, 2007, pp [9]M. Fozdar, C. M. Arora, and V. R. Gottipati, Recent trends in intel- ligent techniques to power systems, in Proc. 42nd Int. Universities Power Engineering Conf., 2007, pp [10]L. dos Santos Coelho and B. M. Herrera, Fuzzy identification based on a chaotic particle swarm optimization approach applied to a nlinear yo-yo motion system, IEEE Trans. Ind. Electron., vol. 54,. 6, pp , ISBN:

### CHAPTER 2 CONVENTIONAL AND NON-CONVENTIONAL TECHNIQUES TO SOLVE ORPD PROBLEM

20 CHAPTER 2 CONVENTIONAL AND NON-CONVENTIONAL TECHNIQUES TO SOLVE ORPD PROBLEM 2.1 CLASSIFICATION OF CONVENTIONAL TECHNIQUES Classical optimization methods can be classified into two distinct groups:

### A NEW APPROACH TO SOLVE ECONOMIC LOAD DISPATCH USING PARTICLE SWARM OPTIMIZATION

A NEW APPROACH TO SOLVE ECONOMIC LOAD DISPATCH USING PARTICLE SWARM OPTIMIZATION Manjeet Singh 1, Divesh Thareja 2 1 Department of Electrical and Electronics Engineering, Assistant Professor, HCTM Technical

### Handling Multi Objectives of with Multi Objective Dynamic Particle Swarm Optimization

Handling Multi Objectives of with Multi Objective Dynamic Particle Swarm Optimization Richa Agnihotri #1, Dr. Shikha Agrawal #1, Dr. Rajeev Pandey #1 # Department of Computer Science Engineering, UIT,

### Optimal Reactive Power Dispatch Using Hybrid Loop-Genetic Based Algorithm

Optimal Reactive Power Dispatch Using Hybrid Loop-Genetic Based Algorithm Md Sajjad Alam Student Department of Electrical Engineering National Institute of Technology, Patna Patna-800005, Bihar, India

### Reconfiguration Optimization for Loss Reduction in Distribution Networks using Hybrid PSO algorithm and Fuzzy logic

Bulletin of Environment, Pharmacology and Life Sciences Bull. Env. Pharmacol. Life Sci., Vol 4 [9] August 2015: 115-120 2015 Academy for Environment and Life Sciences, India Online ISSN 2277-1808 Journal

### PARTICLE SWARM OPTIMIZATION (PSO)

PARTICLE SWARM OPTIMIZATION (PSO) J. Kennedy and R. Eberhart, Particle Swarm Optimization. Proceedings of the Fourth IEEE Int. Conference on Neural Networks, 1995. A population based optimization technique

### Optimal Power Flow Using Particle Swarm Optimization

Optimal Power Flow Using Particle Swarm Optimization M.Chiranjivi, (Ph.D) Lecturer Department of ECE Bule Hora University, Bulehora, Ethiopia. Abstract: The Optimal Power Flow (OPF) is an important criterion

### Modified Particle Swarm Optimization

Modified Particle Swarm Optimization Swati Agrawal 1, R.P. Shimpi 2 1 Aerospace Engineering Department, IIT Bombay, Mumbai, India, swati.agrawal@iitb.ac.in 2 Aerospace Engineering Department, IIT Bombay,

### Solving Economic Load Dispatch Problems in Power Systems using Genetic Algorithm and Particle Swarm Optimization

Solving Economic Load Dispatch Problems in Power Systems using Genetic Algorithm and Particle Swarm Optimization Loveleen Kaur 1, Aashish Ranjan 2, S.Chatterji 3, and Amod Kumar 4 1 Asst. Professor, PEC

### LECTURE 16: SWARM INTELLIGENCE 2 / PARTICLE SWARM OPTIMIZATION 2

15-382 COLLECTIVE INTELLIGENCE - S18 LECTURE 16: SWARM INTELLIGENCE 2 / PARTICLE SWARM OPTIMIZATION 2 INSTRUCTOR: GIANNI A. DI CARO BACKGROUND: REYNOLDS BOIDS Reynolds created a model of coordinated animal

### International Journal of Current Research and Modern Education (IJCRME) ISSN (Online): & Impact Factor: Special Issue, NCFTCCPS -

TO SOLVE ECONOMIC DISPATCH PROBLEM USING SFLA P. Sowmya* & Dr. S. P. Umayal** * PG Scholar, Department Electrical and Electronics Engineering, Muthayammal Engineering College, Rasipuram, Tamilnadu ** Dean

### OPTIMUM CAPACITY ALLOCATION OF DISTRIBUTED GENERATION UNITS USING PARALLEL PSO USING MESSAGE PASSING INTERFACE

OPTIMUM CAPACITY ALLOCATION OF DISTRIBUTED GENERATION UNITS USING PARALLEL PSO USING MESSAGE PASSING INTERFACE Rosamma Thomas 1, Jino M Pattery 2, Surumi Hassainar 3 1 M.Tech Student, Electrical and Electronics,

### Traffic Signal Control Based On Fuzzy Artificial Neural Networks With Particle Swarm Optimization

Traffic Signal Control Based On Fuzzy Artificial Neural Networks With Particle Swarm Optimization J.Venkatesh 1, B.Chiranjeevulu 2 1 PG Student, Dept. of ECE, Viswanadha Institute of Technology And Management,

### Dynamic Economic Dispatch for Power Generation Using Hybrid optimization Algorithm

Dynamic Economic Dispatch for Power Generation Using Hybrid optimization Algorithm G.Karthika 1, Mr.M.Vigneshwaran, M.E., 2 PG Scholar, M. Kumarasamy College of Engineering, Karur, Tamilnadu, India 1 Assistant

### Research on time optimal trajectory planning of 7-DOF manipulator based on genetic algorithm

Acta Technica 61, No. 4A/2016, 189 200 c 2017 Institute of Thermomechanics CAS, v.v.i. Research on time optimal trajectory planning of 7-DOF manipulator based on genetic algorithm Jianrong Bu 1, Junyan

### THREE PHASE FAULT DIAGNOSIS BASED ON RBF NEURAL NETWORK OPTIMIZED BY PSO ALGORITHM

THREE PHASE FAULT DIAGNOSIS BASED ON RBF NEURAL NETWORK OPTIMIZED BY PSO ALGORITHM M. Sivakumar 1 and R. M. S. Parvathi 2 1 Anna University, Tamilnadu, India 2 Sengunthar College of Engineering, Tamilnadu,

### International Journal of Digital Application & Contemporary research Website: (Volume 1, Issue 7, February 2013)

Performance Analysis of GA and PSO over Economic Load Dispatch Problem Sakshi Rajpoot sakshirajpoot1988@gmail.com Dr. Sandeep Bhongade sandeepbhongade@rediffmail.com Abstract Economic Load dispatch problem

### Mobile Robot Path Planning in Static Environments using Particle Swarm Optimization

Mobile Robot Path Planning in Static Environments using Particle Swarm Optimization M. Shahab Alam, M. Usman Rafique, and M. Umer Khan Abstract Motion planning is a key element of robotics since it empowers

### Discussion of Various Techniques for Solving Economic Load Dispatch

International Journal of Enhanced Research in Science, Technology & Engineering ISSN: 2319-7463, Vol. 4 Issue 7, July-2015 Discussion of Various Techniques for Solving Economic Load Dispatch Veerpal Kaur

### Particle swarm optimization for mobile network design

Particle swarm optimization for mobile network design Ayman A. El-Saleh 1,2a), Mahamod Ismail 1, R. Viknesh 2, C. C. Mark 2, and M. L. Chan 2 1 Department of Electrical, Electronics, and Systems Engineering,

### An improved PID neural network controller for long time delay systems using particle swarm optimization algorithm

An improved PID neural network controller for long time delay systems using particle swarm optimization algorithm A. Lari, A. Khosravi and A. Alfi Faculty of Electrical and Computer Engineering, Noushirvani

### Optimal Power Flow of Distribution Network

Optimal Power Flow of Distribution Network Dr.R.Muthu Kumar 1 and Ms. Swathi M 2 1 Associate Professor, Department of EEE, Shree Venkateshwara Hi-Tech Engineering College, Erode, India 2 PG Scholar, ME

### Argha Roy* Dept. of CSE Netaji Subhash Engg. College West Bengal, India.

Volume 3, Issue 3, March 2013 ISSN: 2277 128X International Journal of Advanced Research in Computer Science and Software Engineering Research Paper Available online at: www.ijarcsse.com Training Artificial

### Meta- Heuristic based Optimization Algorithms: A Comparative Study of Genetic Algorithm and Particle Swarm Optimization

2017 2 nd International Electrical Engineering Conference (IEEC 2017) May. 19 th -20 th, 2017 at IEP Centre, Karachi, Pakistan Meta- Heuristic based Optimization Algorithms: A Comparative Study of Genetic

### A *69>H>N6 #DJGC6A DG C<>C::G>C<,8>:C8:H /DA 'D 2:6G, ()-"&"3 -"(' ( +-" " " % '.+ % ' -0(+\$,

The structure is a very important aspect in neural network design, it is not only impossible to determine an optimal structure for a given problem, it is even impossible to prove that a given structure

### Dr. Ramesh Kumar, Nayan Kumar (Department of Electrical Engineering,NIT Patna, India, (Department of Electrical Engineering,NIT Uttarakhand, India,

Dr Ramesh Kumar, Nayan Kumar/ International Journal of Engineering Research and An Efficent Particle Swarm Optimisation (Epso) For Solving Economic Load Dispatch (Eld) Problems Dr Ramesh Kumar, Nayan Kumar

### Optimal Power Flow by Particle Swarm Optimization for Reactive Loss Minimization

Optimal Power Flow by Particle Swarm Optimization for Reactive Loss Minimization Pathak Smita, Prof. B.N.Vaidya Abstract- Optimal Power Flow (OPF) in electrical power system is considered as a static,

### CHAPTER 6 HYBRID AI BASED IMAGE CLASSIFICATION TECHNIQUES

CHAPTER 6 HYBRID AI BASED IMAGE CLASSIFICATION TECHNIQUES 6.1 INTRODUCTION The exploration of applications of ANN for image classification has yielded satisfactory results. But, the scope for improving

### Particle Swarm Optimization Approach for Scheduling of Flexible Job Shops

Particle Swarm Optimization Approach for Scheduling of Flexible Job Shops 1 Srinivas P. S., 2 Ramachandra Raju V., 3 C.S.P Rao. 1 Associate Professor, V. R. Sdhartha Engineering College, Vijayawada 2 Professor,

### CHAPTER 6 ORTHOGONAL PARTICLE SWARM OPTIMIZATION

131 CHAPTER 6 ORTHOGONAL PARTICLE SWARM OPTIMIZATION 6.1 INTRODUCTION The Orthogonal arrays are helpful in guiding the heuristic algorithms to obtain a good solution when applied to NP-hard problems. This

### Effectual Multiprocessor Scheduling Based on Stochastic Optimization Technique

Effectual Multiprocessor Scheduling Based on Stochastic Optimization Technique A.Gowthaman 1.Nithiyanandham 2 G Student [VLSI], Dept. of ECE, Sathyamabama University,Chennai, Tamil Nadu, India 1 G Student

### Particle Swarm Optimization

Dario Schor, M.Sc., EIT schor@ieee.org Space Systems Department Magellan Aerospace Winnipeg Winnipeg, Manitoba 1 of 34 Optimization Techniques Motivation Optimization: Where, min x F(x), subject to g(x)

### A Modified PSO Technique for the Coordination Problem in Presence of DG

A Modified PSO Technique for the Coordination Problem in Presence of DG M. El-Saadawi A. Hassan M. Saeed Dept. of Electrical Engineering, Faculty of Engineering, Mansoura University, Egypt saadawi1@gmail.com-

### ABC Analysis For Economic operation of power system

ABC Analysis For Economic operation of power system 1 Prachi Shukla, 2.Alka Thakur 1 M.tech Schlor, Electrical Department, SSSUTMS, M.P.India 2 Associate Professor, Electrical Department, SSSUTMS, M.P.India

### Model Parameter Estimation

Model Parameter Estimation Shan He School for Computational Science University of Birmingham Module 06-23836: Computational Modelling with MATLAB Outline Outline of Topics Concepts about model parameter

### Hybrid Particle Swarm-Based-Simulated Annealing Optimization Techniques

Hybrid Particle Swarm-Based-Simulated Annealing Optimization Techniques Nasser Sadati Abstract Particle Swarm Optimization (PSO) algorithms recently invented as intelligent optimizers with several highly

### GENETIC ALGORITHM VERSUS PARTICLE SWARM OPTIMIZATION IN N-QUEEN PROBLEM

Journal of Al-Nahrain University Vol.10(2), December, 2007, pp.172-177 Science GENETIC ALGORITHM VERSUS PARTICLE SWARM OPTIMIZATION IN N-QUEEN PROBLEM * Azhar W. Hammad, ** Dr. Ban N. Thannoon Al-Nahrain

### Generation of Ultra Side lobe levels in Circular Array Antennas using Evolutionary Algorithms

Generation of Ultra Side lobe levels in Circular Array Antennas using Evolutionary Algorithms D. Prabhakar Associate Professor, Dept of ECE DVR & Dr. HS MIC College of Technology Kanchikacherla, AP, India.

### A MULTI-SWARM PARTICLE SWARM OPTIMIZATION WITH LOCAL SEARCH ON MULTI-ROBOT SEARCH SYSTEM

A MULTI-SWARM PARTICLE SWARM OPTIMIZATION WITH LOCAL SEARCH ON MULTI-ROBOT SEARCH SYSTEM BAHAREH NAKISA, MOHAMMAD NAIM RASTGOO, MOHAMMAD FAIDZUL NASRUDIN, MOHD ZAKREE AHMAD NAZRI Department of Computer

### Proceedings of the 5th WSEAS International Conference on Applied Computer Science, Hangzhou, China, April 16-18, 2006 (pp )

Multiobjective Electricity Power Dispatch Using Multiobjective Particle Swarm Optimization Hongwen Yan, Rui Ma Changsha University of Science and Technology Chiling Road 45, Changsha, 40076 China Abstract:

### Feeder Reconfiguration Using Binary Coding Particle Swarm Optimization

488 International Journal Wu-Chang of Control, Wu Automation, and Men-Shen and Systems, Tsai vol. 6, no. 4, pp. 488-494, August 2008 Feeder Reconfiguration Using Binary Coding Particle Swarm Optimization

### Step Size Optimization of LMS Algorithm Using Particle Swarm Optimization Algorithm in System Identification

IJCSNS International Journal of Computer Science and Network Security, VOL.13 No.6, June 2013 125 Step Size Optimization of LMS Algorithm Using Particle Swarm Optimization Algorithm in System Identification

### REAL-CODED GENETIC ALGORITHMS CONSTRAINED OPTIMIZATION. Nedim TUTKUN

REAL-CODED GENETIC ALGORITHMS CONSTRAINED OPTIMIZATION Nedim TUTKUN nedimtutkun@gmail.com Outlines Unconstrained Optimization Ackley s Function GA Approach for Ackley s Function Nonlinear Programming Penalty

### Small World Particle Swarm Optimizer for Global Optimization Problems

Small World Particle Swarm Optimizer for Global Optimization Problems Megha Vora and T.T. Mirnalinee Department of Computer Science and Engineering S.S.N College of Engineering, Anna University, Chennai,

### A Multiobjective Memetic Algorithm Based on Particle Swarm Optimization

A Multiobjective Memetic Algorithm Based on Particle Swarm Optimization Dr. Liu Dasheng James Cook University, Singapore / 48 Outline of Talk. Particle Swam Optimization 2. Multiobjective Particle Swarm

### HPSOM: A HYBRID PARTICLE SWARM OPTIMIZATION ALGORITHM WITH GENETIC MUTATION. Received February 2012; revised June 2012

International Journal of Innovative Computing, Information and Control ICIC International c 2013 ISSN 1349-4198 Volume 9, Number 5, May 2013 pp. 1919 1934 HPSOM: A HYBRID PARTICLE SWARM OPTIMIZATION ALGORITHM

### Cell-to-switch assignment in. cellular networks. barebones particle swarm optimization

Cell-to-switch assignment in cellular networks using barebones particle swarm optimization Sotirios K. Goudos a), Konstantinos B. Baltzis, Christos Bachtsevanidis, and John N. Sahalos RadioCommunications

### Three-Dimensional Off-Line Path Planning for Unmanned Aerial Vehicle Using Modified Particle Swarm Optimization

Three-Dimensional Off-Line Path Planning for Unmanned Aerial Vehicle Using Modified Particle Swarm Optimization Lana Dalawr Jalal Abstract This paper addresses the problem of offline path planning for

### Particle Swarm Optimization

Particle Swarm Optimization Gonçalo Pereira INESC-ID and Instituto Superior Técnico Porto Salvo, Portugal gpereira@gaips.inesc-id.pt April 15, 2011 1 What is it? Particle Swarm Optimization is an algorithm

### Hybrid Approach for Placement of Multiple DGs in Primary Distribution Networks

Asian Journal of Electrical Sciences ISSN: 2249 6297, Vol. 7, No. 2, 2018, pp. 90-95 The Research Publication, www.trp.org.in Hybrid Approach for Placement of Multiple DGs in Primary Distribution Networks

### Comparison of Some Evolutionary Algorithms for Approximate Solutions of Optimal Control Problems

Australian Journal of Basic and Applied Sciences, 4(8): 3366-3382, 21 ISSN 1991-8178 Comparison of Some Evolutionary Algorithms for Approximate Solutions of Optimal Control Problems Akbar H. Borzabadi,

### Experimental Study on Bound Handling Techniques for Multi-Objective Particle Swarm Optimization

Experimental Study on Bound Handling Techniques for Multi-Objective Particle Swarm Optimization adfa, p. 1, 2011. Springer-Verlag Berlin Heidelberg 2011 Devang Agarwal and Deepak Sharma Department of Mechanical

### IMPROVING THE PARTICLE SWARM OPTIMIZATION ALGORITHM USING THE SIMPLEX METHOD AT LATE STAGE

IMPROVING THE PARTICLE SWARM OPTIMIZATION ALGORITHM USING THE SIMPLEX METHOD AT LATE STAGE Fang Wang, and Yuhui Qiu Intelligent Software and Software Engineering Laboratory, Southwest-China Normal University,

### EE 553 Term Project Report Particle Swarm Optimization (PSO) and PSO with Cross-over

EE Term Project Report Particle Swarm Optimization (PSO) and PSO with Cross-over Emre Uğur February, 00 Abstract In this work, Particle Swarm Optimization (PSO) method is implemented and applied to various

### International Conference on Modeling and SimulationCoimbatore, August 2007

International Conference on Modeling and SimulationCoimbatore, 27-29 August 2007 OPTIMIZATION OF FLOWSHOP SCHEDULING WITH FUZZY DUE DATES USING A HYBRID EVOLUTIONARY ALGORITHM M.S.N.Kiran Kumara, B.B.Biswalb,

### KEYWORDS: Mobile Ad hoc Networks (MANETs), Swarm Intelligence, Particle Swarm Optimization (PSO), Multi Point Relay (MPR), Throughput.

IJESRT INTERNATIONAL JOURNAL OF ENGINEERING SCIENCES & RESEARCH TECHNOLOGY APPLICATION OF SWARM INTELLIGENCE PSO TECHNIQUE FOR ANALYSIS OF MULTIMEDIA TRAFFIC AND QOS PARAMETERS USING OPTIMIZED LINK STATE

### QUANTUM BASED PSO TECHNIQUE FOR IMAGE SEGMENTATION

International Journal of Computer Engineering and Applications, Volume VIII, Issue I, Part I, October 14 QUANTUM BASED PSO TECHNIQUE FOR IMAGE SEGMENTATION Shradha Chawla 1, Vivek Panwar 2 1 Department

### A NEW APPROACH TO THE SOLUTION OF ECONOMIC DISPATCH USING PARTICLE SWARM OPTIMIZATION WITH SIMULATED ANNEALING

A NEW APPROACH TO THE SOLUTION OF ECONOMIC DISPATCH USING PARTICLE SWARM OPTIMIZATION WITH SIMULATED ANNEALING V.Karthikeyan 1 S.Senthilkumar 2 and V.J.Vijayalakshmi 3 1Department of Electronics and communication

### CHAPTER-5 APPLICATION OF SYMBIOTIC ORGANISMS SEARCH ALGORITHM

100 CHAPTER-5 APPLICATION OF SYMBIOTIC ORGANISMS SEARCH ALGORITHM 5.1 INTRODUCTION The progressive increase in electrical demand has been the cause for technical problems to the utility companies such

### A Hybrid Fireworks Optimization Method with Differential Evolution Operators

A Fireworks Optimization Method with Differential Evolution Operators YuJun Zheng a,, XinLi Xu a, HaiFeng Ling b a College of Computer Science & Technology, Zhejiang University of Technology, Hangzhou,

### Genetic-PSO Fuzzy Data Mining With Divide and Conquer Strategy

Genetic-PSO Fuzzy Data Mining With Divide and Conquer Strategy Amin Jourabloo Department of Computer Engineering, Sharif University of Technology, Tehran, Iran E-mail: jourabloo@ce.sharif.edu Abstract

### Modified Particle Swarm Optimization with Novel Modulated Inertia for Velocity Update

Modified Particle Swarm Optimization with Novel Modulated Inertia for Velocity Update Abdul Hadi Hamdan #1, Fazida Hanim Hashim #2, Abdullah Zawawi Mohamed *3, W. M. Diyana W. Zaki #4, Aini Hussain #5

### PARTICLE SWARM OPTIMIZATION (PSO) [1] is an

Proceedings of International Joint Conference on Neural Netorks, Atlanta, Georgia, USA, June -9, 9 Netork-Structured Particle Sarm Optimizer Considering Neighborhood Relationships Haruna Matsushita and

### FDR PSO-Based Optimization for Non-smooth Functions

M. Anitha, et al. / International Energy Journal 0 (009) 37-44 37 www.serd.ait.ac.th/reric FDR PSO-Based Optimization for n-smooth Functions M. Anitha*, S. Subramanian* and R. Gnanadass + Abstract In this

### High-speed Interconnect Simulation Using Particle Swarm Optimization

1 High-speed Interconnect Simulation Using Particle Swarm Optimization Subas Bastola and Chen-yu Hsu Intel Corporation subas.bastola@intel.com, chen-yu.hsu@intel.com Abstract Particle Swarm Optimization

### Chapter 14 Global Search Algorithms

Chapter 14 Global Search Algorithms An Introduction to Optimization Spring, 2015 Wei-Ta Chu 1 Introduction We discuss various search methods that attempts to search throughout the entire feasible set.

### PARTICLE SWARM OPTIMISATION APPLIED TO ECONOMIC LOAD DISPATCH PROBLEM

PARTICLE SWARM OPTIMISATION APPLIED TO ECONOMIC LOAD DISPATCH PROBLEM A THESIS SUBMITTED IN PARTIAL FULFILLMENT OF THE REQUIREMENTS FOR THE DEGREE OF Master of Technology In Power Control and Drives By

### The Pennsylvania State University. The Graduate School. Department of Electrical Engineering COMPARISON OF CAT SWARM OPTIMIZATION WITH PARTICLE SWARM

The Pennsylvania State University The Graduate School Department of Electrical Engineering COMPARISON OF CAT SWARM OPTIMIZATION WITH PARTICLE SWARM OPTIMIZATION FOR IIR SYSTEM IDENTIFICATION A Thesis in

### Constraints in Particle Swarm Optimization of Hidden Markov Models

Constraints in Particle Swarm Optimization of Hidden Markov Models Martin Macaš, Daniel Novák, and Lenka Lhotská Czech Technical University, Faculty of Electrical Engineering, Dep. of Cybernetics, Prague,

### Discrete Particle Swarm Optimization for TSP based on Neighborhood

Journal of Computational Information Systems 6:0 (200) 3407-344 Available at http://www.jofcis.com Discrete Particle Swarm Optimization for TSP based on Neighborhood Huilian FAN School of Mathematics and

### 1 Lab + Hwk 5: Particle Swarm Optimization

1 Lab + Hwk 5: Particle Swarm Optimization This laboratory requires the following equipment: C programming tools (gcc, make), already installed in GR B001 Webots simulation software Webots User Guide Webots

### Kyrre Glette INF3490 Evolvable Hardware Cartesian Genetic Programming

Kyrre Glette kyrrehg@ifi INF3490 Evolvable Hardware Cartesian Genetic Programming Overview Introduction to Evolvable Hardware (EHW) Cartesian Genetic Programming Applications of EHW 3 Evolvable Hardware

### SWITCHES ALLOCATION IN DISTRIBUTION NETWORK USING PARTICLE SWARM OPTIMIZATION BASED ON FUZZY EXPERT SYSTEM

SWITCHES ALLOCATION IN DISTRIBUTION NETWORK USING PARTICLE SWARM OPTIMIZATION BASED ON FUZZY EXPERT SYSTEM Tiago Alencar UFMA tiagoalen@gmail.com Anselmo Rodrigues UFMA schaum.nyquist@gmail.com Maria da

### [Kashyap*, 5(2): February, 2016] ISSN: (I2OR), Publication Impact Factor: 3.785

IJESRT INTERNATIONAL JOURNAL OF ENGINEERING SCIENCES & RESEARCH TECHNOLOGY DETERMINATION OF OPTIMAL LOCATION OF SVC CONTROLLER DEVICES IN ELECTRIC TRANSMISSION SYSTEM BY USING PSO METHOD Vibha Kashyap*,

### ARTIFICIAL INTELLIGENCE (CSCU9YE ) LECTURE 5: EVOLUTIONARY ALGORITHMS

ARTIFICIAL INTELLIGENCE (CSCU9YE ) LECTURE 5: EVOLUTIONARY ALGORITHMS Gabriela Ochoa http://www.cs.stir.ac.uk/~goc/ OUTLINE Optimisation problems Optimisation & search Two Examples The knapsack problem

### ATI Material Do Not Duplicate ATI Material. www. ATIcourses.com. www. ATIcourses.com

ATI Material Material Do Not Duplicate ATI Material Boost Your Skills with On-Site Courses Tailored to Your Needs www.aticourses.com The Applied Technology Institute specializes in training programs for

### GRID SCHEDULING USING ENHANCED PSO ALGORITHM

GRID SCHEDULING USING ENHANCED PSO ALGORITHM Mr. P.Mathiyalagan 1 U.R.Dhepthie 2 Dr. S.N.Sivanandam 3 1 Lecturer 2 Post Graduate Student 3 Professor and Head Department of Computer Science and Engineering

### CHAPTER 2 MULTI-OBJECTIVE REACTIVE POWER OPTIMIZATION

19 CHAPTER 2 MULTI-OBJECTIE REACTIE POWER OPTIMIZATION 2.1 INTRODUCTION In this chapter, a fundamental knowledge of the Multi-Objective Optimization (MOO) problem and the methods to solve are presented.

### A Novel Approach to Solve Unit Commitment and Economic Load Dispatch Problem using IDE-OBL

Journal of Scientific & Industrial Research Vol. 74, July 2015, pp. 395-399 A Novel Approach to Solve Unit Commitment and Economic Load Dispatch Problem using IDE-OBL P Surekha 1 * and S Sumathi 2 *1,2

### Artificial bee colony algorithm with multiple onlookers for constrained optimization problems

Artificial bee colony algorithm with multiple onlookers for constrained optimization problems Milos Subotic Faculty of Computer Science University Megatrend Belgrade Bulevar umetnosti 29 SERBIA milos.subotic@gmail.com

### Parameter Estimation of PI Controller using PSO Algorithm for Level Control

Parameter Estimation of PI Controller using PSO Algorithm for Level Control 1 Bindutesh V.Saner, 2 Bhagsen J.Parvat 1,2 Department of Instrumentation & control Pravara Rural college of Engineering, Loni

### Using CODEQ to Train Feed-forward Neural Networks

Using CODEQ to Train Feed-forward Neural Networks Mahamed G. H. Omran 1 and Faisal al-adwani 2 1 Department of Computer Science, Gulf University for Science and Technology, Kuwait, Kuwait omran.m@gust.edu.kw

### A Comparative Study of Genetic Algorithm and Particle Swarm Optimization

IOSR Journal of Computer Engineering (IOSR-JCE) e-issn: 2278-0661,p-ISSN: 2278-8727 PP 18-22 www.iosrjournals.org A Comparative Study of Genetic Algorithm and Particle Swarm Optimization Mrs.D.Shona 1,

### 2009 International Conference of Soft Computing and Pattern Recognition

2009 International Conference of Soft Computing and Pattern Recognition Implementing Particle Swarm Optimization to Solve Economic Load Dispatch Problem Abolfazl Zaraki Control and instrumentation Engineering

### Discrete Multi-Valued Particle Swarm Optimization

Discrete Multi-d Particle Swarm Optimization Jim Pugh and Alcherio Martinoli Swarm-Intelligent Systems Group École Polytechnique Fédérale de Lausanne 05 Lausanne, Switzerland Email: {jim.pugh,alcherio.martinoli}@epfl.ch

### Hybrid of Ant Colony Optimization and Gravitational Emulation Based Load Balancing Strategy in Cloud Computing

Hybrid of Ant Colony Optimization and Gravitational Emulation Based Load Balancing Strategy in Cloud Computing Jyoti Yadav 1, Dr. Sanjay Tyagi 2 1M.Tech. Scholar, Department of Computer Science & Applications,

### Research Article Path Planning Using a Hybrid Evolutionary Algorithm Based on Tree Structure Encoding

e Scientific World Journal, Article ID 746260, 8 pages http://dx.doi.org/10.1155/2014/746260 Research Article Path Planning Using a Hybrid Evolutionary Algorithm Based on Tree Structure Encoding Ming-Yi

### Inertia Weight. v i = ωv i +φ 1 R(0,1)(p i x i )+φ 2 R(0,1)(p g x i ) The new velocity update equation:

Convergence of PSO The velocity update equation: v i = v i +φ 1 R(0,1)(p i x i )+φ 2 R(0,1)(p g x i ) for some values of φ 1 and φ 2 the velocity grows without bound can bound velocity to range [ V max,v

### A Native Approach to Cell to Switch Assignment Using Firefly Algorithm

International Journal of Engineering Inventions ISSN: 2278-7461, www.ijeijournal.com Volume 1, Issue 2(September 2012) PP: 17-22 A Native Approach to Cell to Switch Assignment Using Firefly Algorithm Apoorva

### Particle Swarm Optimization Based Approach for Location Area Planning in Cellular Networks

International Journal of Intelligent Systems and Applications in Engineering Advanced Technology and Science ISSN:2147-67992147-6799 www.atscience.org/ijisae Original Research Paper Particle Swarm Optimization

### An Island Based Hybrid Evolutionary Algorithm for Optimization

An Island Based Hybrid Evolutionary Algorithm for Optimization Changhe Li and Shengxiang Yang Department of Computer Science, University of Leicester University Road, Leicester LE1 7RH, UK {cl160,s.yang}@mcs.le.ac.uk

### 1 Lab 5: Particle Swarm Optimization

1 Lab 5: Particle Swarm Optimization This laboratory requires the following: (The development tools are installed in GR B0 01 already): C development tools (gcc, make, etc.) Webots simulation software

### Artificial Bee Colony (ABC) Optimization Algorithm for Solving Constrained Optimization Problems

Artificial Bee Colony (ABC) Optimization Algorithm for Solving Constrained Optimization Problems Dervis Karaboga and Bahriye Basturk Erciyes University, Engineering Faculty, The Department of Computer

### The movement of the dimmer firefly i towards the brighter firefly j in terms of the dimmer one s updated location is determined by the following equat

An Improved Firefly Algorithm for Optimization Problems Amarita Ritthipakdee 1, Arit Thammano, Nol Premasathian 3, and Bunyarit Uyyanonvara 4 Abstract Optimization problem is one of the most difficult

### Ant Colony Based Load Flow Optimisation Using Matlab

Ant Colony Based Load Flow Optimisation Using Matlab 1 Kapil Upamanyu, 2 Keshav Bansal, 3 Miteshwar Singh Department of Electrical Engineering Delhi Technological University, Shahbad Daulatpur, Main Bawana

### SIMULTANEOUS COMPUTATION OF MODEL ORDER AND PARAMETER ESTIMATION FOR ARX MODEL BASED ON MULTI- SWARM PARTICLE SWARM OPTIMIZATION

SIMULTANEOUS COMPUTATION OF MODEL ORDER AND PARAMETER ESTIMATION FOR ARX MODEL BASED ON MULTI- SWARM PARTICLE SWARM OPTIMIZATION Kamil Zakwan Mohd Azmi, Zuwairie Ibrahim and Dwi Pebrianti Faculty of Electrical

### MOST of power system optimization problems including

34 IEEE TRANSACTIONS ON POWER SYSTEMS, VOL. 20, NO. 1, FEBRUARY 2005 A Particle Swarm Optimization for Economic Dispatch With Nonsmooth Cost Functions Jong-Bae Park, Member, IEEE, Ki-Song Lee, Joong-Rin

### Small World Network Based Dynamic Topology for Particle Swarm Optimization

Small World Network Based Dynamic Topology for Particle Swarm Optimization Qingxue Liu 1,2, Barend Jacobus van Wyk 1 1 Department of Electrical Engineering Tshwane University of Technology Pretoria, South