Generalized cycle crossover for graph partitioning

Authors:
Alberto Moraglio;Yong-Hyuk Kim;Yourim Yoon;Byung-Ro Moon;Riccardo Poli
Affiliations:
University of Essex, Colchester, UK;Seoul National University, Seoul, Korea;Seoul National University, Seoul, Korea;Seoul National University, Seoul, Korea;University of Essex, Colchester, UK
Venue:
Proceedings of the 8th annual conference on Genetic and evolutionary computation
Year:
2006

Citing 0
Cited 5

New efficient techniques for dynamic detection of likely invariants

ICANNGA'11 Proceedings of the 10th international conference on Adaptive and natural computing algorithms - Volume Part I
Geometry of evolutionary algorithms

Proceedings of the 13th annual conference companion on Genetic and evolutionary computation
Localizing program logical errors using extraction of knowledge from invariants

SEA'11 Proceedings of the 10th international conference on Experimental algorithms
Geometric crossover for sets, multisets and partitions

PPSN'06 Proceedings of the 9th international conference on Parallel Problem Solving from Nature
Geometry of evolutionary algorithms

Proceedings of the 14th annual conference companion on Genetic and evolutionary computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

We propose a new crossover that generalizes cycle crossover to permutations with repetitions and naturally suits partition problems. We tested it on graph partitioning problems obtaining excellent results.