Introduction to Evolutionary Computing

Slides:



Advertisements
Similar presentations
Logical and Artificial Intelligence in Games Lecture 14
Advertisements

Biologically Inspired AI (mostly GAs). Some Examples of Biologically Inspired Computation Neural networks Evolutionary computation (e.g., genetic algorithms)
EvoNet Flying Circus Introduction to Evolutionary Computation Brought to you by (insert your name) The EvoNet Training Committee The EvoNet Flying Circus.
Evolutionary Computing A Practical Introduction Presented by Ben Paechter Napier University with thanks to the EvoNet Training Committee and its “Flying.
Introduction to Evolutionary Computing I A.E. Eiben Free University Amsterdam with thanks to the EvoNet Training Committee and.
Genetic Algorithms. Some Examples of Biologically Inspired AI Neural networks Evolutionary computation (e.g., genetic algorithms) Immune-system-inspired.
Genetic Algorithms1 COMP305. Part II. Genetic Algorithms.
Introduction to Genetic Algorithms Yonatan Shichel.
Evolutionary ComputingIntroduction1 Introduction, Part I Positioning of EC and the basic EC metaphor Historical perspective Biological inspiration: – Darwinian.
Genetic Algorithms Learning Machines for knowledge discovery.
Natural Computation: computational models inspired by nature Dr. Daniel Tauritz Department of Computer Science University of Missouri-Rolla CS347 Lecture.
Introduction Chapter 1.
Genetic Algorithms Nehaya Tayseer 1.Introduction What is a Genetic algorithm? A search technique used in computer science to find approximate solutions.
CS 447 Advanced Topics in Artificial Intelligence Fall 2002.
Intro to AI Genetic Algorithm Ruth Bergman Fall 2004.
Genetic Algorithms Overview Genetic Algorithms: a gentle introduction –What are GAs –How do they work/ Why? –Critical issues Use in Data Mining –GAs.
Christoph F. Eick: Applying EC to TSP(n) Example: Applying EC to the TSP Problem  Given: n cities including the cost of getting from on city to the other.
Introduction A.E. Eiben and J.E. Smith, Introduction to Evolutionary Computing Chapter 1 1.
Evolutionary Intelligence
Introduction Chapter 1. A.E. Eiben and J.E. Smith, Introduction to Evolutionary Computing Introduction Contents The basic EC metaphor Historical perspective.
Evolution Strategies Evolutionary Programming Genetic Programming Michael J. Watts
Genetic algorithms Prof Kang Li
Introduction Chapter 1. A.E. Eiben and J.E. Smith, Introduction to Evolutionary Computing Introduction with additions/modification by Christoph F. Eick.
Lecture 8: 24/5/1435 Genetic Algorithms Lecturer/ Kawther Abas 363CS – Artificial Intelligence.
An Introduction to Genetic Algorithms Lecture 2 November, 2010 Ivan Garibay
1 Machine Learning: Lecture 12 Genetic Algorithms (Based on Chapter 9 of Mitchell, T., Machine Learning, 1997)
Evolutionary Computation Dean F. Hougen w/ contributions from Pedro Diaz-Gomez & Brent Eskridge Robotics, Evolution, Adaptation, and Learning Laboratory.
G ENETIC A LGORITHMS Ranga Rodrigo March 5,
1 Genetic Algorithms K.Ganesh Introduction GAs and Simulated Annealing The Biology of Genetics The Logic of Genetic Programmes Demo Summary.
Evolutionary Computing Chapter 2. / 24 Chapter 2: Evolutionary Computing: the Origins Historical perspective Biological inspiration: – Darwinian evolution.
Introduction to Genetic Algorithms. Genetic Algorithms We’ve covered enough material that we can write programs that use genetic algorithms! –More advanced.
Genetic Algorithms. 2 Overview Introduction To Genetic Algorithms (GAs) GA Operators and Parameters Genetic Algorithms To Solve The Traveling Salesman.
CITS7212: Computational Intelligence An Overview of Core CI Technologies Lyndon While.
D Nagesh Kumar, IIScOptimization Methods: M8L5 1 Advanced Topics in Optimization Evolutionary Algorithms for Optimization and Search.
Evolutionary Computing Chapter 1. / 20 Chapter 1: Problems to be solved Problems can be classified in different ways: Black box model Search problems.
1 Autonomic Computer Systems Evolutionary Computation Pascal Paysan.
An Introduction to Genetic Algorithms Lecture 2 November, 2010 Ivan Garibay
General information Theoretic basis of evolutionary computing. The general scheme of evolutionary algorithms General information Theoretic basis of evolutionary.
Genetic Algorithms. Solution Search in Problem Space.
Genetic Algorithms And other approaches for similar applications Optimization Techniques.
Genetic Algorithm. Outline Motivation Genetic algorithms An illustrative example Hypothesis space search.
Genetic Algorithms.
Introduction to Genetic Algorithms
Genetic Algorithm in TDR System
Genetic Algorithms.
Evolutionary Computation
Evolution Strategies Evolutionary Programming
Introduction to Genetic Algorithm (GA)
Example: Applying EC to the TSP Problem
CSC 380: Design and Analysis of Algorithms
Basics of Genetic Algorithms (MidTerm – only in RED material)
Introduction Chapter 1.
Example: Applying EC to the TSP Problem
Example: Applying EC to the TSP Problem
Natural Selection & Evolution
GENETIC ALGORITHMS & MACHINE LEARNING
Dr. Unnikrishnan P.C. Professor, EEE
Basics of Genetic Algorithms
EE368 Soft Computing Genetic Algorithms.
Boltzmann Machine (BM) (§6.4)
Searching for solutions: Genetic Algorithms
A Gentle introduction Richard P. Simpson
Machine Learning: UNIT-4 CHAPTER-2
Introduction Chapter 1.
Artificial Intelligence CIS 342
Genetic Algorithm Soft Computing: use of inexact t solution to compute hard task problems. Soft computing tolerant of imprecision, uncertainty, partial.
Population Based Metaheuristics
CSC 380: Design and Analysis of Algorithms
Coevolutionary Automated Software Correction
Presentation transcript:

Introduction to Evolutionary Computing Chapter 1

Contents Key components of an EC system Positioning of EC and the basic EC metaphor Historical perspective Biological inspiration: Darwinian evolution theory (simplified!) Genetics (simplified!) Motivation for EC What can EC do: examples of application areas

Key Components of an EC System Idea: Applies biological evolution to a population of solutions Given: Fitness Function Chromosomal Representation EC System Selection Mechanism Genetic Operators Population Management Kind of Survival of the fittest

The Evolutionary Cycle Selection Parents Recombination Population Mutation Replacement Offspring

The Ingredients Population t reproduction t + 1 selection Fitness function recombination mutation 7 2 Survival of Fittest

Different Views of EC/EA/GA/EP The techniques and technology that is discussed in this course can be viewed as: An approach to computational intelligence and for soft computing A search paradigm As an approach for machine learning As a method to simulate biological systems As a subfield of artificial life As generators for new ideas, new designs and for music and computer art

You are here

Backtracking Hillclimbing Simulated A* EC EC as Search Search Techniques Backtracking Hillclimbing Simulated A* EC Annealing

Learning from Examples Reinforcement Learning Classifier Systems EC as Machine Learning Machine Learning Learning from Examples Reinforcement Learning Classifier Systems Genetic Programming …

EC as Randomized Algorithms Deterministic Algorithms Randomized Algorithms EC Question: Advantages of Randomized Algorithms

Positioning of EC EC is part of computer science EC is not part of life sciences/biology Biology delivered inspiration and terminology EC can be applied in biological research

The Main Evolutionary Computing Metaphor Environment Individual Fitness PROBLEM SOLVING Problem Candidate Solution Quality Fitness  chances for survival and reproduction Quality  chance for seeding new solutions

Darwinian Evolution 1: Survival of the fittest All environments have finite resources (i.e., can only support a limited number of individuals) Lifeforms have basic instinct/ lifecycles geared towards reproduction Therefore some kind of selection is inevitable Those individuals that compete for the resources most effectively have increased chance of reproduction Note: fitness in natural evolution is a derived, secondary measure, i.e., we (humans) assign a high fitness to individuals with many offspring

Darwinian Evolution 2: Diversity drives change Phenotypic traits: Behaviour / physical differences that affect response to environment Partly determined by inheritance, partly by factors during development Unique to each individual, partly as a result of random changes If phenotypic traits: Lead to higher chances of reproduction Can be inherited then they will tend to increase in subsequent generations, leading to new combinations of traits …

Darwinian Evolution:Summary Population consists of diverse set of individuals Combinations of traits that are better adapted tend to increase representation in population Individuals are “units of selection” Variations occur through random changes yielding constant source of diversity, coupled with selection means that: Population is the “unit of evolution” Note the absence of “guiding force”; evolution occurs probabilistically in a distributed enviroment.

Natural Genetics The information required to build a living organism is coded in the DNA of that organism Genotype (DNA inside) determines phenotype Genes  phenotypic traits is a complex mapping One gene may affect many traits (pleiotropy) Many genes may affect one trait (polygeny) Small changes in the genotype lead to small changes in the organism (e.g., height, hair colour)

2 Types of Evolutionary Computing Systems Approach 1: Reduce it to an GA, ES, GP,… Problem Fitness function Phenotype decode Genotype Given: GP, ES, GA,… Crossover/mutation

2 Types of Evolutionary Computing Systems Approach 2: Define Problem-Specific Mutation and Crossover Operators Defined for the problem at hand Genotype/ Phenotype Fitness function Crossover/mutation

Crossing-over in Humans Chromosome pairs align and duplicate Inner pairs link at a centromere and swap parts of themselves Outcome is one copy of maternal/paternal chromosome plus two entirely new combinations After crossing-over one of each pair goes into each gamete

Mutation Occasionally some of the genetic material changes very slightly during this process (replication error) This means that the child might have genetic material information not inherited from either parent This can be catastrophic: offspring in not viable (most likely) neutral: new feature not influences fitness advantageous: strong new feature occurs Redundancy in the genetic code forms a good way of error checking

Problem type 1 : Optimization We have a model of our system and seek inputs that give us a specified goal e.g. time tables for university, call center, or hospital design specifications, etc etc

Optimisation example 1: University timetabling Enormously big search space Timetables must be good “Good” is defined by a number of competing criteria Timetables must be feasible Vast majority of search space is infeasible

Optimisation example 2: Satellite structure Optimized satellite designs for NASA to maximize vibration isolation Evolving: design structures Fitness: vibration resistance Evolutionary “creativity”

Problem types 2: Modelling We have corresponding sets of inputs & outputs and seek model that delivers correct output for every known input Evolutionary machine learning

Modelling example: loan applicant creditibility British bank evolved creditability model to predict loan paying behavior of new applicants Evolving: prediction models Fitness: model accuracy on historical data

Problem type 3: Simulation We have a given model and wish to know the outputs that arise under different input conditions Often used to answer “what-if” questions in evolving dynamic environments e.g. Evolutionary economics, Artificial Life

Simulation example: evolving artificial societies Simulating trade, economic competition, etc. to calibrate models Use models to optimise strategies and policies Evolutionary economy Survival of the fittest is universal (big/small fish)

Problem type 4: Building Systems that Adapt We have a model and want to adapt it based on feedback from the environment Model behavior Environmental response adaptation

Example Problem type 4: Poker Systems that Play Poker …

What is unique about EC? Christoph F. Eick EC approaches work on multiple solutions in parallel (a complete population) and not a single solution. Employ crossover operators which take 2 solutions and create a new solution which shares some properties with the parent solution; traditional search techniques only employ mutation operators. Can solve problems for which fitness functions are neither differentiable nor continuous. Can operate on symbolic or integer-valued fitness functions. They employ probabilistic, non-deterministic search strategies which are capable to find different good solutions in a single or in different runs. They are based on the survival of the fittest: the genetic material of fitter solutions is recombined with a higher probability. What is unique about EC? Christoph F. Eick