Exploring Genetic Algorithms Through the Iterative Prisoner's Dilemma

Slides:



Advertisements
Similar presentations
Exact and heuristics algorithms
Advertisements

Genetic Algorithms By: Anna Scheuler and Aaron Smittle.
On the Genetic Evolution of a Perfect Tic-Tac-Toe Strategy
CS0007: Introduction to Computer Programming Array Algorithms.
Genetic Programming 김용덕 Page 2 Contents What is Genetic Programming? Difference between GP and GA Flowchart for GP Structures in GP.
COMP305. Part II. Genetic Algorithms. Genetic Algorithms.
A new crossover technique in Genetic Programming Janet Clegg Intelligent Systems Group Electronics Department.
Discovery of RNA Structural Elements Using Evolutionary Computation Authors: G. Fogel, V. Porto, D. Weekes, D. Fogel, R. Griffey, J. McNeil, E. Lesnik,
Genetic Algorithm for Variable Selection
Local Search and Stochastic Algorithms
Selecting Informative Genes with Parallel Genetic Algorithms Deodatta Bhoite Prashant Jain.
Genetic Algorithm What is a genetic algorithm? “Genetic Algorithms are defined as global optimization procedures that use an analogy of genetic evolution.
MrsBillinghurst. net A2 Computing A2 Computing Projects Game Animation in Pascal.
Genetic Algorithm.
Exploring Genetic Algorithms Through the Iterative Prisoner's Dilemma Computer Systems Lab Aaron Dufour.
Senior Project – Computer Science – 2015 Modelling Opponents in Board Games Julian Jocque Advisor – Prof. Rieffel Abstract Modelling opponents in a game.
Cristian Urs and Ben Riveira. Introduction The article we chose focuses on improving the performance of Genetic Algorithms by: Use of predictive models.
Solving the Concave Cost Supply Scheduling Problem Xia Wang, Univ. of Maryland Bruce Golden, Univ. of Maryland Edward Wasil, American Univ. Presented at.
Today  Table/List operations  Parallel Arrays  Efficiency and Big ‘O’  Searching.
Polymorphism & Variant Analysis Lab Saurabh Sinha Polymorphism and Variant Analysis Lab v1 | Saurabh Sinha 1 Powerpoint by Casey Hanson.
Rectangles Rotate A Presentation An animation will play when the presentation is previewed (F5). If the animation does not play, please check the system.
Appendix B A BRIEF TOUR OF SOLVER Prescriptive Analytics
Genetic algorithms Charles Darwin "A man who dares to waste an hour of life has not discovered the value of life"
Presenter: Chih-Yuan Chou GA-BASED ALGORITHMS FOR FINDING EQUILIBRIUM 1.
Applying Genetic Algorithm to the Knapsack Problem Qi Su ECE 539 Spring 2001 Course Project.
Genetic Algorithms Introduction Advanced. Simple Genetic Algorithms: Introduction What is it? In a Nutshell References The Pseudo Code Illustrations Applications.
Derivative Free Optimization G.Anuradha. Contents Genetic Algorithm Simulated Annealing Random search method Downhill simplex method.
GENETIC ALGORITHMS.  Genetic algorithms are a form of local search that use methods based on evolution to make small changes to a popula- tion of chromosomes.
Algorithms and their Applications CS2004 ( ) 13.1 Further Evolutionary Computation.
Applications of Genetic Algorithms TJHSST Computer Systems Lab By Mary Linnell.
Genetic Algorithms Abhishek Sharma Piyush Gupta Department of Instrumentation & Control.
Speeding Up Warehouse Physical Design Using A Randomized Algorithm Minsoo Lee Joachim Hammer Dept. of Computer & Information Science & Engineering University.
EE749 I ntroduction to Artificial I ntelligence Genetic Algorithms The Simple GA.
Robot Intelligence Technology Lab. Generalized game of life YongDuk Kim.
Automated discovery in math Machine learning techniques (GP, ILP, etc.) have been successfully applied in science Machine learning techniques (GP, ILP,
CS 8625 High Performance Computing Dr. Hoganson Copyright © 2003, Dr. Ken Hoganson CS8625 Class Will Start Momentarily… CS8625 High Performance.
GAIA (Genetic Algorithm Interface Architecture) Requirements Analysis Document (RAD) Version 1.0 Created By: Charles Hall Héctor Aybar William Grim Simone.
Genetic Algorithm Dr. Md. Al-amin Bhuiyan Professor, Dept. of CSE Jahangirnagar University.
SEMI-SYNTHETIC CIRCUIT GENERATION FOR TESTING INCREMENTAL PLACE AND ROUTE TOOLS David GrantGuy Lemieux University of British Columbia Vancouver, BC.
Casne.ncl.ac.uk Taking care of the CrumbleBot Please do NOT stress the robot's motors 1.Do NOT push the robot 2.Do NOT hold the.
Turning Gears A Presentation An animation will play when the presentation is previewed (F5). If the animation does not play, please check the system requirements.
Class Scheduling Using Constraint Satisfaction Victoria Donelson Garrett Grimsley.
 Presented By: Abdul Aziz Ghazi  Roll No:  Presented to: Sir Harris.
Hirophysics.com The Genetic Algorithm vs. Simulated Annealing Charles Barnes PHY 327.
Evolutionary Computation Evolving Neural Network Topologies.
Design of a real time strategy game with a genetic AI By Bharat Ponnaluri.
Haploid-Diploid Evolutionary Algorithms
Introduction to Genetic Algorithms
Genetic Algorithms.
Evolutionary Algorithms Jim Whitehead
MAE 552 Heuristic Optimization
USING MICROBIAL GENETIC ALGORITHM TO SOLVE CARD SPLITTING PROBLEM.
Bulgarian Academy of Sciences
MultiRefactor: Automated Refactoring To Improve Software Quality
An evolutionary approach to solving complex problems
Artificial Intelligence (CS 370D)
Haploid-Diploid Evolutionary Algorithms
Building Java Programs
KMeans Clustering on Hadoop Fall 2013 Elke A. Rundensteiner
Add Heuristic a b C D E Switch Cost
Building Java Programs
Methods and Materials (cont.)
EE368 Soft Computing Genetic Algorithms.
Vectors and Matrices In MATLAB a vector can be defined as row vector or as a column vector. A vector of length n can be visualized as matrix of size 1xn.
Searching for solutions: Genetic Algorithms
Applications of Genetic Algorithms TJHSST Computer Systems Lab
Sum this up for me Let’s write a method to calculate the sum from 1 to some n public static int sum1(int n) { int sum = 0; for (int i = 1; i
David Kauchak cs161 Summer 2009
Case Injected Genetic Algorithms
Alex Bolsoy, Jonathan Suggs, Casey Wenner
Presentation transcript:

Exploring Genetic Algorithms Through the Iterative Prisoner's Dilemma Computer Systems Lab 2007-2008 Aaron Dufour

Mutation Rate How the mutation rate changes per generation Within a generation the mutation rate does not change

Natural Selection How many are removed from the population each generation Static rate – the same number are removed each generation Fitness-based rate – all those below a threshold fitness value are removed

Recombination DoublePoint SinglePoint 10010101 10010101 01000011 Yields 10000011 01010101 DoublePoint 10010101 01000011 Yields 10000001 01010111

Initial Population Creation Simple Random binary Flip Half Random on first half Second half is inverted first half Ensures that every bit has 50% 1's and 50% 0's Check for Duplicates Same as flip half, except remakes each one that has a duplicate Ensures that all of the solutions are different

Output Outputs the average fitness value for each generation File name is “g i p t s m n r f.txt” g – number of generations i – number of iterations p – population size t – number of turns s – initial population type m – mutation rate info n – natural selection info r – recombination type f – test number Example – 10 100 150 s s-0.0050 s-0.5 s t0.txt

Data Analysis

Data Analysis, cont’d The program analyzes the data to find where the fitness stabilizes Although we can do this visually, it is difficult for the computer My algorithm eliminates data from the left side until the slope of a fit line gets within a certain amount of 0

Final Product The program automatically loops through each of the algorithms for each method that can change, as well as certain values of variables that I chose based on many trials It does 10 runs with each setting, and outputs the number of generations each one took in addition to an average

Analysis Tool Graphs the number of iterations that each run with a specific attribute took First input line is number of graphs The following (one for each graph) are a number followed by a string A second program moved files between two folders so I could eliminate those with attributes that did not perform well

Analysis Tool

Analysis I could not make any conclusions about the mutation rate or initial population creation The double-point recombination slightly outperformed the single-point recombination algorithm The fitness-based natural selection was better than the static natural selection, and got better with a higher percent of the maximum required (up to 95%)‏