Geometric Crossovers for Multiway Graph Partitioning

Abstract

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 a 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 well suited to graph partitioning. A second difficulty with designing a crossover for multiway graph partitioning is that of feasibility: in general recombining feasible partitions does not lead to feasible offspring partitions. We design a new geometric crossover for permutations with repetitions that naturally suits partition problems and we test it on the graph partitioning problem. We then combine it with the labeling-independent crossover and obtain a much superior geometric crossover inheriting both advantages.

Vertex Ordering, Clustering, and Their Application to Graph Partitioning

“…We made experiments on the six graphs that have been used in many studies [3,5,8,9,10,11,12,15]. The different classes of graphs are briefly described below.…”

“…They have also been successfully used to solve the graph partitioning problem [3,5,8,9,10,11,12]. Kim et al [6] presents a deep survey of genetic approaches for graph partitioning.…”

Improving Radio Frequency Identification-Based Localization Accuracy Using Computer-Vision-Assisted Sensor Deployment Technology

“…Thus, the upper bound and the lower bound are glued together as a glued space (or adjunction space, quotient space). According to previous studies, (24,25) performing crossover in a glued space can avoid the bias of offspring toward the center of the searching space. The bias of offspring may result in a boundary problem.…”

Trading hubs construction in electricity markets using evolutionary algorithms

“…tively. The alignment step in the crossover is similar to that in [14], but since the number of hubs in our problem instances is small, we solve the assignment problems using the complete enumeration.…”