Futility-Based Offspring Sizing André Nwamba June 13, 2015.

Slides:



Advertisements
Similar presentations
A First Course in Genetic Algorithms
Advertisements

Biologically Inspired Computing: Operators for Evolutionary Algorithms
Genetic Algorithms Contents 1. Basic Concepts 2. Algorithm
Parameter control Chapter 8. A.E. Eiben and J.E. Smith, Introduction to Evolutionary Computing Parameter Control in EAs 2 Motivation 1 An EA has many.
Optimization Problem with Simple Genetic Algorithms Cho, Dong-Yeon
GP Applications Two main areas of research Testing genetic programming in areas other techniques have been applied to. Applying genetic programming to.
AUTOMATED REAL-WORLD PROBLEM SOLVING EMPLOYING META-HEURISTICAL BLACK-BOX OPTIMIZATION November 2013 Daniel R. Tauritz, Ph.D. Guest Scientist, Los Alamos.
Valery Frolov.  The algorithm  Fitness function  Crossover  Mutation  Elite individuals  Reverse mutations  Some statistics  Run examples.
Self-Adaptive Semi-Autonomous Parent Selection (SASAPAS) Each individual has an evolving mate selection function Two ways to pair individuals: –Democratic.
Non-Linear Problems General approach. Non-linear Optimization Many objective functions, tend to be non-linear. Design problems for which the objective.
Estimation of Distribution Algorithms Ata Kaban School of Computer Science The University of Birmingham.
Population Sizing as an Emergent Behavior Jason Cook.
COMP305. Part II. Genetic Algorithms. Genetic Algorithms.
Data Mining CS 341, Spring 2007 Genetic Algorithm.
Age-Based Population Dynamics in Evolutionary Algorithms Lisa Guntly.
A new crossover technique in Genetic Programming Janet Clegg Intelligent Systems Group Electronics Department.
Introduction to Genetic Algorithms Yonatan Shichel.
COMP305. Part II. Genetic Algorithms. Genetic Algorithms.
A Hybrid Heuristic for the Traveling Salesman Problem R. Baraglia, J. I. Hildalgo, R. Perego CMPSC 580, Spring 2006.
COMP305. Part II. Genetic Algorithms. Genetic Algorithms.
Using a “Memetic” Evolutionary Algorithm to Solve a Form of The Maximum Clique Problem By Ian Baird November 20 th, 2003.
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.
Symposium “New Directions in Evolutionary Computation” Dr. Daniel Tauritz Director, Natural Computation Laboratory Associate Professor, Department of Computer.
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.
Parallel Genetic Algorithms with Distributed-Environment Multiple Population Scheme M.Miki T.Hiroyasu K.Hatanaka Doshisha University,Kyoto,Japan.
Genetic Algorithm.
Introduction to Genetic Algorithms and Evolutionary Computation
Emergent Robustness in Software Systems through Decentralized Adaptation: an Ecologically-Inspired ALife Approach Franck Fleurey, Benoit Baudry, Benoit.
Applying Genetic Algorithm to the Knapsack Problem Qi Su ECE 539 Spring 2001 Course Project.
An Introduction to Genetic Algorithms Lecture 2 November, 2010 Ivan Garibay
Derivative Free Optimization G.Anuradha. Contents Genetic Algorithm Simulated Annealing Random search method Downhill simplex method.
Immune Genetic Algorithms for Optimization of Task Priorities and FlexRay Frame Identifiers Soheil Samii 1, Yanfei Yin 1,2, Zebo Peng 1, Petru Eles 1,
Static vs. Dynamic Populations in GAs for Coloring a Dynamic Graph Cara Monical Forrest Stonedahl
Chapter 9 Genetic Algorithms.  Based upon biological evolution  Generate successor hypothesis based upon repeated mutations  Acts as a randomized parallel.
/ 26 Evolutionary Computing Chapter 8. / 26 Chapter 8: Parameter Control Motivation Parameter setting –Tuning –Control Examples Where to apply parameter.
Genetic Algorithms What is a GA Terms and definitions Basic algorithm.
Chapter 12 FUSION OF FUZZY SYSTEM AND GENETIC ALGORITHMS Chi-Yuan Yeh.
Evolutionary Computing Chapter 7. / 37 Chapter 7: Parameters and Parameter Tuning History Taxonomy Parameter Tuning vs Parameter Control EA calibration.
Solving Function Optimization Problems with Genetic Algorithms September 26, 2001 Cho, Dong-Yeon , Tel:
GENETIC ALGORITHM Basic Algorithm begin set time t = 0;
GAIA (Genetic Algorithm Interface Architecture) Requirements Analysis Document (RAD) Version 1.0 Created By: Charles Hall Héctor Aybar William Grim Simone.
Evolutionary Computing Chapter 11. / 7 Chapter 11: Non-stationary and Noisy Function Optimisation What is a non-stationary problem? Effect of uncertainty.
FACTS Placement Optimization For Multi-Line Contignecies Josh Wilkerson November 30, 2005.
An Introduction to Genetic Algorithms Lecture 2 November, 2010 Ivan Garibay
Benjamin Doerr 1, Michael Gnewuch 2, Nils Hebbinghaus 1, Frank Neumann 1 1 Max-Planck-Institut für Informatik Saarbrücken A Rigorous View on Neutrality.
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.
Selection and Recombination Temi avanzati di Intelligenza Artificiale - Lecture 4 Prof. Vincenzo Cutello Department of Mathematics and Computer Science.
Genetic Programming Using Simulated Natural Selection to Automatically Write Programs.
Artificial Intelligence By Mr. Ejaz CIIT Sahiwal Evolutionary Computation.
Overview Last two weeks we looked at evolutionary algorithms.
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 Algorithms And other approaches for similar applications Optimization Techniques.
Genetic Algorithm. Outline Motivation Genetic algorithms An illustrative example Hypothesis space search.
 Presented By: Abdul Aziz Ghazi  Roll No:  Presented to: Sir Harris.
Using GA’s to Solve Problems
Genetic Algorithms.
Dept of ECE, Concordia University, Montreal, Canada
A Comparison of Simulated Annealing and Genetic Algorithm Approaches for Cultivation Model Identification Olympia Roeva.
An evolutionary approach to solving complex problems
Artificial Intelligence Chapter 4. Machine Evolution
Artificial Intelligence Chapter 4. Machine Evolution
EE368 Soft Computing Genetic Algorithms.
Self-Configuring Crossover
Steady state Selection
Beyond Classical Search
Coevolutionary Automated Software Correction
GA.
Presentation transcript:

Futility-Based Offspring Sizing André Nwamba June 13, 2015

Parameter Tuning Requires expert knowledge of EAs Time Consuming Sub-optimal

The Problem Dire need for automation Completely Parameterless EA Remove the need to specify offspring size, λ

The Solution FuBOS: Futility-Based Offspring Sizing Minimize wasted computation effort

The Solution Look at change in average fitness of the offspring  Change in average fitness not best metric Average fitness of all n offspring Average fitness of n-1 previously created offspring Threshold value

Experimental Setup Compared FuBOS-EA and manually tuned EA (OOS-EA)  FuBOS-EA uses.001 for epsilon Test problems: DTRAP, SAT, and ONEMAX Used population sizes of 100, 500, 1000 All tests used same parameters Performance compared using One-Way ANOVA

Experimental Setup ParameterValue InitializationEach bit is initialized to either a 0 or 1 with a uniform probability Parent SelectionRandom Survivor SelectionTruncation RecombinationUniform Crossover for SAT and ONEMAX and 2-point crossover for DTRAP Mutation Rate1/l (l being the length of the bitstring) Termination Condition fitness evaluations for SAT and DTRAP, for ONEMAX

Results

Future Work The “epsilon problem” Fitness Diversity Parent Selection Combine with dynamic population sizing

Questions?