Abstract
A good performance of traditional genetic algorithm is determined by its ability to identify building blocks and grow them to larger ones. To attain this objective a properly arranged chromosome is needed to ensure that building blocks will survive the application of recombination operators. The proposed algorithm periodically rearranges the order of genes in the chromosome while the actual information about the inter-gene dependencies is calculated on-line through the run. Standard 2-point crossover, operating on the adapted chromosomal structure, is used to generate new solutions. Experimental results show that this algorithm is able to solve separable problems with strong intra building block dependencies among genes as well as the hierarchical problems.
Keywords
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Goldberg, D.E., Korb, B., Deb, K.: Messy genetic algorithms: Motivation, analysis and first results. Complex Systems 3(5), 493–530 (1989)
Harik, G., Goldberg, D.E.: Learning linkage. In: Foundations of Genetic Algorithms IV, pp. 270–285. Morgan Kaufmann, San Mateo (1997)
Harik, G.: Linkage learning via probabilistic modeling in the ECGA. IlliGAL Report N. 99010, University of Illinois at Urbana-Champaign, Urbana, IL (1999)
Kubalik, J., Rothkrantz, L.J.M., Lazansky, J.: Genetic Algorithm with Limited Convergence. In: Grana, M., Duro, R., d’Anjou, A., Wang, P.P. (eds.) Information Processing with Evolutionary Algorithms: From Industrial Applications to Academic Speculations, pp. 216–235. Springer, Heidelberg (2005)
Kwon, Y.K., Hong, S.D., Moon, B.R.: A Genetic Hybrid For Critical Heat Flux Function Approximation. In: Langdon, W.B., et al. (eds.) Proceedings of GECCO 2002, pp. 1119–1125. Morgan Kaufmann Publishers, San Francisco (2002)
Munetomo, M., Goldberg, D.E.: Linkage identification by non-monotonicity detection for overlapping functions. Evolutionary Computation 7(4), 377–398 (1999)
Pelikan, M., Muehlenbein, H.: The Bivariate Marginal Distribution Algorithm. In: Roy, R., Furuhashi, T., Chawdhry, P.K. (eds.) Advances in Soft Computing - Engineering Design and Manufacturing, pp. 521–535. Springer, Heidelberg (1999)
Pelikan, M., Goldberg, D.E., Cantu-Paz, E.: Linkage learning, estimation distribution, and Bayesian networks. Evolutionary Computation 8(3), 314–341 (2000)
Pelikan, M., Goldberg, D.E.: Escaping hierarchical traps with competent genetic algorithms. In: Spector, L., et al. (eds.) Proceedings of the GECCO 2001, pp. 511–518. Morgan Kaufmann, San Francisco (2001)
Watson, R.A., Hornby, G.S., Pollack, J.B.: Modeling Building-Block Interdependency. In: Eiben, A.E., Bäck, T., Schoenauer, M., Schwefel, H.-P. (eds.) PPSN 1998. LNCS, vol. 1498, Springer, Heidelberg (1998)
Whitley, D.: Fundamental Principles of Deception in Genetic Search. In: Rawlins, G. (ed.) Foundations of Genetic Algorithms, pp. 221–241. Morgan Kaufmann, San Francisco (1991)
Yu, T.-L., Goldberg, D.E.: Dependency Structure Matrix Analysis: Offline Utility of the Dependency Structure Matrix Genetic Algorithm. In: Deb, K., et al. (eds.) Proceedings of GECCO 2004, pp. 355–366. Springer, Berlin/Heidelberg (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kubalík, J., Pošík, P., Herold, J. (2006). A Selecto-recombinative Genetic Algorithm with Continuous Chromosome Reconfiguration. In: Runarsson, T.P., Beyer, HG., Burke, E., Merelo-Guervós, J.J., Whitley, L.D., Yao, X. (eds) Parallel Problem Solving from Nature - PPSN IX. PPSN 2006. Lecture Notes in Computer Science, vol 4193. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11844297_97
Download citation
DOI: https://doi.org/10.1007/11844297_97
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-38990-3
Online ISBN: 978-3-540-38991-0
eBook Packages: Computer ScienceComputer Science (R0)