Simple Linkage Identification Using Genetic Clustering

摘要

The paper proposes a simple linkage identification method for binary optimization problems. The method is basically equivalent to the genetic clustering method, called GC, inspired by the speciation due to segregation distortion genes that was previously proposed by us. A genetic algorithm using the method, called GAuGC, is also proposed. The GAuGC is applied to decomposable, nearly decomposable, and indecomposable problems. The results show that the GAuGC better solves problems with weak decomposability than the linkage tree genetic algorithm for comparison and also show that it cannot handle the deception well.