A novel splicing/decomposable binary encoding and its operators for genetic and evolutionary algorithms

Abstract In this paper, we introduce a new genetic representation — a splicing/decomposable (S/D) binary encoding, which was proposed based on some theoretical guidance and existing recommendations for designing efficient genetic representations. The S/D binary representation can be spliced and decomposed to describe potential solutions of the problem with different precisions by different number of uniform-salient building blocks (BBs). According to the characteristics of the S/D binary representation, genetic and evolutionary algorithms (GEAs) can be applied from the high scaled to the low scaled BBs sequentially to avoid a noise from the competing BBs and improve GEAs’ performance. Our theoretical and empirical investigations reveal that the S/D binary representation is more proper than other existing binary encodings for GEAs searching. Moreover, we define a new genotypic distance on the S/D binary space, which is equivalent to the Euclidean distance on the real-valued space during GEAs convergence. Based on the new genotypic distance, GEAs can reliably and predictably solve problems of bounded complexity and the methods depended on the Euclidean distance for solving different kinds of optimization problems can be directly used on the S/D binary space.

[1]  David E. Goldberg,et al.  Time Complexity of genetic algorithms on exponentially scaled problems , 2000, GECCO.

[2]  Kwong-Sak Leung,et al.  Efficiency speed‐up strategies for evolutionary computation: an adaptive implementation , 2002 .

[3]  GUNAR E. LIEPINS,et al.  Representational issues in genetic optimization , 1990, J. Exp. Theor. Artif. Intell..

[4]  Kwong-Sak Leung,et al.  Efficiency speed-up strategies for evolutionary computation: fundamentals and fast-GAs , 2003, Appl. Math. Comput..

[5]  Richard W. Hamming,et al.  Coding and Information Theory , 1980 .

[6]  E. Cantu-Paz,et al.  The Gambler's Ruin Problem, Genetic Algorithms, and the Sizing of Populations , 1997, Evolutionary Computation.

[7]  L. Darrell Whitley,et al.  Local Search and High Precision Gray Codes: Convergence Results and Neighborhoods , 2000, FOGA.

[8]  Jong-Hwan Kim,et al.  Genetic quantum algorithm and its application to combinatorial optimization problem , 2000, Proceedings of the 2000 Congress on Evolutionary Computation. CEC00 (Cat. No.00TH8512).

[9]  Rajarshi Das,et al.  A Study of Control Parameters Affecting Online Performance of Genetic Algorithms for Function Optimization , 1989, ICGA.

[10]  Franz Rothlauf,et al.  Representations for genetic and evolutionary algorithms , 2002, Studies in Fuzziness and Soft Computing.

[11]  Kwong-Sak Leung,et al.  Evolution strategies with exclusion-based selection operators and a Fourier series auxiliary function , 2003, Appl. Math. Comput..

[12]  John H. Holland,et al.  Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .

[13]  Kwong-Sak Leung,et al.  Adaptive Elitist-Population Based Genetic Algorithm for Multimodal Function Optimization , 2003, GECCO.

[14]  J. David Schaffer,et al.  Proceedings of the third international conference on Genetic algorithms , 1989 .

[15]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

[16]  Bernhard Sendhoff,et al.  A Condition for the Genotype-Phenotype Mapping: Causality , 1997, ICGA.