DAN SHMIDT ITAY BITTAN Advanced Topics in Evolutionary Algorithms.

Slides:



Advertisements
Similar presentations
Reinforcement Learning
Advertisements

Tetris – Genetic Algorithm Presented by, Jeethan & Jun.
Evolving Strategies for Contentious but Efficient Coexistence in Unlicensed Bands N. Clemens C. Rose WINLAB.
How Machines Do Work Outline Notes Pages
Genetic Algorithms By: Anna Scheuler and Aaron Smittle.
Statistics Versus Parameters
On the Genetic Evolution of a Perfect Tic-Tac-Toe Strategy
1 A class of Generalized Stochastic Petri Nets for the performance Evaluation of Mulitprocessor Systems By M. Almone, G. Conte Presented by Yinglei Song.
By Andrew Egger. Size #1: 3.79 Liters $9.42 Size #1: Unit Price $9.42/3.79L = $2.49 per liter.
GP Applications Two main areas of research Testing genetic programming in areas other techniques have been applied to. Applying genetic programming to.
Solve % with Proportions. Solve each proportion. 2. Convert 24% to a decimal 3. Morgan organized a fundraiser that required students to earn money for.
Evolving Driving Controllers using Genetic Programming Marc Ebner and Thorsten Tiede.
The Central Limit Theorem
Valery Frolov.  The algorithm  Fitness function  Crossover  Mutation  Elite individuals  Reverse mutations  Some statistics  Run examples.
Spider Search: an Efficient and Non-Frontier-Based Real-Time Search Algorithm Presenter: Chao Lin Chu 599B Advisor: Dr. Russell J. Abbott.
1 Simulation Modeling and Analysis Session 13 Simulation Optimization.
1 Autonomous Controller Design for Unmanned Aerial Vehicles using Multi-objective Genetic Programming Choong K. Oh and Gregory J. Barlow U.S. Naval Research.
A New Evolutionary Algorithm for Multi-objective Optimization Problems Multi-objective Optimization Problems (MOP) –Definition –NP hard By Zhi Wei.
COMP305. Part II. Genetic Algorithms. Genetic Algorithms.
Age-Based Population Dynamics in Evolutionary Algorithms Lisa Guntly.
Introduction to Genetic Algorithms Yonatan Shichel.
Evolution of descent directions Alejandro Sierra Escuela Politécnica Superior Universidad Autónoma de Madrid Iván Santibáñez Koref Bionik und Evolutionstechnik.
COMP305. Part II. Genetic Algorithms. Genetic Algorithms.
Artificial Intelligence Genetic Algorithms and Applications of Genetic Algorithms in Compilers Prasad A. Kulkarni.
EC Awards Lecture ~ Spring 2008 Advances in Parameterless Evolutionary Algorithms Lisa Guntly André Nwamba Research Advisor: Dr. Daniel Tauritz Natural.
Applying Evolutionary Algorithm to Chaco Tool on the Partitioning of Power Transmission System (CS448 Class Project) Yan Sun.
Evolving a Faster Keyboard Christopher P Walker. Overview Motivation Algorithm Considerations Design of the EA The nonexistent preliminary results Future.
Neural Optimization of Evolutionary Algorithm Strategy Parameters Hiral Patel.
Intro to AI Genetic Algorithm Ruth Bergman Fall 2004.
1 Algorithm Design Techniques Greedy algorithms Divide and conquer Dynamic programming Randomized algorithms Backtracking.
Optimizing a Chess Heuristic Using Evolutionary Algorithms Benjamin Rhew
Genetic Algorithm What is a genetic algorithm? “Genetic Algorithms are defined as global optimization procedures that use an analogy of genetic evolution.
Lesson 3-4 Example Example 2 Dale got a score of 70 on his science exam. He was able to retake the test and scored a Find the percent of change.
Prepared by Barış GÖKÇE 1.  Search Methods  Evolutionary Algorithms (EA)  Characteristics of EAs  Genetic Programming (GP)  Evolutionary Programming.
Genetic Algorithm.
Albert Morlan Caitrin Carroll Savannah Andrews Richard Saney.
Using Genetic Programming to Learn Probability Distributions as Mutation Operators with Evolutionary Programming Libin Hong, John Woodward, Ender Ozcan,
Improved Gene Expression Programming to Solve the Inverse Problem for Ordinary Differential Equations Kangshun Li Professor, Ph.D Professor, Ph.D College.
Zorica Stanimirović Faculty of Mathematics, University of Belgrade
Presenter: Chih-Yuan Chou GA-BASED ALGORITHMS FOR FINDING EQUILIBRIUM 1.
L ECTURE 3 Notes are modified from EvoNet Flying Circus slides. Found at: www2.cs.uh.edu/~ceick/ai/EC1.ppt.
Genetic Algorithms Introduction Advanced. Simple Genetic Algorithms: Introduction What is it? In a Nutshell References The Pseudo Code Illustrations Applications.
Evolutionary Computation Dean F. Hougen w/ contributions from Pedro Diaz-Gomez & Brent Eskridge Robotics, Evolution, Adaptation, and Learning Laboratory.
Bi-directional incremental evolution Dr Tatiana Kalganova Electronic and Computer Engineering Dept. Bio-Inspired Intelligent Systems Group Brunel University.
A genetic approach to the automatic clustering problem Author : Lin Yu Tseng Shiueng Bien Yang Graduate : Chien-Ming Hsiao.
Algorithms and their Applications CS2004 ( ) 13.1 Further Evolutionary Computation.
Yikan Chen Weikeng Qin 1.
Applications of Genetic Algorithms TJHSST Computer Systems Lab By Mary Linnell.
Intelligent Database Systems Lab 國立雲林科技大學 National Yunlin University of Science and Technology 1 Evolving Reactive NPCs for the Real-Time Simulation Game.
Genetic Algorithms What is a GA Terms and definitions Basic algorithm.
Genetic algorithms: A Stochastic Approach for Improving the Current Cadastre Accuracies Anna Shnaidman Uri Shoshani Yerach Doytsher Mapping and Geo-Information.
Evolutionary Computing Chapter 11. / 7 Chapter 11: Non-stationary and Noisy Function Optimisation What is a non-stationary problem? Effect of uncertainty.
Chapter 7 Introduction to Sampling Distributions Business Statistics: QMIS 220, by Dr. M. Zainal.
Selection Methods Choosing the individuals in the population that will create offspring for the next generation. Richard P. Simpson.
MATH Section 4.4.
Genetic Programming Using Simulated Natural Selection to Automatically Write Programs.
Overview Last two weeks we looked at evolutionary algorithms.
1 Math 10 Part 4 Slides Continuous Random Variables and the Central Limit Theorem © Maurice Geraghty, 2015.
Breeding Swarms: A GA/PSO Hybrid 簡明昌 Author and Source Author: Matthew Settles and Terence Soule Source: GECCO 2005, p How to get: (\\nclab.csie.nctu.edu.tw\Repository\Journals-
Genetic Algorithm(GA)
Genetic (Evolutionary) Algorithms CEE 6410 David Rosenberg “Natural Selection or the Survival of the Fittest.” -- Charles Darwin.
Genetic Algorithm (Knapsack Problem)
Introduction to Genetic Algorithms
An Evolutionary Approach
USING MICROBIAL GENETIC ALGORITHM TO SOLVE CARD SPLITTING PROBLEM.
Evolving the goal priorities of autonomous agents
SCIENCE and SPORT.
Methods and Materials (cont.)
Applications of Genetic Algorithms TJHSST Computer Systems Lab
Introduction to Genetic Algorithm and Some Experience Sharing
Presentation transcript:

DAN SHMIDT ITAY BITTAN Advanced Topics in Evolutionary Algorithms

Outline Operators Review Time and Fitness, Fitness and Time Results and interesting experiments Conclusions

Operators Selection:  Tournament selection of 4  Tournament selection of 2 Elite:  Decided to use elite to avoid loosing good solution along the way.  10 percent of the population is Elite.

Operators Cross Over:  Normal Cross Over:  Random Cross Over:

Operators Mutation:  In some probability change parameter (i): Solution[i] = 1 – Solution[i]  Switching two parameters of same instance: Solution[i] = Solution[j], Solution[j] = Solution[i]  Randomize first k parameters where k is random Solution[0]=random, …, Solution[k-1]=random

Outline Operators Review Time and Fitness, Fitness and Time Results and interesting experiments Conclusions

Time Issues Time is Allocated dynamically depending on:  Generation number.  Amount of individuals that are able to finish a lap. Formula: Divided to three stages  Stage 1: before generation - allocated time is a constant  Stage 2: Every generation gets another ticks  Stage 3: If the number of individuals that finish one lap is greater then

Fitness Calculation Fitness is the average of:  Why divide by time? – because time is dynamic and we want to be able to compare individuals who ran different amount of time.  Why average? – because we are keeping track of all of individuals runs and we don’t want to lose this information

Outline Operators Review Time and Fitness, Fitness and Time Results and interesting experiments Conclusions

Experiments First, we run the algorithm 19 times with different tracks. We got 19 sets of 22 parameters (each set evolved from a unique track). For each set we got a fitness function value (calculated during the process). Then, we run the each set on his corresponding track for a tics (which is enough to complete at least one lap) and we measured the real fitness value.

Experiments Details: elite, selection:4-tournament, population:30

Experiments Population 30 got better results (12 / 7)

Experiments Our algorithm also win 14 of 19!

Experiments Our algorithm win 14 of 19!

Experiments E-track-4 set win 14 of 19!

Outline Operators Review Time and Fitness, Fitness and Time Results and interesting experiments Conclusions

A good solution to one track is a good solution on other tracks. The algorithm’s efficiency depends on the track. Our algorithm beats the original algorithm on most tracks.