EvoNet Flying Circus Introduction to Evolutionary Computation Brought to you by (insert your name) The EvoNet Training Committee The EvoNet Flying Circus.

Slides:



Advertisements
Similar presentations
Genetic Algorithms Vida Movahedi November Contents What are Genetic Algorithms? From Biology … Evolution … To Genetic Algorithms Demo.
Advertisements

Temi Avanzati di Intelligenza Artificiale - Intro1 Temi Avanzati di Intelligenza Artificiale Prof. Vincenzo Cutello Department of Mathematics and Computer.
Computer Science Genetic Algorithms8/23/20011 Applications Boeing 777 engines designed by GE I2 technologies ERP package uses Gas John Deere – manufacturing.
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.
Introduction to Evolutionary Computing I A.E. Eiben Free University Amsterdam with thanks to the EvoNet Training Committee and.
Evolutionary Algorithms
Genetic Algorithms1 COMP305. Part II. Genetic Algorithms.
Introduction to Evolutionary Computation Evolutionary Computation is the field of study devoted to the design, development, and analysis is problem solvers.
EvoNet Flying Circus Introduction to Evolutionary Computation Brought to you by (insert your name) The EvoNet Training Committee The EvoNet Flying Circus.
A simple EA and Common Search Operators Temi avanzati di Intelligenza Artificiale - Lecture 2 Prof. Vincenzo Cutello Department of Mathematics and Computer.
Intro to AI Genetic Algorithm Ruth Bergman Fall 2002.
Genetic Algorithms (GAs) by Jia-Huei Liao Source: Chapter 9, Machine Learning, Tom M. Mitchell, 1997 The Genetic Programming Tutorial Notebook
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 to Computational Intelligence (Evolutionary Computation) Evolutionary Computation is the field of study devoted to the design, development,
Memetic Algorithms By  Anup Kulkarni( )  Prashanth Kamle( ) Instructor: Prof. Pushpak Bhattacharyya.
CS 447 Advanced Topics in Artificial Intelligence Fall 2002.
Computer Science Genetic Algorithms CS 776: Evolutionary Computation Syllabus Objectives: –Learn about Evolutionary Computation.
Intro to AI Genetic Algorithm Ruth Bergman Fall 2004.
Genetic Programming. Agenda What is Genetic Programming? Background/History. Why Genetic Programming? How Genetic Principles are Applied. Examples of.
Khaled Rasheed Computer Science Dept. University of Georgia
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.
Evolutionary Computation Instructor: Shu-Mei Guo Nature Inspired Algorithmic Techniques.
Evolutionary algorithms
1 An Overview of Evolutionary Computation 조 성 배 연세대학교 컴퓨터과학과.
CSI Evolutionary Computation Fall Semester, 2009.
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
Introduction Chapter 1. A.E. Eiben and J.E. Smith, Introduction to Evolutionary Computing Introduction with additions/modification by Christoph F. Eick.
Artificial Intelligence Chapter 4. Machine Evolution Biointelligence Lab School of Computer Sci. & Eng. Seoul National University.
Genetic Algorithms K.Ganesh Reasearch Scholar, Ph.D., Industrial Management Division, Humanities and Social Sciences Department, Indian Institute of Technology.
Genetic Algorithms Introduction Advanced. Simple Genetic Algorithms: Introduction What is it? In a Nutshell References The Pseudo Code Illustrations Applications.
Genetic Algorithms Siddhartha K. Shakya School of Computing. The Robert Gordon University Aberdeen, UK
Artificial Intelligence Chapter 4. Machine Evolution.
Books on Genetic Programming Koza, J. R (1992). Genetic Programming: On the Programming of Computers by Means of Natural Selection. MIT Press. Cambridge,
Evolutionary Computing Chapter 2. / 24 Chapter 2: Evolutionary Computing: the Origins Historical perspective Biological inspiration: – Darwinian evolution.
Evolutionary Computing Dialects Presented by A.E. Eiben Free University Amsterdam with thanks to the EvoNet Training Committee and its “Flying Circus”
 Based on observed functioning of human brain.  (Artificial Neural Networks (ANN)  Our view of neural networks is very simplistic.  We view a neural.
CITS7212: Computational Intelligence An Overview of Core CI Technologies Lyndon While.
CSI Evolutionary Computation Fall Semester, 2011.
Introduction to Evolutionary Computing II A.E. Eiben Free University Amsterdam with thanks to the EvoNet Training Committee.
Artificial Intelligence By Mr. Ejaz CIIT Sahiwal Evolutionary Computation.
Advanced AI – Session 6 Genetic Algorithm By: H.Nematzadeh.
EvoNet Flying Circus Introduction to Evolutionary Computation Brought to you by (insert your name) The EvoNet Training Committee The EvoNet Flying Circus.
Genetic Algorithms An Evolutionary Approach to Problem Solving.
An Evolutionary Approach
Evolutionary Algorithms Jim Whitehead
Evolutionary Computation
Evolution Strategies Evolutionary Programming
C.-S. Shieh, EC, KUAS, Taiwan
Evolution strategies Can programs learn?
Example: Applying EC to the TSP Problem
Genetic Algorithms, Search Algorithms
Advanced Artificial Intelligence Evolutionary Search Algorithm
Introduction Chapter 1.
Artificial Intelligence Chapter 4. Machine Evolution
Artificial Intelligence Chapter 4. Machine Evolution
Example: Applying EC to the TSP Problem
진화방식을 이용한 인공시스템의 기능 및 구조의 창발
G5BAIM Artificial Intelligence Methods
EVOLUTIONARY ALGORITHM BASICS
Artificial Intelligence Chapter 4. Machine Evolution
Artificial Intelligence Chapter 4. Machine Evolution
Introduction Chapter 1.
Genetic Algorithm Soft Computing: use of inexact t solution to compute hard task problems. Soft computing tolerant of imprecision, uncertainty, partial.
Beyond Classical Search
Presentation transcript:

EvoNet Flying Circus Introduction to Evolutionary Computation Brought to you by (insert your name) The EvoNet Training Committee The EvoNet Flying Circus

EvoNet Flying Circus Q What is the most powerful problem solver in the Universe?  The (human) brain that created “the wheel, New York, wars and so on” (after Douglas Adams)  The evolution mechanism that created the human brain (after Darwin et al.)

EvoNet Flying Circus Building problem solvers by looking at and mimicking: brains  neurocomputing evolution  evolutionary computing

EvoNet Flying Circus Table of Contents Taxonomy and History The Metaphor The Evolutionary Mechanism Domains of Application Performance Sources of Information

EvoNet Flying Circus Taxonomy

EvoNet Flying Circus History L. Fogel 1962 (San Diego, CA): Evolutionary Programming J. Holland 1962 (Ann Arbor, MI): Genetic Algorithms I. Rechenberg & H.-P. Schwefel 1965 (Berlin, Germany): Evolution Strategies J. Koza 1989 (Palo Alto, CA): Genetic Programming

EvoNet Flying Circus The Metaphor EVOLUTION Individual Fitness Environment PROBLEM SOLVING Candidate Solution Quality Problem

EvoNet Flying Circus The Ingredients t t + 1 mutation recombination reproduction selection

EvoNet Flying Circus The Evolution Mechanism Increasing diversity by genetic operators mutation recombination Decreasing diversity by selection of parents of survivors

EvoNet Flying Circus The Evolutionary Cycle Recombination Mutation Population OffspringParents Selection Replacement

EvoNet Flying Circus Domains of Application Numerical, Combinatorial Optimisation System Modeling and Identification Planning and Control Engineering Design Data Mining Machine Learning Artificial Life

EvoNet Flying Circus Performance Acceptable performance at acceptable costs on a wide range of problems Intrinsic parallelism (robustness, fault tolerance) Superior to other techniques on complex problems with lots of data, many free parameters complex relationships between parameters many (local) optima

EvoNet Flying Circus Advantages No presumptions w.r.t. problem space Widely applicable Low development & application costs Easy to incorporate other methods Solutions are interpretable (unlike NN) Can be run interactively, accommodate user proposed solutions Provide many alternative solutions

EvoNet Flying Circus Disadvantages No guarantee for optimal solution within finite time Weak theoretical basis May need parameter tuning Often computationally expensive, i.e. slow

EvoNet Flying Circus Books Th. Bäck, Evolutionary Algorithms in Theory and Practice, Oxford University Press, 1996 L. Davis, The Handbook of Genetic Algorithms, Van Nostrand & Reinhold, 1991 D.B. Fogel, Evolutionary Computation, IEEE Press, 1995 D.E. Goldberg, Genetic Algorithms in Search, Optimisation and Machine Learning, Addison-Wesley, ‘89 J. Koza, Genetic Programming, MIT Press, 1992 Z. Michalewicz, Genetic Algorithms + Data Structures = Evolution Programs, Springer, 3rd ed., 1996 H.-P. Schwefel, Evolution and Optimum Seeking, Wiley & Sons, 1995

EvoNet Flying Circus Journals BioSystems, Elsevier, since <1986 Evolutionary Computation, MIT Press, since 1993 IEEE Transactions on Evolutionary Computation, since 1996

EvoNet Flying Circus Conferences ICGA, USA, PPSN, Europe, FOGA, USA, EP, USA, IEEE ICEC, world, GP, USA,

EvoNet Flying Circus Summary is based on biological metaphors has great practical potentials is getting popular in many fields yields powerful, diverse applications gives high performance against low costs AND IT’S FUN ! EVOLUTIONARY COMPUTATION: