Geometric Crossover for Permutations with Repetitions : Application to Graph Partitioning


Geometric crossover is a representation-independent generalization of the traditional crossover defined using the distance of the solution space. By choosing a distance firmly rooted in the syntax of the solution representation as basis for geometric crossover, one can design new crossovers for any representation. In previous work we have applied geometric… (More)

5 Figures and Tables


  • Presentations referencing similar topics