Linkage identification for real-valued loci by fitness difference classification
Linkage identification for real-valued loci by fitness difference classification
复制标题
DOI:
10.1109/cec.2005.1554843
复制
发表时间:
2005-12
期刊:
影响因子:
--
通讯作者:
Miwako Tsuji;M. Munetomo;K. Akama
中科院分区:
文献类型:
--
作者:
Miwako Tsuji;M. Munetomo;K. Akama
In order to enhance efficiency of genetic algorithms, it is important to identify a linkage set, i.e. a set of loci tightly linked to construct a building block. In this paper, we propose a novel linkage identification method for real-valued strings called the real-valued dependency detection for distribution derived from df (rD/sup 5/). It can detect linkage sets with quasilinear fitness evaluations. The rD/sup 5/ is designed based on the D/sup 5/ which has been proposed for binary strings. It detects dependencies of loci by estimating the distribution of strings classified according to fitness differences. The rD/sup 5/ and the LINC-R which is one of linkage identification methods proposed elsewhere, provide approximate equivalent information about a function to be solved, however, the rD/sup 5/ performs smaller number of fitness evaluations than the LINC-R for larger functions. Although estimation of distribution algorithms (EDAs) also estimate distribution of strings, it is difficult for EDAs to solve a function composed of exponentially scaled subfunctions. The proposed method, by contrast, can be applied to the function in the similar way to as to a function composed of uniformly scaled subfunctions which is easy for EDAs. We perform experiments to compare the proposed method with the LINC-R and to examine the scaling effect stability of the rD/sup 5/. We also investigate two parameters, that define the amount of perturbation (mutation) and that define the quantization level.