Effects of discrete hill climbing on model building forestimation of distribution algorithms

Authors:
Wei-Ming Chen;Chu-Yu Hsu;Tian-Li Yu;Wei-Che Chien
Affiliations:
National Taiwan University, Taipei, Taiwan Roc;National Taiwan University, Taipei, Taiwan Roc;National Taiwan University, Taipei, Taiwan Roc;National Taiwan University, Taipei, Taiwan Roc
Venue:
Proceedings of the 15th annual conference on Genetic and evolutionary computation
Year:
2013

Citing 14
Cited 0

Adaptive global optimization with local search

Adaptive global optimization with local search
The Design of Innovation: Lessons from and for Competent Genetic Algorithms

The Design of Innovation: Lessons from and for Competent Genetic Algorithms
Finding Multimodal Solutions Using Restricted Tournament Selection

Proceedings of the 6th International Conference on Genetic Algorithms
A Mathematical Analysis of Tournament Selection

Proceedings of the 6th International Conference on Genetic Algorithms
Convergence Models of Genetic Algorithm Selection Schemes

PPSN III Proceedings of the International Conference on Evolutionary Computation. The Third Conference on Parallel Problem Solving from Nature: Parallel Problem Solving from Nature
Edge histogram based sampling with local search for solving permutation problems

International Journal of Hybrid Intelligent Systems
Population sizing for entropy-based model building in discrete estimation of distribution algorithms

Proceedings of the 9th annual conference on Genetic and evolutionary computation
Overcoming hierarchical difficulty by hill-climbing the building block structure

Proceedings of the 9th annual conference on Genetic and evolutionary computation
Let's get ready to rumble redux: crossover versus mutation head to head on exponentially scaled problems

Proceedings of the 9th annual conference on Genetic and evolutionary computation
Effects of a deterministic hill climber on hBOA

Proceedings of the 11th Annual conference on Genetic and evolutionary computation
Performance of evolutionary algorithms on NK landscapes with nearest neighbor interactions and tunable overlap

Proceedings of the 11th Annual conference on Genetic and evolutionary computation
Loopy Substructural Local Search for the Bayesian Optimization Algorithm

SLS '09 Proceedings of the Second International Workshop on Engineering Stochastic Local Search Algorithms. Designing, Implementing and Analyzing Effective Heuristics
Hierarchical BOA solves ising spin glasses and MAXSAT

GECCO'03 Proceedings of the 2003 international conference on Genetic and evolutionary computation: PartII
The roles of local search, model building and optimal mixing in evolutionary algorithms from a bbo perspective

Proceedings of the 13th annual conference companion on Genetic and evolutionary computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

Hybridization of global and local searches is a well-known technique for optimization algorithms. Hill climbing is one of the local search methods. On estimation of distribution algorithms (EDAs), hill climbing strengthens the signals of dependencies on correlated variables and improves the quality of model building, which reduces the required population size and convergence time. However, hill climbing also consumes extra computational time. In this paper, analytical models are developed to investigate the effects of combining two different hill climbers with the extended compact genetic algorithm and the dependency structure matrix genetic algorithm. By using the one-max problem and the 5-bit non-overlapping trap problem as the test problems, the performances of different hill climbers are compared. Both analytical models and experiments reveal that the greedy hill climber reduces the number of function evaluations for EDAs to find the global optimum.