Geometric Crossover for Permutations with Repetitions: Application to Graph Partitioning A. Moraglio, Y-H. Kim, Y. Yoon, B-R. Moon & R. Poli PPSN 2006.

Slides:



Advertisements
Similar presentations
Crew Pairing Optimization with Genetic Algorithms
Advertisements

Population-based metaheuristics Nature-inspired Initialize a population A new population of solutions is generated Integrate the new population into the.
Hard Problems Some problems are hard to solve. No polynomial time algorithm is known Most combinatorial optimization problems are hard Popular NP-hard.
Ali Husseinzadeh Kashan Spring 2010
www.brainybetty.com1 MAVisto A tool for the exploration of network motifs By Guo Chuan & Shi Jiayi.
1 Transportation problem The transportation problem seeks the determination of a minimum cost transportation plan for a single commodity from a number.
Genetic Algorithms Contents 1. Basic Concepts 2. Algorithm
Linkage Learning in Evolutionary Algorithms. Recombination Missouri University of Science and Technology Recombination explores the search space Classic.
Topological Interpretation of Crossover Alberto Moraglio & Riccardo Poli GECCO 2004.
Geometric Landscape of Homologous Crossover for Syntactic Trees Alberto Moraglio & Riccardo Poli CEC 2005.
Content Based Image Clustering and Image Retrieval Using Multiple Instance Learning Using Multiple Instance Learning Xin Chen Advisor: Chengcui Zhang Department.
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.
Evolutionary Computational Intelligence
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.
Segmentation Graph-Theoretic Clustering.
Topological Crossover for the Permutation Representation Alberto Moraglio & Riccardo Poli GECCO 2005.
EAs for Combinatorial Optimization Problems BLG 602E.
Using a “Memetic” Evolutionary Algorithm to Solve a Form of The Maximum Clique Problem By Ian Baird November 20 th, 2003.
Preference Analysis Joachim Giesen and Eva Schuberth May 24, 2006.
Handling Constraints 報告者 : 王敬育. Many researchers investigated Gas based on floating point representation but the optimization problems they considered.
Geometric Interpretation of Crossover Alberto Moraglio BCTCS 2005.
Product Geometric Crossover for the Sudoku Puzzle Alberto Moraglio, Julian Togelius & Simon Lucas IEEE CEC 2006.
Genetic Algorithms Nehaya Tayseer 1.Introduction What is a Genetic algorithm? A search technique used in computer science to find approximate solutions.
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.
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.
Evolutionary algorithms
Genetic Algorithm.
Computer Implementation of Genetic Algorithm
SOFT COMPUTING (Optimization Techniques using GA) Dr. N.Uma Maheswari Professor/CSE PSNA CET.
Intro. ANN & Fuzzy Systems Lecture 36 GENETIC ALGORITHM (1)
Zorica Stanimirović Faculty of Mathematics, University of Belgrade
Combinatorial Algorithms Reference Text: Kreher and Stinson.
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.
Neural and Evolutionary Computing - Lecture 6
Dynamical Systems Model of the Simple Genetic Algorithm Introduction to Michael Vose’s Theory Rafal Kicinger Summer Lecture Series 2002.
Neural and Evolutionary Computing - Lecture 5 1 Evolutionary Computing. Genetic Algorithms Basic notions The general structure of an evolutionary algorithm.
1 Combinatorial Problem. 2 Graph Partition Undirected graph G=(V,E) V=V1  V2, V1  V2=  minimize the number of edges connect V1 and V2.
Crossovers and Mutation Richard P. Simpson. Genotype vs. Phenotype The genotype of a chromosome is just the basic data structure (it bits in a binary.
A New Evolutionary Approach for the Optimal Communication Spanning Tree Problem Sang-Moon Soak Speaker: 洪嘉涓、陳麗徽、李振宇、黃怡靜.
Chapter 12 FUSION OF FUZZY SYSTEM AND GENETIC ALGORITHMS Chi-Yuan Yeh.
Bijective tree encoding Saverio Caminiti. 2 Talk Outline Domains Prüfer-like codes Prüfer code (1918) Neville codes (1953) Deo and Micikevičius code (2002)
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.
1 Contents 1. Basic Concepts 2. Algorithm 3. Practical considerations Genetic Algorithm (GA)
Selection and Recombination Temi avanzati di Intelligenza Artificiale - Lecture 4 Prof. Vincenzo Cutello Department of Mathematics and Computer Science.
Evolutionary Computing Chapter 13. / 24 Chapter 13: Constraint Handling Motivation and the trouble What is a constrained problem? Evolutionary constraint.
Product Geometric Crossover Alberto Moraglio and Riccardo Poli Abstract Geometric crossover is a representation-independent definition of crossover based.
Resource-Constrained Project Scheduling Problem (RCPSP)
1 Combinatorial Problem. 2 Graph Partition Undirected graph G=(V,E) V=V1  V2, V1  V2=  minimize the number of edges connect V1 and V2.
Overview Last two weeks we looked at evolutionary algorithms.
Generating Permutations and Combinations “Traveling Salesman Problem” – A salesman must visit 6 cities; what’s the best order in which to visit them? Assume.
Estimation of Distribution Algorithm and Genetic Programming Structure Complexity Lab,Seoul National University KIM KANGIL.
1 Genetic Algorithms Contents 1. Basic Concepts 2. Algorithm 3. Practical considerations.
Example: Applying EC to the TSP Problem
An evolutionary approach to solving complex problems
Segmentation Graph-Theoretic Clustering.
Basics of Genetic Algorithms (MidTerm – only in RED material)
Example: Applying EC to the TSP Problem
Introduction to Operators
Example: Applying EC to the TSP Problem
Evolutionist approach
Multi-Objective Optimization
Basics of Genetic Algorithms
Population Based Metaheuristics
Population Methods.
Presentation transcript:

Geometric Crossover for Permutations with Repetitions: Application to Graph Partitioning A. Moraglio, Y-H. Kim, Y. Yoon, B-R. Moon & R. Poli PPSN 2006

Contents I.Geometric Crossover II.Geometric Crossover for Permutation with Repetitions III.Geometric Crossover for Graph Partitioning IV.Combination with Labelling-Independent Crossover V.Experimental Results VI.Conclusions

Geometric Crossover

Line segment A binary operator GX is a geometric crossover if all offspring are in a segment between its parents. Geometric crossover is dependent on the metric x y

Geometric Crossover The traditional n-point crossover is geometric under the Hamming distance A B A B X X H(A,X) + H(X,B) = H(A,B)

Many Recombinations are Geometric Traditional Crossover extended to multary strings Recombinations for real vectors PMX, Cycle Crossovers for permutations Homologous Crossover for GP trees Ask me for more examples over a coffee!

Being geometric crossover is important because…. We know how the search space is searched by geometric crossover for any representation: convex search We know a rule-of-thumb on what type of landscapes geometric crossover will perform well: “smooth” landscape This is just a beginning of general theory, in the future we will know more!

Geometric Crossover for Permutations with Repetitions

Geometric Crossover for Permutations PMX: geometric under swap distance Cycle Crossover: geometric under swap and Hamming distance (restricted to permutations) More crossovers for permutations are geometric We extend Cycle Crossover to permutations with repetitions and show its application to the graph partitioning problem The extended Cycle Crossover is still geometric under Hamming distance (restricted to permutations with repetitions) but not geometric under swap distance

Permutations with repetitions Simple permutation: (21453) Permutation with repetitions: ( ) Repetition class: (33111) We want to search the space of permutations belonging to the same repetition class

Generalized Cycle Crossover - Phase 1: find cycles

Generalized Cycle Crossover - Phase 2: mix cycles

Properties of the New Crossover 1. it preserves repetition class 2. it is a proper generalization of the cycle crossover (when applied to simple permutations, it behaves exactly like the cycle crossover) 3.it searches only a fraction of the space searched by traditional crossover 4.when applied to parent permutations with repetitions of different repetition class, offspring have intermediate repetition class

Geometric Crossover for Multiway Graph Partitioning

Cut size :

Cut size :

Feasible Solutions Balanced Solution: the difference in cardinality between the largest and the smallest subsets is at most one Balancedness is a hard constraint: feasible solutions are balanced, infeasible solution are not balanced Our evolutionary algorithm does not use any repairing mechanism. It restricts the search to the space of the balanced solutions using search operators that preserve balancedness

Searching Balanced Solution Space Representation: permutation with repetitions. Each Position in the permutation corresponds to a vertex in the graph. Each element of the permutation corresponds to a group Initial Population: equally balanced solutions belonging to the same repetition class Crossover: cycle crossover that preserves repetition class, hence balancedness Mutation: swap mutation that preserves repetition class, hence balancedness

Combination with Labelling-Independent Crossover

Graph encoding and Hamming distance Redundant encoding –Hamming distance is not natural different representations

Labeling-independent Distance & Crossover LI distance: Minimum Hamming distance between partitions over all possible relabelling LI Geometric Crossover: Relabel the second parent such as it is at minimum Hamming distance from first parent (normalization). Do the normal n- point crossover using the first parent and the normalized second parent.

Combination of Cycle Crossover and Labelling-Independent Crossover First: normalization of second parent on first parent Then: cycle crossover between first parent and normalised second parent Still geometric under LI-H distance restricted to balanced partitions

Experimental Results

Crossovers

Experimental Results 32-way partitioning (average results)

Experimental Results 32-way partitioning (average results)

Experimental Results 128-way partitioning (average results)

Experimental Results 128-way partitioning (average results)

Summary Geometric crossover: offspring are in the segment between parents Cycle crossover for permutation: geometric under Hamming distance Generalized cycle crossover: extension of cycle crossover with permutation with repetition. It is geometric under hamming distance and it is class-preserving Geometric crossover for graph partitioning: it searches only the space of feasible solutions (balanced partitions) that is a fraction of the search space searched by traditional crossover Combination with labelling-independent crossover: it filters the redundancy of the labelling and it searches only balanced partitions. It is a geometric crossover Experimental results: the combined geometric crossover has remarkable performance!

Thanks for your attention… questions?