Abstract
In this paper, embedded landscapes are extended to a non-binary discrete domain. Generalized embedded landscapes (GEL) are a class of additive decomposable problems where the representation can be expressed as a simple sum of subfunctions over subsets of the representation domain. The paper proposes a Generalized Embedding Theorem that reveals the close relationship between the underlying structure and the Walsh coefficients. Theoretical inductions show that the Walsh coefficients of any GEL with bounded difficulty can be calculated with a polynomial number of function evaluations. A deterministic algorithm is proposed to construct the decomposed representation of GEL. It offers an efficient way to detect the decomposable structure of the search space.
Shude Zhou and Zengqi Sun are funded by the National Key Project for Basic Research of China (G2002cb312205).
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
Kargupta, H., Bandyopadhyay, S.: A Perspective on the Foundation and Evolution of the Linkage Learning Genetic Algorithms. Journal of Computer Methods in Applied Mechan-ics and Engineering 186, 266–294 (2000)
Thierens, D.: Scalability Problems of Simple Genetic Algorithms. Evolutionary Computation 7(4), 331–352 (1999)
Goldberg, D.E., Deb, K., Kargupta, H., Harik, G.: Rapid, Accurate Optimization of Difficult Optimization Problems Using Fast Messy Genetic Agorithms. In: Proceedings of the Fifth International Conference on Genetic Algorithms, San Mateo, USA (1993)
Kargupta, H.: The Gene Expression Messy Genetic Algorithm. In: Proceedings of the IEEE international conference on Evolutionary Computation, Nogoya, Japan (1996)
Harik, G.R.: Learning Gene Linkage to Efficiently Solve Problems of Bounded Difficulty Using Genetic Algorithms. Ph.D. Thesis, University of Michigan, Ann Arbor, MI (1997)
Larrañaga, P., Lozano, J.A.: Estimation of Distribution Algorithms: A new Tool for Evolu-tionary Computation. Kluwer Academic Publishers, Dordrecht (2002)
Pelikan, M.: Hierarchical Bayesian Optimization Algorithm: Toward a New Generation of Evolutionary algorithms. Springer, Heidelberg (2005)
Heckendorn, R.B.: Embedded Landscapes. Evolutionary Computation 10(4), 345–369 (2002)
Kargupta, H., Park, B.: Gene Expression and Fast Construction of Distributed Evolu-tionary Representation. Evolutionary Computation 9(1), 43–69 (2001)
Hechendorn, R.B., Wright, A.H.: Efficient Linkage Discovery by Limited Probing. Evolutionary Computation 12(4), 517–545 (2004)
Oei, C.K.: Walsh Function Analysis of Genetic Algorithms of Nonbinary Strings. Unpublished Master’s Thesis, UIUC (1992)
Song, Y.Y.: Number Theory for Computing. Springer, Heidelberg (2002)
Bak, J., Newman, D.J.: Complex Analysis. Springer, Heidelberg (1996)
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
Zhou, S., Heckendorn, R.B., Sun, Z. (2006). Generalized Embedded Landscape and Its Decomposed Representation. In: Wang, TD., et al. Simulated Evolution and Learning. SEAL 2006. Lecture Notes in Computer Science, vol 4247. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11903697_2
Download citation
DOI: https://doi.org/10.1007/11903697_2
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-47331-2
Online ISBN: 978-3-540-47332-9
eBook Packages: Computer ScienceComputer Science (R0)