Generalized Embedded Landscape and Its Decomposed Representation

  • Shude Zhou
  • Robert B. Heckendorn
  • Zengqi Sun
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4247)


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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    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)Google Scholar
  2. 2.
    Thierens, D.: Scalability Problems of Simple Genetic Algorithms. Evolutionary Computation 7(4), 331–352 (1999)CrossRefGoogle Scholar
  3. 3.
    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)Google Scholar
  4. 4.
    Kargupta, H.: The Gene Expression Messy Genetic Algorithm. In: Proceedings of the IEEE international conference on Evolutionary Computation, Nogoya, Japan (1996)Google Scholar
  5. 5.
    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)Google Scholar
  6. 6.
    Larrañaga, P., Lozano, J.A.: Estimation of Distribution Algorithms: A new Tool for Evolu-tionary Computation. Kluwer Academic Publishers, Dordrecht (2002)Google Scholar
  7. 7.
    Pelikan, M.: Hierarchical Bayesian Optimization Algorithm: Toward a New Generation of Evolutionary algorithms. Springer, Heidelberg (2005)zbMATHGoogle Scholar
  8. 8.
    Heckendorn, R.B.: Embedded Landscapes. Evolutionary Computation 10(4), 345–369 (2002)CrossRefGoogle Scholar
  9. 9.
    Kargupta, H., Park, B.: Gene Expression and Fast Construction of Distributed Evolu-tionary Representation. Evolutionary Computation 9(1), 43–69 (2001)CrossRefGoogle Scholar
  10. 10.
    Hechendorn, R.B., Wright, A.H.: Efficient Linkage Discovery by Limited Probing. Evolutionary Computation 12(4), 517–545 (2004)CrossRefGoogle Scholar
  11. 11.
    Oei, C.K.: Walsh Function Analysis of Genetic Algorithms of Nonbinary Strings. Unpublished Master’s Thesis, UIUC (1992)Google Scholar
  12. 12.
    Song, Y.Y.: Number Theory for Computing. Springer, Heidelberg (2002)zbMATHGoogle Scholar
  13. 13.
    Bak, J., Newman, D.J.: Complex Analysis. Springer, Heidelberg (1996)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Shude Zhou
    • 1
  • Robert B. Heckendorn
    • 2
  • Zengqi Sun
    • 1
  1. 1.Department of Computer Science and TechnologyTsinghua UniversityBeijingChina
  2. 2.Department of Computer ScienceUniversity of IdahoMoscowUSA

Personalised recommendations