Geometric Crossover for Multiway Graph Partitioning Yong-Hyuk Kim, Yourim Yoon, Alberto Moraglio, and Byung-Ro Moon.

Slides:



Advertisements
Similar presentations
Genetic Algorithms Chapter 3. A.E. Eiben and J.E. Smith, Introduction to Evolutionary Computing Genetic Algorithms GA Quick Overview Developed: USA in.
Advertisements

Fitness Uniform Deletion: A Simple Way to Preserve Diversity Shane Legg & Marcus Hutter IDSIA Galleria Manno-Lugano Switzerland.
Fitness Uniform Selection Scheme (FUSS) Shane Legg & Marcus Hutter IDSIA, Switzerland Akshat Kumar Indian Institute of Technology.
Ali Husseinzadeh Kashan Spring 2010
Relevant characteristics extraction from semantically unstructured data PhD title : Data mining in unstructured data Daniel I. MORARIU, MSc PhD Supervisor:
1 An Adaptive GA for Multi Objective Flexible Manufacturing Systems A. Younes, H. Ghenniwa, S. Areibi uoguelph.ca.
S I E M E N S C O R P O R A T E R E S E A R C H 1 1 A Seeded Image Segmentation Framework Unifying Graph Cuts and Random Walker Which Yields A New Algorithm.
Linkage Learning in Evolutionary Algorithms. Recombination Missouri University of Science and Technology Recombination explores the search space Classic.
Genetic Algorithms as a Tool for General Optimization Angel Kuri 2001.
Topological Interpretation of Crossover Alberto Moraglio & Riccardo Poli GECCO 2004.
Geometric Landscape of Homologous Crossover for Syntactic Trees Alberto Moraglio & Riccardo Poli CEC 2005.
A GENETIC ALGORITHM APPROACH TO SPACE LAYOUT PLANNING OPTIMIZATION Hoda Homayouni.
Non-Linear Problems General approach. Non-linear Optimization Many objective functions, tend to be non-linear. Design problems for which the objective.
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.
1 IOE/MFG 543 Chapter 14: General purpose procedures for scheduling in practice Section 14.5: Local search – Genetic Algorithms.
1 Lecture 8: Genetic Algorithms Contents : Miming nature The steps of the algorithm –Coosing parents –Reproduction –Mutation Deeper in GA –Stochastic Universal.
1 Segmentation with Global Optimal Contour Xizhou Feng 4/25/2003.
Finite State Machine State Assignment for Area and Power Minimization Aiman H. El-Maleh, Sadiq M. Sait and Faisal N. Khan Department of Computer Engineering.
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.
1 Genetic Algorithms. CS The Traditional Approach Ask an expert Adapt existing designs Trial and error.
Learning from Experience: Case Injected Genetic Algorithm Design of Combinational Logic Circuits Sushil J. Louis Genetic Algorithm Systems Lab(gaslab)
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.
Intro to AI Genetic Algorithm Ruth Bergman Fall 2002.
Geometric Interpretation of Crossover Alberto Moraglio BCTCS 2005.
Product Geometric Crossover for the Sudoku Puzzle Alberto Moraglio, Julian Togelius & Simon Lucas IEEE CEC 2006.
Computer Science Genetic Algorithms10/13/10 1 An Investigation of Niching and Species Formation in Genetic Function Optimization Kalyanmoy Deb David E.
Intro to AI Genetic Algorithm Ruth Bergman Fall 2004.
Genetic Algorithm What is a genetic algorithm? “Genetic Algorithms are defined as global optimization procedures that use an analogy of genetic evolution.
Geometric Unification of Evolutionary Algorithms Alberto Moraglio EvoPhD 2006.
Prepared by Barış GÖKÇE 1.  Search Methods  Evolutionary Algorithms (EA)  Characteristics of EAs  Genetic Programming (GP)  Evolutionary Programming.
SOFT COMPUTING (Optimization Techniques using GA) Dr. N.Uma Maheswari Professor/CSE PSNA CET.
Hierarchical Distributed Genetic Algorithm for Image Segmentation Hanchuan Peng, Fuhui Long*, Zheru Chi, and Wanshi Siu {fhlong, phc,
CS Machine Learning Genetic Algorithms (II).
2004, 9/1 1 Optimal Content-Based Video Decomposition for Interactive Video Navigation Anastasios D. Doulamis, Member, IEEE and Nikolaos D. Doulamis, Member,
Ch.12 Machine Learning Genetic Algorithm Dr. Bernard Chen Ph.D. University of Central Arkansas Spring 2011.
Introduction to GAs: Genetic Algorithms How to apply GAs to SNA? Thank you for all pictures and information referred.
The Generational Control Model This is the control model that is traditionally used by GP systems. There are a distinct number of generations performed.
Applying Genetic Algorithm to the Knapsack Problem Qi Su ECE 539 Spring 2001 Course Project.
Derivative Free Optimization G.Anuradha. Contents Genetic Algorithm Simulated Annealing Random search method Downhill simplex method.
1 Genetic Algorithms and Ant Colony Optimisation.
 Based on observed functioning of human brain.  (Artificial Neural Networks (ANN)  Our view of neural networks is very simplistic.  We view a neural.
Genetic Algorithms What is a GA Terms and definitions Basic algorithm.
ECE 103 Engineering Programming Chapter 52 Generic Algorithm Herbert G. Mayer, PSU CS Status 6/4/2014 Initial content copied verbatim from ECE 103 material.
1 Effect of Spatial Locality on An Evolutionary Algorithm for Multimodal Optimization EvoNum 2010 Ka-Chun Wong, Kwong-Sak Leung, and Man-Hon Wong Department.
Chapter 12 FUSION OF FUZZY SYSTEM AND GENETIC ALGORITHMS Chi-Yuan Yeh.
Genetic Algorithms. The Basic Genetic Algorithm 1.[Start] Generate random population of n chromosomes (suitable solutions for the problem) 2.[Fitness]
Alice E. Smith and Mehmet Gulsen Department of Industrial Engineering
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.
Selection and Recombination Temi avanzati di Intelligenza Artificiale - Lecture 4 Prof. Vincenzo Cutello Department of Mathematics and Computer Science.
Agenda  INTRODUCTION  GENETIC ALGORITHMS  GENETIC ALGORITHMS FOR EXPLORING QUERY SPACE  SYSTEM ARCHITECTURE  THE EFFECT OF DIFFERENT MUTATION RATES.
Product Geometric Crossover Alberto Moraglio and Riccardo Poli Abstract Geometric crossover is a representation-independent definition of crossover based.
Genetic Algorithms An Evolutionary Approach to Problem Solving.
Genetic Algorithm (Knapsack Problem)
Genetic Algorithm in TDR System
Bulgarian Academy of Sciences
Balancing of Parallel Two-Sided Assembly Lines via a GA based Approach
Speciation/Niching The original SGA (Simple GA) is designed to rapidly search the landscape (exploration) and zoom in (exploitation) on a single solution.
Kalyanmoy Deb David E. Goldberg
An evolutionary approach to solving complex problems
Advanced Artificial Intelligence Feature Selection
Genetic Algorithms overview
Beyond Classical Search
Presentation transcript:

Geometric Crossover for Multiway Graph Partitioning Yong-Hyuk Kim, Yourim Yoon, Alberto Moraglio, and Byung-Ro Moon

Contents Multiway graph partitioning Geometric crossover –Hamming distance –Labeling-independent distance Fitness landscape analysis Experimental results Conclusions

Multiway Graph Partitioning Problem

Multiway Graph Partitioning Cut size : 5

Multiway Graph Partitioning Cut size : 6

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)

K-ary encoding and Hamming distance Redundant encoding –Hamming distance is not natural different representations

Labeling-independent Distance Given two K-ary encoding, and,, where is a metric. If the metric is the Hamming distance H, LI can be computed efficiently by the Hungarian method.

Labeling-independent Distance A = , B = LI(A,B) = 3

N-point LI-GX Definition (N-point LI-GX) –Normalize the second parent to the first under the Hamming distance. Do the normal n-point crossover using the first parent and the normalized second parent. The n-point LI-GX is geometric under the labeling-independent metric.

Fitness Landscape Analysis

Distance Distributions SpaceE(d) (all-partition, H) (local-optimum, H) (all-partition, LI) (local-optimum, LI)

Normalized correlogram

Global Convexity Hamming distance Correlation coefficient -0.11

Global Convexity Labeling-independent distance Correlation coefficient 0.79

Experimental Results

Genetic Framework GA + FM variant Population size : 50 Selection –Roulette-wheel proportional selection Replacement –Genitor-style replacement Steady-state GA

Test Environment Data Set –Johnson’s benchmark data –4 random graphs (G*.*) and 4 random geometric graphs (U*.*) with 500 vertices. –Used in a number of other graph- partitioning studies. Tests on 32-way and 128-way partitioning

Experimental Results 32-way partitioning

Experimental Results 32-way partitioning

Experimental Results 128-way partitioning

Experimental Results 128-way partitioning

Conclusion Methodology –Designed a geometric crossover based on the labeling independent distance. –Provided evidence for the fact that the labeling-independent distance is more suitable for the multiway graph partitioning problem by the fitness landscape analysis. Performance –Performed better than existing genetic algorithms.