Topological Interpretation of Crossover Alberto Moraglio & Riccardo Poli GECCO 2004.

Slides:



Advertisements
Similar presentations
Algorithm Design Techniques
Advertisements

Population-based metaheuristics Nature-inspired Initialize a population A new population of solutions is generated Integrate the new population into the.
A First Course in Genetic Algorithms
Temi Avanzati di Intelligenza Artificiale - Intro1 Temi Avanzati di Intelligenza Artificiale Prof. Vincenzo Cutello Department of Mathematics and Computer.
Ali Husseinzadeh Kashan Spring 2010
Linkage Learning in Evolutionary Algorithms. Recombination Missouri University of Science and Technology Recombination explores the search space Classic.
Geometric Landscape of Homologous Crossover for Syntactic Trees Alberto Moraglio & Riccardo Poli CEC 2005.
Inbreeding Properties of Geometric Crossover and Non- geometric Recombinations Alberto Moraglio & Riccardo Poli ECAI 2006.
Geometric Crossover for the Permutation Representation Alberto Moraglio & Riccardo Poli GSICE 2005.
Genetic Algorithms1 COMP305. Part II. Genetic Algorithms.
Hybridization of Search Meta-Heuristics Bob Buehler.
Evolutionary Computational Intelligence
A new crossover technique in Genetic Programming Janet Clegg Intelligent Systems Group Electronics Department.
Geometric Crossover for Biological Sequences Alberto Moraglio, Riccardo Poli & Rolv Seehuus EuroGP 2006.
Population New Population Selection Crossover and Mutation Insert When the new population is full repeat Generational Algorithm.
A simple EA and Common Search Operators Temi avanzati di Intelligenza Artificiale - Lecture 2 Prof. Vincenzo Cutello Department of Mathematics and Computer.
Chapter 10: Algorithm Design Techniques
Geometric Crossover for Permutations with Repetitions: Application to Graph Partitioning A. Moraglio, Y-H. Kim, Y. Yoon, B-R. Moon & R. Poli PPSN 2006.
Topological Crossover for the Permutation Representation Alberto Moraglio & Riccardo Poli GECCO 2005.
EAs for Combinatorial Optimization Problems BLG 602E.
Genetic Algorithms Sushil J. Louis Evolutionary Computing Systems LAB Dept. of Computer Science University of Nevada, Reno
Tutorial 1 Temi avanzati di Intelligenza Artificiale - Lecture 3 Prof. Vincenzo Cutello Department of Mathematics and Computer Science University of Catania.
Geometric Interpretation of Crossover Alberto Moraglio BCTCS 2005.
Product Geometric Crossover for the Sudoku Puzzle Alberto Moraglio, Julian Togelius & Simon Lucas IEEE CEC 2006.
Geometric Crossover for Multiway Graph Partitioning Yong-Hyuk Kim, Yourim Yoon, Alberto Moraglio, and Byung-Ro Moon.
Geometric Unification of Evolutionary Algorithms Alberto Moraglio EvoPhD 2006.
Genetic Algorithms Overview Genetic Algorithms: a gentle introduction –What are GAs –How do they work/ Why? –Critical issues Use in Data Mining –GAs.
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.
Prepared by Barış GÖKÇE 1.  Search Methods  Evolutionary Algorithms (EA)  Characteristics of EAs  Genetic Programming (GP)  Evolutionary Programming.
Evolutionary algorithms
Genetic Algorithm.
Genetic Algorithms and Ant Colony Optimisation
Introduction to Genetic Algorithms and Evolutionary Computation
SOFT COMPUTING (Optimization Techniques using GA) Dr. N.Uma Maheswari Professor/CSE PSNA CET.
CS Machine Learning Genetic Algorithms (II).
Lecture 8: 24/5/1435 Genetic Algorithms Lecturer/ Kawther Abas 363CS – Artificial Intelligence.
Zorica Stanimirović Faculty of Mathematics, University of Belgrade
Design of an Evolutionary Algorithm M&F, ch. 7 why I like this textbook and what I don’t like about it!
Introduction to GAs: Genetic Algorithms How to apply GAs to SNA? Thank you for all pictures and information referred.
Introduction to Evolutionary Algorithms Session 4 Jim Smith University of the West of England, UK May/June 2012.
Genetic Algorithms Genetic Algorithms – What are they? And how they are inspired from evolution. Operators and Definitions in Genetic Algorithms paradigm.
Algorithms and their Applications CS2004 ( ) 13.1 Further Evolutionary Computation.
1 Genetic Algorithms and Ant Colony Optimisation.
Why do GAs work? Symbol alphabet : {0, 1, * } * is a wild card symbol that matches both 0 and 1 A schema is a string with fixed and variable symbols 01*1*
Edge Assembly Crossover
Genetic Algorithms What is a GA Terms and definitions Basic algorithm.
Chapter 12 FUSION OF FUZZY SYSTEM AND GENETIC ALGORITHMS Chi-Yuan Yeh.
1. Genetic Algorithms: An Overview  Objectives - Studying basic principle of GA - Understanding applications in prisoner’s dilemma & sorting network.
CS621: Artificial Intelligence Pushpak Bhattacharyya CSE Dept., IIT Bombay Lecture 5: Power of Heuristic; non- conventional search.
Geometric Crossover for Sets, Multisets and Partitions Alberto Moraglio and Riccardo Poli Abstract We extend a geometric framework for interpreting crossover.
D Nagesh Kumar, IIScOptimization Methods: M8L5 1 Advanced Topics in Optimization Evolutionary Algorithms for Optimization and Search.
GENETIC ALGORITHMS Tanmay, Abhijit, Ameya, Saurabh.
Genetic Algorithms MITM613 (Intelligent Systems).
1 Chapter 3 GAs: Why Do They Work?. 2 Schema Theorem SGA’s features: binary encoding proportional selection one-point crossover strong mutation Schema.
Product Geometric Crossover Alberto Moraglio and Riccardo Poli Abstract Geometric crossover is a representation-independent definition of crossover based.
Genetic algorithm. Definition The genetic algorithm is a probabilistic search algorithm that iteratively transforms a set (called a population) of mathematical.
Presented By: Farid, Alidoust Vahid, Akbari 18 th May IAUT University – Faculty.
Introduction to Genetic Algorithms
Evolutionary Algorithms Jim Whitehead
Dr. Kenneth Stanley September 13, 2006
C.-S. Shieh, EC, KUAS, Taiwan
Example: Applying EC to the TSP Problem
Example: Applying EC to the TSP Problem
Artificial Intelligence Chapter 4. Machine Evolution
Example: Applying EC to the TSP Problem
Genetic Algorithms Chapter 3.
Artificial Intelligence Chapter 4. Machine Evolution
Using Quotient Graphs to Model Neutrality in Evolutionary Search Dominic Wilson Devinder Kaur University of Toledo.
Beyond Classical Search
Presentation transcript:

Topological Interpretation of Crossover Alberto Moraglio & Riccardo Poli GECCO 2004

Contents I.Topological Interpretation & Generalization of Crossover & Mutation II.Geometric Interpretation & Formalization III.Implications IV.Current & Future Work

I. Topological Interpretation & Generalization

What is crossover? Crossover Is there any common aspect ? Is it possible to give a representation- independent definition of crossover and mutation?

Genetic operators & Neighbourhood structure Forget the representation and consider the neighbourhood structure (= search space structure) Mutation: offspring are “close to” their parent  in the direct neighbourhood

Direct Neighbour Mutation Representation: Binary String Move: Bit Flip Neighbourhood: Hamming Representation + Move = Neighbourhood ? Mutation: Offspring in the direct neighbourhood What is crossover?

Neighbourhood and Crossover Crossover idea: combining parents genotypes to get children genotypes “somewhere in between” them Topologically speaking, “somewhere in between” = somewhere on a shortest path Why on a shortest path?

Shortest Path Crossover D0 : P1 D2 : P2 D1 Parent1: Parent2: Children: 01*1*1 Children are on shortest paths More than one shortest path in general

Interpretation & Generalization Traditional mutation & crossover have a natural interpretation in the neighbourhood structure in terms of closeness and betweenness Given any representation plus a notion of neighbourhood (move), mutation & crossover operators are well-defined

II. Geometric Interpretation & Formalization

From graphs to geometry Forget the neighbourhood structure and consider the metric space (= space with a notion of distance) The distance in the neighbourhood is the length of the shortest path connecting two solutions Mutation  Direct neighbourhood  Ball Crossover  All shortest paths  Line Segment

Balls & Segments In a metric space (S, d) the closed ball is the set of the form where x belongs to S and r is a positive real number called the radius of the ball. In a metric space (S, d) the line segment or closed interval is the set of the form where x and y belong to S and are called extremes of the segment and identify the segment.

Squared balls & Chunky segments B(000; 1) Hamming space 3 B((3, 3); 1) Euclidean space 3 B((3, 3); 1) Manhattan space Balls [000; 011] = [001; 010] 2 geodesics Hamming space 1 3 [(1, 1); (3, 2)] 1 geodesic Euclidean space 1 3 [(1, 1); (3, 2)] = [(1, 2); (3, 1)] infinitely many geodesics Manhattan space Line segments

Uniform Mutation & Uniform Crossover Uniform topological crossover: Uniform topological ε-mutation: Genetic operators have a geometric nature

Representation independent and rigorous definition of crossover and mutation in the neighbourhood seen as a geometric space

III. Implications: - Crossover Principled Design - Simplification & Clarification - Unification & General Theory

I - Crossover Principled Design Domain specific solution representation is effective Problem: for non-standard representations it is not clear how crossover should look like But: given a combinatorial problem you may know already a good neighbourhood structure Topological Interpretation of Crossover  Give me your neighbourhood definition and I give you a crossover definition

+= ? Crossover Design Example

Non-labelled graph neighbourhood MOVE: Insert/remove an edge Fixed number of nodes

+ Offspring

II - Simplification & Clarification Other theories: –Recombination spaces based on hyper- neighbourhoods –Crossover & mutation are seen as completely independent operators using different search spaces Topological crossover: –Crossover interpreted naturally in the classical neighbourhood –Crossover and mutation in the same space (direct comparison with other search methods (local search))

Clarification: Equivalences Theorem Space Structure Topological Crossover Topological Mutation Distance Neighbourhood Function Neighbourhood Graph Topological Crossover & Topological Mutation Isomorphism One Distance, One Mutation, One Crossover One Representation, Various Edit Distances, One Crossover for each Distance

III – Unification & General theory One EC theory problem: –EC theory is fragmented. There is not a unified way to deal with different representations. Topological framework: –Topological genetic operators are rigorously defined without any reference to the representation. These definitions are a promising starting point for a general and rigorous theory of EC.

IV. Current & Future Work

Work in progress EAs Unification: Existing crossovers and mutations fit the topological definitions Preliminary work on important representations: –Binary strings (genetic algorithms) –Real-valued vectors (evolutionary strategy) –Permutations (ga for comb. optimisation) –Parse trees (genetic programming) –DNA strands (nature)

Future work THEORY: Generalizing and accommodating pre-existent theories into topological framework (schema theorem, fitness landscapes, representation theories…) PRACTICE: Testing crossover principled design on important problems with non- standard representation (problem domain representation)

Questions?