Introduction to Evolutionary Computing I A.E. Eiben Free University Amsterdam with thanks to the EvoNet Training Committee and.

Slides:



Advertisements
Similar presentations
Student : Mateja Saković 3015/2011.  Genetic algorithms are based on evolution and natural selection  Evolution is any change across successive generations.
Advertisements

Biologically Inspired Computing: Introduction to Evolutionary Algorithms This is lecture three of `Biologically Inspired Computing’ Contents: EA intro.
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.
Institute of Intelligent Power Electronics – IPE Page1 Introduction to Basics of Genetic Algorithms Docent Xiao-Zhi Gao Department of Electrical Engineering.
Monte Carlo Methods and the Genetic Algorithm Definitions and Considerations John E. Nawn MAT 5900 March 17 th, 2011.
Evolutionary Computing A Practical Introduction Presented by Ben Paechter Napier University with thanks to the EvoNet Training Committee and its “Flying.
Genetic Algorithms1 COMP305. Part II. Genetic Algorithms.
EvoNet Flying Circus Introduction to Evolutionary Computation Brought to you by (insert your name) The EvoNet Training Committee The EvoNet Flying Circus.
Introduction to Genetic Algorithms Yonatan Shichel.
Evolutionary ComputingIntroduction1 Introduction, Part I Positioning of EC and the basic EC metaphor Historical perspective Biological inspiration: – Darwinian.
Intro to AI Genetic Algorithm Ruth Bergman Fall 2002.
Tutorial 1 Temi avanzati di Intelligenza Artificiale - Lecture 3 Prof. Vincenzo Cutello Department of Mathematics and Computer Science University of Catania.
Evolutionary Computational Intelligence Lecture 8: Memetic Algorithms Ferrante Neri University of Jyväskylä.
Introduction Chapter 1.
Intro to AI Genetic Algorithm Ruth Bergman Fall 2004.
Image Registration of Very Large Images via Genetic Programming Sarit Chicotay Omid E. David Nathan S. Netanyahu CVPR ‘14 Workshop on Registration of Very.
Genetic Algorithms Overview Genetic Algorithms: a gentle introduction –What are GAs –How do they work/ Why? –Critical issues Use in Data Mining –GAs.
Evolutionary Computation Instructor: Shu-Mei Guo Nature Inspired Algorithmic Techniques.
Introduction A.E. Eiben and J.E. Smith, Introduction to Evolutionary Computing Chapter 1 1.
Evolutionary Intelligence
1 An Overview of Evolutionary Computation 조 성 배 연세대학교 컴퓨터과학과.
Introduction to Genetic Algorithms and Evolutionary Computation
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.
ART – Artificial Reasoning Toolkit Evolving a complex system Marco Lamieri Spss training day
Introduction to Evolutionary Computation Temi avanzati di Intelligenza Artificiale - Lecture 1 Prof. Vincenzo Cutello Department of Mathematics and Computer.
An Introduction to Genetic Algorithms Lecture 2 November, 2010 Ivan Garibay
Genetic Algorithms Siddhartha K. Shakya School of Computing. The Robert Gordon University Aberdeen, UK
G ENETIC A LGORITHMS Ranga Rodrigo March 5,
Artificial Intelligence Chapter 4. Machine Evolution.
EvoNet Flying Circus Introduction to Evolutionary Computation Brought to you by (insert your name) The EvoNet Training Committee The EvoNet Flying Circus.
Evolutionary Computing Chapter 2. / 24 Chapter 2: Evolutionary Computing: the Origins Historical perspective Biological inspiration: – Darwinian evolution.
Evolutionary Algorithms K. Ganesh Research Scholar, Ph.D., Industrial Management Division, Humanities and Social Sciences Department, Indian Institute.
1. Genetic Algorithms: An Overview  Objectives - Studying basic principle of GA - Understanding applications in prisoner’s dilemma & sorting network.
1. Genetic Algorithms: An Overview 4 학습목표 GA 의 기본원리를 파악하고, Prisoner’s dilemma 와 sorting network 에의 응용 및 이론적 배경을 이해한 다.
D Nagesh Kumar, IIScOptimization Methods: M8L5 1 Advanced Topics in Optimization Evolutionary Algorithms for Optimization and Search.
Natural Selection. Evolution by Natural Selection.
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
Introduction to Evolutionary Computing II A.E. Eiben Free University Amsterdam with thanks to the EvoNet Training Committee.
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.
EvoNet Flying Circus Introduction to Evolutionary Computation Brought to you by (insert your name) The EvoNet Training Committee The EvoNet Flying Circus.
EVOLUTIONARY SYSTEMS AND GENETIC ALGORITHMS NAME: AKSHITKUMAR PATEL STUDENT ID: GRAD POSITION PAPER.
Genetic Algorithms And other approaches for similar applications Optimization Techniques.
Presented By: Farid, Alidoust Vahid, Akbari 18 th May IAUT University – Faculty.
Natural Selection. A. Species overproduce offspring that may survive an environment. B. There is little variation among members of a population. C. Competition.
Genetic Algorithms.
Genetic Algorithm in TDR System
Genetic Algorithms.
Introduction to Evolutionary Computing
Evolutionary Computation
Evolution Strategies Evolutionary Programming
Artificial Intelligence Methods (AIM)
Introduction to Genetic Algorithm (GA)
CSC 380: Design and Analysis of Algorithms
Basics of Genetic Algorithms (MidTerm – only in RED material)
Introduction Chapter 1.
Artificial Intelligence Chapter 4. Machine Evolution
Natural Selection & Evolution
Dr. Unnikrishnan P.C. Professor, EEE
Basics of Genetic Algorithms
Artificial Intelligence Chapter 4. Machine Evolution
A Gentle introduction Richard P. Simpson
Introduction Chapter 1.
CSC 380: Design and Analysis of Algorithms
Presentation transcript:

Introduction to Evolutionary Computing I A.E. Eiben Free University Amsterdam with thanks to the EvoNet Training Committee and its “Flying Circus”

A.E. Eiben, Introduction to EC I2 EvoNet Summer School 2002 Contents Historical perspective Biological inspiration: Darwinian evolution (simplified!) Genetics (simplified!) Motivation for EC The basic EC Metaphor What can EC do: examples of application areas Demo: evolutionary magic square solver

A.E. Eiben, Introduction to EC I3 EvoNet Summer School 2002 Fathers of evolutionary computing Alan Mathison Turing 1912 – 1954 “Father of the computer” Charles Darwin 1809 – 1882 “Father of the evolution theory” John von Neumann 1903 – 1957 “Father of the computer” Gregor Mendel 1822 – 1884 “Father of genetics”

A.E. Eiben, Introduction to EC I4 EvoNet Summer School 2002 The dawn of EC 1948, Turing proposes “genetical or evolutionary search” 1962, Bremermann optimization through evolution and recombination 1964, Rechenberg introduces evolution strategies 1965, L. Fogel, Owens and Walsh introduce evolutionary programming 1975, Holland introduces genetic algorithms

A.E. Eiben, Introduction to EC I5 EvoNet Summer School 2002 Since then… 1985: first international conference (ICGA) 1990: first international conference in Europe (PPSN) 1993: first scientific EC journal (MIT Press) 1997: launch of European EC Research Network (EvoNet) And today: 3 major conferences, 10 – 15 small / related ones 3 scientific core EC journals + 2 Web-based ones papers published in 2001 (estimate) EvoNet has over 150 member institutes uncountable (meaning: many) applications uncountable (meaning: ?) consultancy and R&D firms

A.E. Eiben, Introduction to EC I6 EvoNet Summer School 2002 Natural Evolution Given a population of reproducing individuals Fitness: capability of an individual to survive and reproduce in an environment (caveat: “inverse” measure) Phenotypic variability: small, random, apparently undirected deviation of offspring from parents Natural selection: reproductive advantage by being well-suited to an environment (survival of the fittest) Adaptation: the state of being and process of becoming suitable w.r.t. the environment Evolution 1: Open-ended adaptation in a dynamically changing world Evolution 2: Optimization according to some fitness-criterion

A.E. Eiben, Introduction to EC I7 EvoNet Summer School 2002 Natural Genetics The information required to build a living organism is coded in the DNA of that organism Genotype (DNA inside) determines phenotype (outside) Small variations in the genetic material give rise to small variations in phenotypes (e.g., height, eye color) Genetic differences between parents and children are due to mutations/recombinations Fact 1: For all natural life on earth, the genetic code is the same Fact 2: No information transfer from phenotype to genotype (Lamarckism wrong)

A.E. Eiben, Introduction to EC I8 EvoNet Summer School 2002 Motivation for EC Nature has always served as a source of inspiration for engineers and scientists The best problem solver known in nature is: the (human) brain that created “the wheel, New York, wars and so on” (after Douglas Adams’ Hitch-Hikers Guide) the evolution mechanism that created the human brain (after Darwin’s Origin of Species) Answer 1  neurocomputing Answer 2  evolutionary computing

A.E. Eiben, Introduction to EC I9 EvoNet Summer School 2002 Motivation for EC 2 Developing, analyzing, applying problem solving methods a.k.a. algorithms is a central theme in mathematics and computer science Time for thorough problem analysis decreases Complexity of problems to be solved increases Consequence: robust problem solving technology needed Assumption: Natural evolution is robust  simulated evolution is robust

A.E. Eiben, Introduction to EC I10 EvoNet Summer School 2002 Evolutionary Computing: the Basic Metaphor EVOLUTION Environment Individual Fitness PROBLEM SOLVING Problem Candidate Solution Quality Quality  chance for seeding new solutions Fitness  chances for survival and reproduction

A.E. Eiben, Introduction to EC I11 EvoNet Summer School 2002 Classification of problem types

A.E. Eiben, Introduction to EC I12 EvoNet Summer School 2002 What can EC do optimization e.g. time tables for university, call center, or hospital design (special type of optimization?) e.g., jet engine nozzle, satellite boom modeling e.g. profile of good bank customer, or poisonous drug simulation e.g. artificial life, evolutionary economy, artificial societies entertainment / art e.g., the Escher evolver

A.E. Eiben, Introduction to EC I13 EvoNet Summer School 2002 Illustration in optimization: university timetabling Enormously big search space Timetables must be good, and good is defined by a number of competing criteria Timetables must be feasible and the vast majority of search space is infeasible NB Example from Napier Univ

A.E. Eiben, Introduction to EC I14 EvoNet Summer School 2002 Illustration in design: NASA satellite structure Optimized satellite designs to maximize vibration isolation Evolving: design structures Fitness: vibration resistance Evolutionary “creativity”

A.E. Eiben, Introduction to EC I15 EvoNet Summer School 2002

A.E. Eiben, Introduction to EC I16 EvoNet Summer School 2002 Illustration in modelling: 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 Evolutionary machine learning

A.E. Eiben, Introduction to EC I17 EvoNet Summer School 2002 Illustration in simulation: evolving artificial societies Simulating trade, economic competition, etc. to calibrate models Use models to optimize strategies and policies Evolutionary economy Survival of the fittest is universal (big/small fish)

A.E. Eiben, Introduction to EC I18 EvoNet Summer School 2002 Incest prevention keeps evolution from rapid degeneration (we knew this) Multi-parent reproduction, makes evolution more efficient (this does not exist on Earth in carbon) 2 nd sample of Life Illustration in simulation 2: biological interpetations Picture censored

A.E. Eiben, Introduction to EC I19 EvoNet Summer School 2002 Illustration in art: the Escher evolver City Museum The Hague (NL) Escher Exhibition (2000) Real Eschers + computer images on flat screens Evolving: population of pic’s Fitness: visitors’ votes (inter- active subjective selection) Evolution for the people

A.E. Eiben, Introduction to EC I20 EvoNet Summer School 2002 Demonstration: magic square Given a 10x10 grid with a small 3x3 square in it Problem: arrange the numbers on the grid such that all horizontal, vertical, diagonal sums are equal (505) a small 3x3 square forms a solution for 1-9

A.E. Eiben, Introduction to EC I21 EvoNet Summer School 2002 Demonstration: magic square Evolutionary approach to solving this puzzle: Creating random begin arrangement Making N mutants of given arrangement Keeping the mutant (child) with the least error Stopping when error is zero

A.E. Eiben, Introduction to EC I22 EvoNet Summer School 2002 Demonstration: magic square Software by M. Herdy, TU Berlin Interesting parameters: Step1: small mutation, slow & hits the optimum Step10: large mutation, fast & misses (“jumps over” optimum) Mstep: mutation step size modified on-line, fast & hits optimum Start: double-click on icon below Exit: click on TUBerlin logo (top-right)