FACTS Placement Optimization For Multi-Line Contignecies Josh Wilkerson November 30, 2005.

Slides:



Advertisements
Similar presentations
Fitness Uniform Deletion: A Simple Way to Preserve Diversity Shane Legg & Marcus Hutter IDSIA Galleria Manno-Lugano Switzerland.
Advertisements

Local Search Algorithms
Exact and heuristics algorithms
Parameter control Chapter 8. A.E. Eiben and J.E. Smith, Introduction to Evolutionary Computing Parameter Control in EAs 2 Motivation 1 An EA has many.
Genetic Algorithms Representation of Candidate Solutions GAs on primarily two types of representations: –Binary-Coded –Real-Coded Binary-Coded GAs must.
1 Lecture 8: Genetic Algorithms Contents : Miming nature The steps of the algorithm –Coosing parents –Reproduction –Mutation Deeper in GA –Stochastic Universal.
Improved Crowd Control Utilizing a Distributed Genetic Algorithm John Chaloupek December 3 rd, 2003.
Multi-Objective Evolutionary Algorithms Matt D. Johnson April 19, 2007.
Evolutionary Computational Inteliigence Lecture 6a: Multimodality.
Iterative Improvement Algorithms
Evolution of Cascading Failures in Power Transmission Systems OR How to turn off the lights Richard Wilson.
Eng 101 – Seeds of Success Social and Ethical Implications of Artificial Intelligence Daniel Tauritz, Ph.D. Associate Professor of Computer Science.
Intro to AI Genetic Algorithm Ruth Bergman Fall 2002.
Evolutionary Computational Intelligence Lecture 9: Noisy Fitness Ferrante Neri University of Jyväskylä.
Applying Evolutionary Algorithm to Chaco Tool on the Partitioning of Power Transmission System (CS448 Class Project) Yan Sun.
Evolutionary Computational Intelligence
Evolutionary Computation Application Peter Andras peter.andras/lectures.
Intro to AI Genetic Algorithm Ruth Bergman Fall 2004.
Genetic Algorithm What is a genetic algorithm? “Genetic Algorithms are defined as global optimization procedures that use an analogy of genetic evolution.
Chapter 6: Transform and Conquer Genetic Algorithms The Design and Analysis of Algorithms.
Tutorial 4 (Lecture 12) Remainder from lecture 10: The implicit fitness sharing method Exercises – any solutions? Questions?
Genie: A Genetic Placement Algorithm James P. Cohoon William D. Paris © 1987 IEEE.
Prepared by Barış GÖKÇE 1.  Search Methods  Evolutionary Algorithms (EA)  Characteristics of EAs  Genetic Programming (GP)  Evolutionary Programming.
Genetic Algorithm.
Slides are based on Negnevitsky, Pearson Education, Lecture 12 Hybrid intelligent systems: Evolutionary neural networks and fuzzy evolutionary systems.
Introduction to Genetic Algorithms and Evolutionary Computation
SOFT COMPUTING (Optimization Techniques using GA) Dr. N.Uma Maheswari Professor/CSE PSNA CET.
© Negnevitsky, Pearson Education, Lecture 10 Evolutionary Computation: Evolution strategies and genetic programming Evolution strategies Evolution.
Optimization in Engineering Design Georgia Institute of Technology Systems Realization Laboratory Mixed Integer Problems Most optimization algorithms deal.
Lecture 8: 24/5/1435 Genetic Algorithms Lecturer/ Kawther Abas 363CS – Artificial Intelligence.
Zorica Stanimirović Faculty of Mathematics, University of Belgrade
Genetic Algorithms Michael J. Watts
Design of a real time strategy game with a genetic AI By Bharat Ponnaluri.
Boltzmann Machine (BM) (§6.4) Hopfield model + hidden nodes + simulated annealing BM Architecture –a set of visible nodes: nodes can be accessed from outside.
What is Genetic Programming? Genetic programming is a model of programming which uses the ideas (and some of the terminology) of biological evolution to.
Genetic algorithms Charles Darwin "A man who dares to waste an hour of life has not discovered the value of life"
L ECTURE 3 Notes are modified from EvoNet Flying Circus slides. Found at: www2.cs.uh.edu/~ceick/ai/EC1.ppt.
GENETIC ALGORITHM A biologically inspired model of intelligence and the principles of biological evolution are applied to find solutions to difficult problems.
EE459 I ntroduction to Artificial I ntelligence Genetic Algorithms Kasin Prakobwaitayakit Department of Electrical Engineering Chiangmai University.
1 A New Method for Composite System Annualized Reliability Indices Based on Genetic Algorithms Nader Samaan, Student,IEEE Dr. C. Singh, Fellow, IEEE Department.
*Partially funded by the Austrian Grid Project (BMBWK GZ 4003/2-VI/4c/2004) Making the Best of Your Data - Offloading Visualization Tasks onto the Grid.
Genetic Algorithms What is a GA Terms and definitions Basic algorithm.
ECE 103 Engineering Programming Chapter 52 Generic Algorithm Herbert G. Mayer, PSU CS Status 6/4/2014 Initial content copied verbatim from ECE 103 material.
Evolutionary Computing Chapter 5. / 32 Chapter 5: Fitness, Selection and Population Management Selection is second fundamental force for evolutionary.
Probabilistic Algorithms Evolutionary Algorithms Simulated Annealing.
Parallel Genetic Algorithms By Larry Hale and Trevor McCasland.
Coevolutionary Automated Software Correction Josh Wilkerson PhD Candidate in Computer Science Missouri S&T.
Optimization Problems
GENETIC ALGORITHM Basic Algorithm begin set time t = 0;
Genetic Algorithms Chapter Description of Presentations
Genetic Algorithm Dr. Md. Al-amin Bhuiyan Professor, Dept. of CSE Jahangirnagar University.
Selection and Recombination Temi avanzati di Intelligenza Artificiale - Lecture 4 Prof. Vincenzo Cutello Department of Mathematics and Computer Science.
Artificial Intelligence By Mr. Ejaz CIIT Sahiwal Evolutionary Computation.
CAP6938 Neuroevolution and Artificial Embryogeny Evolutionary Comptation Dr. Kenneth Stanley January 23, 2006.
Genetic Algorithms And other approaches for similar applications Optimization Techniques.
Genetic Algorithm(GA)
Genetic Algorithms and Evolutionary Programming A Brief Overview.
 Presented By: Abdul Aziz Ghazi  Roll No:  Presented to: Sir Harris.
Hirophysics.com The Genetic Algorithm vs. Simulated Annealing Charles Barnes PHY 327.
 Negnevitsky, Pearson Education, Lecture 12 Hybrid intelligent systems: Evolutionary neural networks and fuzzy evolutionary systems n Introduction.
Warehouse Lending Optimization Paul Parker (2016).
Optimization Problems
Chapter 14 Genetic Algorithms.
Genetic Algorithms.
Evolutionary Algorithms Jim Whitehead
Advanced Artificial Intelligence Evolutionary Search Algorithm
Optimization Problems
EE368 Soft Computing Genetic Algorithms.
Boltzmann Machine (BM) (§6.4)
Coevolutionary Automated Software Correction
Presentation transcript:

FACTS Placement Optimization For Multi-Line Contignecies Josh Wilkerson November 30, 2005

What’s the Problem? Line goes down in the power grid Load is redistributed sub-optimally Another line is overloaded due to new distribution Wash, rinse, repeat Continues on until islanding occurs or load reaches steady state Rolling black out occurs (a.k.a. Cascading Failure)  Similar what happened in August, 2003

What’s the Problem? Why does the grid behave this way?  Not intended for this kind of use  Clash between physics and economics Cascading failure => great physical and economical damage Need something to hold us over until the much needed expansion is done

A Means to an Answer Flexible AC Transmission System (FACTS) Enhances controllability and power transfer capability More control is given to the way load is distributed

A Means to an Answer So why not just put FACTS devices on every line? A single FACTS device is very expensive New Problem: How to place a minimum number of FACTS devices while still providing a certain level security to the grid Solution can be attained by analyzing how the grid behaves after one or more lines go down

What’s Been Done? A number of the scenarios involving one line going down (single line contingency) Using brute force Using evolutionary computation Next step: scenarios involving multi-line contingencies

What’s Been Done? Not much work (if any) done involving MLC’s and FACTS placement  It would be more fitting to analyze a placement in the face of MLC’s rather than SLC’s.

My Plan Brute force?  Way too many scenarios to consider  On the order of 2*10 13 scenarios to consider for 2 line MLC’s and 5 FACTS devices on the IEEE 118-Bus Leaves only evolutionary computation

Why an EA? Problem space is huge Problem space is generally unknown The potential time saved vs. deterministic algorithm This is the type of problem EA’s were made for

EA Details Modify the ‘blackbox’ code from assignment 2 to allow for MLC’s In an attempt to stay par with the SLC version, run 180 MLC scenarios 6 Parameter sets  3 base sets which vary on contingency mode used: SLC mode, 2 Line MLC, 3 Line MLC

EA Details Representation  Use fixed length arrays to represent the lines which FACTS devices are placed on Fitness Evaluation  Select random lines to be involved in each MLC scenario using Monte Carlo sampling  Take the average PI Metric across MLC scenarios considered for each placement

EA Details Population  Size: 75  Number of Parent Pairs: 20  Number of Offspring per Parent Pair: 2

EA Details Selection Method  Boltzmann scheme Varying selective pressure based off of population diversity (simulated annealing)

EA Details

Selection Method  How diversity is gauged Percentage of solutions within half a standard deviation of the average  Should result in the population bouncing from optima to optima until it gets stuck on global optima

EA Details Recombination  Uniform recombination Mutation  Individual Mutation (80%)  Gene Mutation (20% or 40%) No genetic clones allowed!

EA Details Parameter Set 1:  SLC  20% gene mutation chance Parameter Set 2:  SLC  40% gene mutation chance Parameter Set 3:  2 Line MLC  20% gene mutation chance Parameter Set 4:  2 Line MLC  40% gene mutation chance Parameter Set 5:  3 Line MLC  20% gene mutation chance Parameter Set 6:  3 Line MLC  40% gene mutation chance

EA Details The Goal:  Two Objectives: 1. Initial mapping of problem space 2. See how highly fit MLC placements perform in SLC scenarios

Results Some surprising, some not so surprising

Results

Test of highly fit placements from MLC scenarios in SLC scenarios  Were not even competitive with results from SLC EA  Some even performed worse in SLC scenarios than they did in MLC scenarios

Results Summary:  As the number of lines involved in the contingency increases, so does the PI  Standard deviation also seems to rise as the number of lines in contingency rises  Boltzmann scheme seems to be working as intended  Need better way to pick lines for MLC scenarios, placements getting ‘lucky’ with random lines.

Questions?