Deterministic Divide-and-Conquer Algorithm for Decomposable Black-Box Optimization Problems with Bounded Difficulty

  • Shude Zhou
  • Zengqi Sun
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4247)


There is a class of GA-hard problems for which classical genetic algorithms often fail to obtain optimal solutions. In this paper, we focus on a class of very typical GA-hard problems that we call decomposable black-box optimization problems (DBBOP). Different from random methods in GA literature, two “deterministic” divide-and-conquer algorithms DA1 and DA2 are proposed respectively for non-overlapping and overlapping DBBOP, in which there are no classical genetic operations and even no random operations. Given any DBBOP with dimension l and bounded order k, our algorithms can always reliably and accurately obtain the optimal solutions in deterministic way using O(l k ) function evaluations.


Genetic Algorithm Time Complexity Evolutionary Computation Decomposition Algorithm Deterministic Algorithm 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Kargupta, H., Park, B.: Gene Expression and Fast Construction of Distributed Evolutionary Representation. Evolutionary Computation 9, 43–69 (2001)CrossRefGoogle Scholar
  2. 2.
    Goldberg, D.E., Deb, K., Kargupta, H., Harik, G.: Rapid, Accurate Optimization of difficult Optimization Problems Using Fast Messy Genetic Algorithms. In: Proceedings of the fifth international conference on Genetic Algorithm, San Mateo, California, pp. 56–64 (1993)Google Scholar
  3. 3.
    Goldberg, D.E.: Genetic Algorithms and Walsh Functions: Part I, a Gentle Introduction. Complex Systems 3, 129–152 (1989)MATHMathSciNetGoogle Scholar
  4. 4.
    Goldberg, D.E.: Genetic Algorithms and Walsh Functions: Part II, Deception and its Analysis. Complex Systems 3, 153–171 (1989)MATHMathSciNetGoogle Scholar
  5. 5.
    David, H.W., William, G.M.: No Free Lunch Theorems for Optimization. IEEE Trans. Evolutionary Computation 1, 67–80 (1997)CrossRefGoogle Scholar
  6. 6.
    Heckendorn, R.B.: Embedded Landscapes. Evolutionary Computation 10 (2002)Google Scholar
  7. 7.
    Sami, K.: Transform Methods: Walsh Analysis, Walsh Transforms. In: Handbook of Evolutionary Computation, IOP Publishing Ltd and Oxford University Press (1995)Google Scholar
  8. 8.
    Whitley, D.: Fundamental Principles of Deception in Genetic Search. In: Rawlins, G.J.E. (ed.) Foundations of Genetic Algorithms, Morgan Kaufmann, San Mateo (1991)Google Scholar
  9. 9.
    Pelikan, M., Goldberg, D.E., Cantú-Paz, E.: Linkage Problem, Distribution Estimation, and Bayesian Networks. Evolutionary Computation 8(3), 311–340 (2000)CrossRefGoogle Scholar
  10. 10.
    Pelikan, M., Goldberg, D.E., Lobo, F.G.: A survey of optimization by building and using probabilistic models. Computational Optimization and Applications 21, 5–12 (2002)MATHCrossRefMathSciNetGoogle Scholar
  11. 11.
    Larrañaga, P., Lozano, J.A.: Estimation of Distribution Algorithms: A new Tool for Evolutionary Computation. Kluwer Academic Publishers, Dordrecht (2002)MATHGoogle Scholar
  12. 12.
    Kargupta, H.: The gene expression messy genetic algorithm. In: Proceedings of the IEEE international conference on Evolutionary Computation, Nogoya, Japan (1996)Google Scholar
  13. 13.
    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
  14. 14.
    Mühlenbein, H., Mahnig, T.: FDA–Scalable Evolutionary Algorithm for the Optimization of Additively Decomposed Functions. Evolutionary Computation 7, 353–376 (1999)CrossRefGoogle Scholar
  15. 15.
    Hechendorn, R.B., Wright, A.H.: Efficient Linkage Discovery by Limited Probing. Evolutionary Computation 12, 517–545 (2004)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Shude Zhou
    • 1
  • Zengqi Sun
    • 1
  1. 1.Department of Computer Science and TechnologyTsinghua UniversityBeijingChina

Personalised recommendations