Generalized cycle crossover for graph partitioning

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. Categories and Subject Descriptors: G.2.3 [Mathematics of Computing]: DISCRETE MATHEMATICS

• Type: Conference
• Year: 2006
• Where: GECCO
• Authors: Alberto Moraglio, Yong-Hyuk Kim, Yourim Yoon, Byung Ro Moon, Riccardo Poli
• Keywords: Cycle Crossover, GECCO 2006, Graph Partitioning Problems, Optimization, Suits Partition Problems