Linkage Identification by Non-monotonicity Detection for Overlapping Functions

This paper presents the linkage identification by non-monotonicity detection (LIMD) procedure and its extension for overlapping functions by introducing the tightness detection (TD) procedure. The LIMD identifies linkage groups directly by performing order-2 simultaneous perturbations on a pair of loci to detect monotonicity/non-monotonicity of fitness changes. The LIMD can identify linkage groups with at most order of k when it is applied to O(2k) strings. The TD procedure calculates tightness of linkage between a pair of loci based on the linkage groups obtained by the LIMD. By removing loci with weak tightness from linkage groups, correct linkage groups are obtained for overlapping functions, which were considered difficult for linkage identification procedures.

[1]  Heinz Mühlenbein,et al.  The Equation for Response to Selection and Its Use for Prediction , 1997, Evolutionary Computation.

[2]  David E. Goldberg,et al.  Linkage Problem, Distribution Estimation, and Bayesian Networks , 2000, Evolutionary Computation.

[3]  Hillol Kargupta,et al.  The performance of the gene expression messy genetic algorithm on real test functions , 1996, Proceedings of IEEE International Conference on Evolutionary Computation.

[4]  Hillol Kargupta,et al.  Extending the class of order-k delineable problems for the gene expression messy genetic algorithm , 1996 .

[5]  Hillol Kargupta,et al.  The Gene Expression Messy Genetic Algorithm , 1996, Proceedings of IEEE International Conference on Evolutionary Computation.

[6]  Dirk Thierens,et al.  Mixing in Genetic Algorithms , 1993, ICGA.

[7]  H. Mühlenbein,et al.  From Recombination of Genes to the Estimation of Distributions I. Binary Parameters , 1996, PPSN.

[8]  H. Kargupta.  Search, polynomial complexity, and the fast messy genetic algorithm , 1996 .

[9]  Dirk Thierens,et al.  Toward a Better Understanding of Mixing in Genetic Algorithms , 1993 .

[10]  M. Pelikán,et al.  The Bivariate Marginal Distribution Algorithm , 1999 .

[11]  Gang Wang,et al.  Revisiting the GEMGA: scalable evolutionary optimization through linkage learning , 1998, 1998 IEEE International Conference on Evolutionary Computation Proceedings. IEEE World Congress on Computational Intelligence (Cat. No.98TH8360).

[12]  Giovanni Squillero,et al.  A new evolutionary algorithm inspired by the selfish gene theory , 1998, 1998 IEEE International Conference on Evolutionary Computation Proceedings. IEEE World Congress on Computational Intelligence (Cat. No.98TH8360).

[13]  G. Harik.  Learning gene linkage to efficiently solve problems of bounded difficulty using genetic algorithms , 1997 .

[14]  H. Kargupta.  SEARCH , Evolution , And The Gene Expression Messy Genetic Algorithm , 1994 .

[15]  Sanza T. Kazadi,et al.  Conjugate Schema in Genetic Search , 1997, ICGA.