Comprehensive characterization of the behaviors of estimation of distribution algorithms
DOI10.1016/j.tcs.2015.04.015zbMath1329.68237OpenAlexW2020936588MaRDI QIDQ496034
Alexander Mendiburu, Carlos Echegoyen, Roberto Santana, José A. Lozano
Publication date: 16 September 2015
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2015.04.015
heuristic optimizationequivalence classesfactorizationsmachine learningestimation of distribution algorithmsneighborhood systems
Learning and adaptive systems in artificial intelligence (68T05) Approximation methods and heuristics in mathematical programming (90C59) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Markov networks in evolutionary computation
- Ranking-based black-box complexity
- Model-based search for combinatorial optimization: A critical survey
- Hierarchical Bayesian optimization algorithm. Toward a new generation of evolutionary algorithms. With a foreword by David E. Goldberg
- Towards a new evolutionary computation. Advances on estimation of distribution algorithms.
- Mathematical modelling of UMDA\(_{c}\) algorithm with tournament selection. Behaviour on linear and quadratic functions
- Schemata, distributions and graphical models in evolutionary optimization
- Introduction to evolutionary computing
This page was built for publication: Comprehensive characterization of the behaviors of estimation of distribution algorithms