Static vs. Dynamic Populations in GAs for Coloring a Dynamic Graph Cara Monical Forrest Stonedahl

Slides:

Advertisements

Similar presentations

10/01/2014 DMI - Università di Catania 1 Combinatorial Landscapes & Evolutionary Algorithms Prof. Giuseppe Nicosia University of Catania Department of.

Advertisements

24th may Use of genetic algorithm for designing redundant sensor network Carine Gerkens Systèmes chimiques et conception de procédés Département.

Intelligent Control Methods Lecture 12: Genetic Algorithms Slovak University of Technology Faculty of Material Science and Technology in Trnava.

Tactical Event Resolution Using Software Agents, Crisp Rules, and a Genetic Algorithm John M. D. Hill, Michael S. Miller, John Yen, and Udo W. Pooch Department.

Constructing Complex NPC Behavior via Multi- Objective Neuroevolution Jacob Schrum – Risto Miikkulainen –

1 Reinforced Tabu Search (RTS) for Graph Colouring Daniel Porumbel PhD student (joint work with Jin Kao Hao and Pascale Kuntz) Laboratoire d’Informatique.

Genetic Algorithms Representation of Candidate Solutions GAs on primarily two types of representations: –Binary-Coded –Real-Coded Binary-Coded GAs must.

Non-Linear Problems General approach. Non-linear Optimization Many objective functions, tend to be non-linear. Design problems for which the objective.

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

COMP305. Part II. Genetic Algorithms. Genetic Algorithms.

Data Mining CS 341, Spring 2007 Genetic Algorithm.

Nature’s Algorithms David C. Uhrig Tiffany Sharrard CS 477R – Fall 2007 Dr. George Bebis.

A new crossover technique in Genetic Programming Janet Clegg Intelligent Systems Group Electronics Department.

Introduction to Genetic Algorithms Yonatan Shichel.

Geometric Spanners for Routing in Mobile Networks Jie Gao, Leonidas Guibas, John Hershberger, Li Zhang, An Zhu.

Population New Population Selection Crossover and Mutation Insert When the new population is full repeat Generational Algorithm.

Evolutionary Algorithms Simon M. Lucas. The basic idea Initialise a random population of individuals repeat { evaluate select vary (e.g. mutate or crossover)

Artificial Intelligence Genetic Algorithms and Applications of Genetic Algorithms in Compilers Prasad A. Kulkarni.

Intro to AI Genetic Algorithm Ruth Bergman Fall 2002.

A dynamic program algorithm for haplotype block partitioning Zhang, et. al. (2002) PNAS. 99, 7335.

2 What Genetic Programming ISN'T: What Genetic Programming ISN'T: Engineering a breed of purple carrots. Engineering a breed of purple carrots. Analyzing.

Crossover Operation with Different Parents Crossover Operation with Identical Parents.

An Evolutionary Bluetooth Scatternet Formation Protocol Students: Mirko Gilioli Elallali Mohammed.

Genetic Programming.

Evolutionary Algorithms and Artificial Intelligence Paul Grouchy PhD Candidate University of Toronto Institute for Aerospace Studies

A Budget Constrained Scheduling of Workflow Applications on Utility Grids using Genetic Algorithms Jia Yu and Rajkumar Buyya Grid Computing and Distributed.

On comparison of different approaches to the stability radius calculation Olga Karelkina Department of Mathematics University of Turku MCDM 2011.

Graph Coloring with Ants

Solving the Concave Cost Supply Scheduling Problem Xia Wang, Univ. of Maryland Bruce Golden, Univ. of Maryland Edward Wasil, American Univ. Presented at.

Lecture 8: 24/5/1435 Genetic Algorithms Lecturer/ Kawther Abas 363CS – Artificial Intelligence.

What is Genetic Programming? Genetic programming is a model of programming which uses the ideas (and some of the terminology) of biological evolution to.

Optimal resource assignment to maximize multistate network reliability for a computer network Yi-Kuei Lin, Cheng-Ta Yeh Advisor : Professor Frank Y. S.

Applying Genetic Algorithm to the Knapsack Problem Qi Su ECE 539 Spring 2001 Course Project.

Genetic Algorithms K.Ganesh Reasearch Scholar, Ph.D., Industrial Management Division, Humanities and Social Sciences Department, Indian Institute of Technology.

Genetic Algorithms Siddhartha K. Shakya School of Computing. The Robert Gordon University Aberdeen, UK

EE459 I ntroduction to Artificial I ntelligence Genetic Algorithms Kasin Prakobwaitayakit Department of Electrical Engineering Chiangmai University.

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,

Artificial Intelligence Chapter 4. Machine Evolution.

DYNAMIC FACILITY LAYOUT : GENETIC ALGORITHM BASED MODEL

A Parallel Genetic Algorithm with Distributed Environment Scheme

Chapter 9 Genetic Algorithms.  Based upon biological evolution  Generate successor hypothesis based upon repeated mutations  Acts as a randomized parallel.

A novel approach in CSP with GA by Juhos Istvan, Phillip Tann, Toth Attila, Tezuka Masaru.

Genetic Algorithms Abhishek Sharma Piyush Gupta Department of Instrumentation & Control.

Chapter 12 FUSION OF FUZZY SYSTEM AND GENETIC ALGORITHMS Chi-Yuan Yeh.

EE749 I ntroduction to Artificial I ntelligence Genetic Algorithms The Simple GA.

Routing and Scheduling in Multistage Networks using Genetic Algorithms Advisor: Dr. Yi Pan Chunyan Ji 3/26/01.

Solving the Euclidean Non-Uniform Steiner Tree Problem Using a Genetic Algorithm Ian Frommer, Dept. of Mathematics, US Coast Guard Academy Bruce Golden,

Comparative Reproduction Schemes for Evolving Gathering Collectives A.E. Eiben, G.S. Nitschke, M.C. Schut Computational Intelligence Group Department of.

Neural Networks And Its Applications By Dr. Surya Chitra.

A Cooperative Coevolutionary Genetic Algorithm for Learning Bayesian Network Structures Arthur Carvalho

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.

Advanced AI – Session 6 Genetic Algorithm By: H.Nematzadeh.

EVOLUTIONARY SYSTEMS AND GENETIC ALGORITHMS NAME: AKSHITKUMAR PATEL STUDENT ID: GRAD POSITION PAPER.

Genetic Algorithm(GA)

George Yauneridge.  Machine learning basics  Types of learning algorithms  Genetic algorithm basics  Applications and the future of genetic algorithms.

Genetic Algorithms and Evolutionary Programming A Brief Overview.

Hirophysics.com The Genetic Algorithm vs. Simulated Annealing Charles Barnes PHY 327.

July 6, 2016Knowledge-Based System, Lecturer # 09 1 Knowledge Based System Lecture #09 Dr. Md. Hasanuzzaman Assistant Professor Department of Computer.

Evolutionary Algorithms Jim Whitehead

Evolving the goal priorities of autonomous agents

Example: Applying EC to the TSP Problem

An evolutionary approach to solving complex problems

Genetic Algorithms CPSC 212 Spring 2004.

Artificial Intelligence Chapter 4. Machine Evolution

Example: Applying EC to the TSP Problem

Behrouz Minaei, William Punch

Artificial Intelligence Chapter 4. Machine Evolution

Resource Allocation for Distributed Streaming Applications

Presentation transcript:

Static vs. Dynamic Populations in GAs for Coloring a Dynamic Graph Cara Monical Forrest Stonedahl GECCO ’14 July 16, 2014

Imagine You Want To… Allocate RegistersFrequenciesBatches For Conflicting VariablesDevicesJobs In Interpreted Program Mobile Ad Hoc Network Management System

Dynamic Graph Coloring GAs for Static Graph Coloring Galinier & Hao ‘99 many others Online Static Graph Coloring Lovász et. al. ‘89 Ant-Based Dynamic Graph Coloring Preuveneers & Berbers ‘04

Big Question Dynamic Problem Genetic Algorithm [Jin & Branke ‘05]

Genetic Algorithm Population of solutions Evaluate fitness Select fit individuals Perform Crossover Perform Mutation Pop Size: 100 Greedy DecoderTournament, size 3

Evaluate fitness Select fit individuals Reproduction: OX1 & SWAP Parent 1 Parent 2 Offspring Population of solutions Perform Crossover Perform Mutation AfterBefore * * Rate: 70% Rate: 50% [Starkweather ‘91]

Experimental Setup CDEAB 1. Graph 3. Dynamic Population (DGA) 2. DSATUR [Brélaz ‘79] 4. Static Population (SGA) AEBDCDCAEBECDBADAEBCBADCEEDCABADBECECDAB CBDEAADBECCAEDBAEBCD 4 3 ECDBADABCEDAEBCACDEB A E D C B EDCABCBDEAADBECCAEDBAEBCDECDBADABCEDAEBCACDEB

Experimental Setup 1. Graph 3. Dynamic Population (DGA) 2. DSATUR 4. Static Population (SGA) DEBFCFCBEDBDFECBCDFEDBCFE CBDEAADBECCAEDBAEBCD CBFDEBDECFFCEDBBECFDEBFDCFCEDBBDECFBECFD 6 FCEDBDECFBBDFECBDCFE A E D C B F BCDFEEBFDCFCEDBBDECFBECFDFCEDBDECFBBDFECBDCFE

Experimental Parameters Graph Properties Dynamic Properties n: Size, 100 p: Edge density,.6 Structure G(n,p,c v ) Euclidean cv: Vertex change rate,.01 e: Evolution a step, 1000

(Some) Big Answers (For this Problem & Algorithm) Dynamic Problem ≥ Succession of Static Problems 1. Highly Dynamic Problem ≈ Succession of Static Problems 2. Slightly Dynamic Problem > Succession of Static Problems 3.

Thank You Centre College Department of Computer Science and Department of Mathematics Centre College, John C. Young Program Contact Information Cara Monical University of Illinois at Urbana-Champaign Math Department Forrest Stonedahl Augustana College CS and Math Departments

Performance vs. Edge Density G(n,p,c v ) GraphsEuclidean Graphs

Performance vs. Evolution G(n,p,c v ) GraphsEuclidean Graphs