Estimation of distribution algorithms on non-separable problems

References

• Abramowitz , M. and Stegun , I. A. 1970 . Handbook of Mathematical Functions , New York : Dover .
   Google Scholar
• Agapie , A. 2007 . Evolutionary Algorithms – Modeling and Convergence , Bucharest : Publishing House of the Romanian Academy .
   Google Scholar
• Bäck , T. 1992 . “ The interaction of mutation rate, selection and self-adaptation within a genetic algorithm ” . In Parallel Problem Solving from Nature 2 , 85 – 94 . Amsterdam : North-Holland .
   Google Scholar
• David , H. A. 1981 . Order Statistics , 2 , New York : Wiley .
   Google Scholar
• Droste , S. , Jansen , T. and Wegener , I. 2002 . On the analysis of the (1+1) evolutionary algorithm . Theor. Comput. Sci. , 276 : 51 – 81 .
   Web of Science ®Google Scholar
• Falconer , D. S. 1989 . Introduction to Quantitative Genetics , 3 , Harlow, , UK : Longman Scientific & Technical .
   Google Scholar
• Garnier , J. , Kallel , L. and Schoenauer , M. 1999 . Rigorous hitting times for binary mutations . Evol. Comput. , 7 ( 2 ) : 167 – 203 .
   Google Scholar
• He , J. and Yao , X. 2003 . Towards an analytic framework for analysisng the computation time of evolutionary algorithms . Artif. Intel. , 145 : 59 – 97 .
   Web of Science ®Google Scholar
• Johnson , N. L. , Kotz , S. and Balakrishnan , N. 1994 . Continuous Univariate Distributions , 2 , Vol. 1 , New York : Wiley .
   Google Scholar
• Keller , G. 1998 . Equilibrium States in Ergodic Theory , Cambridge : Cambridge University Press .
   Google Scholar
• Kern , S. , Müller , S. D. , Hansen , N. , Büche , D. , Ocenasek , J. and Koumoutsakos , P. 2004 . Learning probability distributions in continuous evolutionary algorithms – a comparative review . Nat. Comput. , 3 ( 1 ) : 77 – 112 .
   Google Scholar
• Larranaga , P. and Lozano , J. A. 2001 . Estimation of Distribution Algorithms: A New Tool for Evolutionary Computation , Norwell, MA : Kluwer .
   Google Scholar
• Malliavin , P. 1995 . Integration and Probability , 2 , New York : Springer Verlag .
   Google Scholar
• Mühlenbein , H. 1992 . “ How genetic algorithms really work I: mutation and hill-climbing ” . In Parallel Problem Solving from Nature 2 , 15 – 25 . Amsterdam : North-Holland .
   Google Scholar
• Mühlenbein , H. 1997 . The equation for the response to selection and its use for prediction . Evol. Comput. , 5 ( 3 ) : 303 – 346 .
   PubMedGoogle Scholar
• Mühlenbein , H. and Mahnig , T. 1999 . FDA – a scalable evolutionary algorithm for the optimization of additive decomposed functions . Evol. Comput. , 7 ( 4 ) : 353 – 376 .
   PubMedGoogle Scholar
• Mühlenbein , H. and Schlierkamp-Voosen , D. 1993 . Predictive models for the breeder genetic algorithm I: Continuous parameter optimization . Evol. Comput. , 1 ( 1 ) : 25 – 49 .
   Web of Science ®Google Scholar
• Prügel-Bennett , A. 2004 . Symmetry breaking in population-based optimization . IEEE Trans. Evol. Comput. , 8 ( 1 ) : 67 – 79 .
   Google Scholar
• Prügel-Bennett , A. and Shapiro , J. 1997 . The dynamics of a genetic algorithm for simple random Ising systems . Physica D , 104 : 75 – 114 .
   Google Scholar
• Rudolph , G. 1997 . Convergence Properties of Evolutionary Algorithms , Hamburg : Verlag Dr. Kovać .
   Google Scholar
• Vose , M. 1999 . The Simple Genetic Algorithm: Foundations and Theory , Cambridge : MIT Press .
   Google Scholar
• Zhang , Q. 2004 . On stability of fixed points of limit models of univariate marginal distribution algorithm and factorized distribution algorithm . IEEE Trans. Evol. Comput. , 8 ( 1 ) : 80 – 93 .
   Google Scholar
• Zhang , Q. and Mühlenbein , H. 2004 . On the convergence of a class of estimation of distribution algorithms . IEEE Trans. Evol. Comput. , 8 ( 2 ) : 127 – 136 .
   Web of Science ®Google Scholar