Optimal Placement of Wind Turbines Using Genetic Algorithms

Slides:



Advertisements
Similar presentations
Algorithm Design Techniques
Advertisements

Exact and heuristics algorithms
Genetic Algorithms Contents 1. Basic Concepts 2. Algorithm
Genetic Algorithms Representation of Candidate Solutions GAs on primarily two types of representations: –Binary-Coded –Real-Coded Binary-Coded GAs must.
Non-Linear Problems General approach. Non-linear Optimization Many objective functions, tend to be non-linear. Design problems for which the objective.
COMP305. Part II. Genetic Algorithms. Genetic Algorithms.
A new crossover technique in Genetic Programming Janet Clegg Intelligent Systems Group Electronics Department.
COMP305. Part II. Genetic Algorithms. Genetic Algorithms.
Artificial Intelligence Genetic Algorithms and Applications of Genetic Algorithms in Compilers Prasad A. Kulkarni.
Intro to AI Genetic Algorithm Ruth Bergman Fall 2002.
Design of Curves and Surfaces by Multi Objective Optimization Rony Goldenthal Michel Bercovier School of Computer Science and Engineering The Hebrew University.
Genetic Algorithms Nehaya Tayseer 1.Introduction What is a Genetic algorithm? A search technique used in computer science to find approximate solutions.
7/2/2015Intelligent Systems and Soft Computing1 Lecture 9 Evolutionary Computation: Genetic algorithms Introduction, or can evolution be intelligent? Introduction,
Intro to AI Genetic Algorithm Ruth Bergman Fall 2004.
Chapter 6: Transform and Conquer Genetic Algorithms The Design and Analysis of Algorithms.
Ranga Rodrigo April 6, 2014 Most of the sides are from the Matlab tutorial. 1.
Genetic Algorithm.
Evolutionary Intelligence
© Negnevitsky, Pearson Education, CSC 4510 – Machine Learning Dr. Mary-Angela Papalaskari Department of Computing Sciences Villanova University.
SOFT COMPUTING (Optimization Techniques using GA) Dr. N.Uma Maheswari Professor/CSE PSNA CET.
Intro. ANN & Fuzzy Systems Lecture 36 GENETIC ALGORITHM (1)
Optimization in Engineering Design Georgia Institute of Technology Systems Realization Laboratory Mixed Integer Problems Most optimization algorithms deal.
Zorica Stanimirović Faculty of Mathematics, University of Belgrade
Genetic Algorithms Michael J. Watts
Boltzmann Machine (BM) (§6.4) Hopfield model + hidden nodes + simulated annealing BM Architecture –a set of visible nodes: nodes can be accessed from outside.
Genetic algorithms Charles Darwin "A man who dares to waste an hour of life has not discovered the value of life"
The Generational Control Model This is the control model that is traditionally used by GP systems. There are a distinct number of generations performed.
Applying Genetic Algorithm to the Knapsack Problem Qi Su ECE 539 Spring 2001 Course Project.
Genetic Algorithms K.Ganesh Reasearch Scholar, Ph.D., Industrial Management Division, Humanities and Social Sciences Department, Indian Institute of Technology.
FINAL EXAM SCHEDULER (FES) Department of Computer Engineering Faculty of Engineering & Architecture Yeditepe University By Ersan ERSOY (Engineering Project)
Genetic Algorithms Siddhartha K. Shakya School of Computing. The Robert Gordon University Aberdeen, UK
© Negnevitsky, Pearson Education, Lecture 9 Evolutionary Computation: Genetic algorithms Introduction, or can evolution be intelligent? Introduction,
Last lecture summary. SOM supervised x unsupervised regression x classification Topology? Main features? Codebook vector? Output from the neuron?
 Negnevitsky, Pearson Education, Lecture 9 Evolutionary Computation: Genetic algorithms n Introduction, or can evolution be intelligent? n Simulation.
1 Genetic Algorithms and Ant Colony Optimisation.
Genetic Algorithms CSCI-2300 Introduction to Algorithms
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.
Genetic Algorithms. 2 Overview Introduction To Genetic Algorithms (GAs) GA Operators and Parameters Genetic Algorithms To Solve The Traveling Salesman.
Evolutionary Algorithms K. Ganesh Research Scholar, Ph.D., Industrial Management Division, Humanities and Social Sciences Department, Indian Institute.
EE749 I ntroduction to Artificial I ntelligence Genetic Algorithms The Simple GA.
Genetic Algorithms. The Basic Genetic Algorithm 1.[Start] Generate random population of n chromosomes (suitable solutions for the problem) 2.[Fitness]
Solving Function Optimization Problems with Genetic Algorithms September 26, 2001 Cho, Dong-Yeon , Tel:
D Nagesh Kumar, IIScOptimization Methods: M8L5 1 Advanced Topics in Optimization Evolutionary Algorithms for Optimization and Search.
N- Queens Solution with Genetic Algorithm By Mohammad A. Ismael.
Genetic algorithms: A Stochastic Approach for Improving the Current Cadastre Accuracies Anna Shnaidman Uri Shoshani Yerach Doytsher Mapping and Geo-Information.
Application of the GA-PSO with the Fuzzy controller to the robot soccer Department of Electrical Engineering, Southern Taiwan University, Tainan, R.O.C.
1 Contents 1. Basic Concepts 2. Algorithm 3. Practical considerations Genetic Algorithm (GA)
Genetic Algorithms. Underlying Concept  Charles Darwin outlined the principle of natural selection.  Natural Selection is the process by which evolution.
Genetic Algorithm Dr. Md. Al-amin Bhuiyan Professor, Dept. of CSE Jahangirnagar University.
Agenda  INTRODUCTION  GENETIC ALGORITHMS  GENETIC ALGORITHMS FOR EXPLORING QUERY SPACE  SYSTEM ARCHITECTURE  THE EFFECT OF DIFFERENT MUTATION RATES.
Artificial Intelligence By Mr. Ejaz CIIT Sahiwal Evolutionary Computation.
1 Comparative Study of two Genetic Algorithms Based Task Allocation Models in Distributed Computing System Oğuzhan TAŞ 2005.
EVOLUTIONARY SYSTEMS AND GENETIC ALGORITHMS NAME: AKSHITKUMAR PATEL STUDENT ID: GRAD POSITION PAPER.
Genetic Algorithm(GA)
Genetic Algorithm. Outline Motivation Genetic algorithms An illustrative example Hypothesis space search.
 Presented By: Abdul Aziz Ghazi  Roll No:  Presented to: Sir Harris.
Warehouse Lending Optimization Paul Parker (2016).
1 Genetic Algorithms Contents 1. Basic Concepts 2. Algorithm 3. Practical considerations.
Genetic Algorithm (Knapsack Problem)
Using GA’s to Solve Problems
Genetic Algorithms.
Bulgarian Academy of Sciences
Artificial Intelligence (CS 370D)
CS621: Artificial Intelligence
Genetic Algorithms CSCI-2300 Introduction to Algorithms
EE368 Soft Computing Genetic Algorithms.
Boltzmann Machine (BM) (§6.4)
Artificial Intelligence CIS 342
Genetic algorithms: case study
Presentation transcript:

Optimal Placement of Wind Turbines Using Genetic Algorithms Michael Case, North Georgia College Shannon Grady, Mentor

Outline Background Problem Genetic Algorithm Modeling of Wind Farm Results MATLAB Compiler Future Research

Future of Wind Turbines in U.S. 6% of U.S. land area are good wind areas These areas have the potential to supply more than one and a half times the current electricity consumption of the United States This is why the development of placement and performance algorithms will be essential in escalating the development of turbine technology. Courtesy of U.S. Department of Energy

Wind Energy Research and Development A very conventional wind farm located in Denmark. The method used to the position the turbines seen here produces results similar to the genetic algorithm method employed here. http://www.afm.dtu.dk/wind/turbines/gallery.htm

Offshore Turbine Development Denmark is one of the leading nations in Wind Turbine technology, and is leading the way in offshore wind farm development. D.O.E. plans to convert abandoned offshore oil rigs into wind farms off the Louisiana Coast are already in action. http://www.afm.dtu.dk/wind/turbines/gallery.htm

Why Use Genetic Algorithms? Efficiency is affected by positioning in wind farms for multi-megawatt energy production Genetic Algorithms optimize the power output without dependence on gradients or local maxima

The Problem To use genetic search algorithms to support the findings of scientists in the wind industry who have sought to find the optimal positioning for wind turbines based on cost and power output. Genetic Algorithms converge rapidly for the “NP-Complete” class of problems, as more parameters are introduced into a system genetic algorithms usually become more and more efficient then other search algorithms that have been used to solve nonlinear problems of this class, which makes it ideal for our research involving turbine placement.

Genetic Algorithm Initially- Generate random population of n chromosomes (sqrt(200)*n, preferably) Fitness- Evaluate the fitness f(x) of each chromosome x in the population New population-Create a new population by repeating following steps until the new population is complete

Genetic Algorithms Selection- Chromosomes from a population are selected according to their fitness (more fit individuals have greater chance) See roulette wheel for example No. String Fitness % of Total 1 01101 169 14.4 2 11000 576 49.2 3 01000 64 5.5 4 10011 361 30.9 Total 1170 100.0

Genetic Algorithms Crossover- With a crossover probability cross over the parents to form new offspring (children). If no crossover was performed, offspring is the exact copy of parents. We used a crossover rate of .75. Chromosome 1 11011 | 00100110110 Chromosome 2 11011 | 11000011110 Offspring 1 Offspring 2

Genetic Algorithms Mutation- With a mutation probability mutate new offspring at each locus (position in chromosome). It is important to keep the mutation rate low (.001) to keep the search from becoming random. Original offspring 1 1101111000011110 Original offspring 2 1101100100110110 Mutated offspring 1 1100111000011110 Mutated offspring 2 1101101100110110

Genetic Algorithm Replacement- Use new generated population for a further run of the algorithm Evaluate-If the end condition is satisfied, stop, and return the best solution in current population Loop- Continue evaluating Fitness until the search terminates at 100%efficiency or the number of generations you assign is reached

Modeling a Wind Farm Velocity Downstream for a single turbine: Thrust Coefficient: The turbine thrust coefficient and the downstream rotor radius are linked to the axial induction factor α, and the rotor radius, Rr , by the Betz relations. u = wind speed downstream from the turbine u0 = initial wind speed α = entertainment constant α =axial induction r1 =down stream rotor radius x = distance downstream the turbine

Modeling a Wind Farm Resulting Velocity of n Turbines: Downstream Rotor Radius: R r =Rotor Radius Assuming that the K.E. deficit of a mixed wake is equal to the sum of the energy deficits. Entertainment Constant: z0=surface roughness of the site z = hub height of turbine

Cost and Fitness Functions Cost Function: Fitness Function: Ptot=total Power Nt =Number of Turbines Costtot=yearly cost ω1,2=act as weights for the fitness function.

Results Randomly Generated Result GA Generated Result X   X   Number of turbines is 50 Efficiency is 60.5% Total power output is 15,669 kWyear Number of turbines is 30 Efficiency is 92% Total power output is 14,310 kWyear

The MATLAB Compiler The MATLAB Compiler is a very powerful tool that can be used to create code from M-Files to C, C++, or Fortran 90/95 for a various number of platforms, and will allow for thousands of generations to be run on SP3 here at CSIT. http://www.csit.fsu.edu/supercomputer/fsu-sp.html

Future Research Parametric study of objective function and cost functions for various turbine models on land and sea Stochastic wind modeling and evaluation of equilibrium techniques Incorporation of helical wake model Introduction of simulated annealing into the optimization process Evaluation and development of cost/maintenance models