Sciweavers

Share
EC
2007

Geometric Crossovers for Multiway Graph Partitioning

10 years 4 months ago
Geometric Crossovers for Multiway 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. Using a distance tailored to the problem at hand, the formal definition of geometric crossover allows us to design new problem-specific crossovers that embed problem-knowledge in the search. The standard encoding for multiway graph partitioning is highly redundant: each solution has a number of representations, one for each way of labeling the represented partition. Traditional crossover does not perform well on redundant encodings. We propose a new geometric crossover for graph partitioning based on a labeling-independent distance that filters out the redundancy of the encoding. A correlation analysis of the fitness landscape based on this distance shows that it is we...
Alberto Moraglio, Yong-Hyuk Kim, Yourim Yoon, Byun
Added 13 Dec 2010
Updated 13 Dec 2010
Type Journal
Year 2007
Where EC
Authors Alberto Moraglio, Yong-Hyuk Kim, Yourim Yoon, Byung Ro Moon
Comments (0)
books