Effects of a deterministic hill climber on hBOA

Hybridization of global and local search algorithms is a well-established technique for enhancing the efficiency of search algorithms. Hybridizing estimation of distribution algorithms (EDAs) has been repeatedly shown to produce better performance than either the global or local search algorithm alone. The hierarchical Bayesian optimization algorithm (hBOA) is an advanced EDA which has previously been shown to benefit from hybridization with a local searcher. This paper examines the effects of combining hBOA with a deterministic hill climber (DHC). Experiments reveal that allowing DHC to find the local optima makes model building and decision making much easier for hBOA. This reduces the minimum population size required to find the global optimum, which substantially improves overall performance.

[1]  Richard M. Karp,et al.  Reducibility Among Combinatorial Problems , 1972, 50 Years of Integer Programming.

[2]  K. Binder,et al.  Spin glasses: Experimental facts, theoretical concepts, and open questions , 1986 .

[3]  David H. Ackley,et al.  An empirical study of bit vector function optimization , 1987 .

[4]  M. Mézard,et al.  Spin Glass Theory and Beyond , 1987 .

[5]  Pablo Moscato,et al.  On Evolution, Search, Optimization, Genetic Algorithms and Martial Arts : Towards Memetic Algorithms , 1989 .

[6]  Lawrence. Davis,et al.  Handbook Of Genetic Algorithms , 1990 .

[7]  David E. Goldberg,et al.  Genetic Algorithms and the Variance of Fitness , 1991, Complex Syst..

[8]  Dirk Thierens,et al.  Mixing in Genetic Algorithms , 1993, ICGA.

[9]  W. Hart.  Adaptive global optimization with local search , 1994 .

[10]  Georges R. Harik,et al.  Finding Multimodal Solutions Using Restricted Tournament Selection , 1995, ICGA.

[11]  L. Darrell Whitley,et al.  Genetic Algorithm Behavior in the MAXSAT Domain , 1998, PPSN.

[12]  David E. Goldberg,et al.  Optimizing Global-Local Search Hybrids , 1999, GECCO.

[13]  David E. Goldberg,et al.  The Gambler's Ruin Problem, Genetic Algorithms, and the Sizing of Populations , 1999, Evolutionary Computation.

[14]  Heinz Mühlenbein,et al.  Schemata, Distributions and Graphical Models in Evolutionary Optimization , 1999, J. Heuristics.

[15]  Dirk Thierens,et al.  Scalability Problems of Simple Genetic Algorithms , 1999, Evolutionary Computation.

[16]  Thomas Stützle,et al.  SATLIB: An Online Resource for Research on SAT , 2000 .

[17]  David E. Goldberg,et al.  Bayesian Optimization Algorithm, Population Sizing, and Time to Convergence , 2000, GECCO.

[18]  D. Goldberg,et al.  Escaping hierarchical traps with competent genetic algorithms , 2001 .

[19]  D. Goldberg,et al.  Verification and extension of the theory of global-local hybrids , 2001 .

[20]  Kumara Sastry,et al.  Efficient Atomic Cluster Optimization Using A Hybrid Extended Compact Genetic Algorithm With Seeded , 2001 .

[21]  David E. Goldberg,et al.  Bayesian Optimization Algorithm: From Single Level to Hierarchy , 2002 .

[22]  David E. Goldberg,et al.  The Design of Innovation: Lessons from and for Competent Genetic Algorithms , 2002 .

[23]  Heinz Mühlenbein,et al.  Evolutionary optimization and the estimation of search distributions with applications to graph bipartitioning , 2002, Int. J. Approx. Reason..

[24]  Martin Pelikan,et al.  Hierarchical Bayesian optimization algorithm: toward a new generation of evolutionary algorithms , 2010, SICE 2003 Annual Conference (IEEE Cat. No.03TH8734).

[25]  David E. Goldberg,et al.  Hierarchical BOA Solves Ising Spin Glasses and MAXSAT , 2003, GECCO.

[26]  M. Troyer,et al.  Performance limitations of flat-histogram methods. , 2003, Physical review letters.

[27]  J. Ford,et al.  Hybrid estimation of distribution algorithm for global optimization , 2004 .

[28]  Franz Rothlauf,et al.  Evaluation-Relaxation Schemes for Genetic and Evolutionary Algorithms , 2004 .

[29]  Kalyanmoy Deb,et al.  Sufficient conditions for deceptive and easy binary functions , 1994, Annals of Mathematics and Artificial Intelligence.

[30]  F. Guerra.  Spin Glasses , 2005, cond-mat/0507581.

[31]  Martin V. Butz,et al.  Substructural Neighborhoods for Local Search in the Bayesian Optimization Algorithm , 2006, PPSN.

[32]  Martin Pelikan,et al.  Searching for Ground States of Ising Spin Glasses with Hierarchical BOA and Cluster Exact Approximation , 2006, Scalable Optimization via Probabilistic Modeling.

[33]  Martin Pelikan,et al.  Edge histogram based sampling with local search for solving permutation problems , 2006, Int. J. Hybrid Intell. Syst..

[34]  Qingfu Zhang,et al.  Estimation of Distribution Algorithm with 2-opt Local Search for the Quadratic Assignment Problem , 2006, Towards a New Evolutionary Computation.

[35]  Martin Pelikan,et al.  Analyzing probabilistic models in hierarchical BOA on traps and spin glasses , 2007, GECCO '07.

[36]  Uwe Aickelin,et al.  An estimation of distribution algorithm with intelligent local search for rule-based nurse rostering , 2007, J. Oper. Res. Soc..

[37]  David E. Goldberg,et al.  Population sizing for entropy-based model building in discrete estimation of distribution algorithms , 2007, GECCO '07.

[38]  Martin Pelikan,et al.  Finding ground states of Sherrington-Kirkpatrick spin glasses with hierarchical boa and genetic algorithms , 2008, GECCO '08.