A survey of optimization by building and using probabilistic models

Computational Optimization and Applications

Volumn 21, Issue 1, 2002, Pages 5-20

  Pelikan, Martin ^a   Goldberg, David E ^a   Lobo, Fernando G ^a  

^a University of Illinois at Urbana Champaign   (United States)

Author keywords

Decomposable problems; Genetic algorithms; Genetic and evolutionary computation; Model building; Stochastic optimization

Indexed keywords

COMPUTATIONAL COMPLEXITY; GENETIC ALGORITHMS; MATHEMATICAL MODELS; POPULATION STATISTICS; PROBABILITY DISTRIBUTIONS; RANDOM PROCESSES;

PROBABILISTIC MODELS; PROBABILISTIC SEARCH ALGORITHMS; PROBLEM DECOMPOSITION; STOCHASTIC OPTIMIZATION;

OPTIMIZATION;

EID: 0036180213     PISSN: 09266003     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1013500812258     Document Type: Article

References (46)

1. Population-based incremental learning: A method for integrating genetic search based function optimization and competitive learning
2. Using optimal dependency-trees for combinatorial optimization: Learning the structure of the search space
3. Continuous iterated density estimation evolutionary algorithms within the IDEA framework
4. Linkage information processing in distribution estimation algorithms
5. MIMIC: Finding optima by estimating probability densities
6. Simulated binary crossover for continuous search space
7. Optimum branching
8. Real-coded genetic algorithms and interval-schemata
9. Global optimization using Bayesian networks
10. Real-valued evolutionary optimization using a flexible probability density estimator
11. Genetic algorithms in search, optimization, and machine learning
12. Genetic and evolutionary algorithms in the real world
13. On the use of a directed acyclic graph to represent a population of computer programs
14. Linkage learning via probabilistic modeling in the ECGA
15. The gambler's ruin problem, genetic algorithms, and the sizing of populations
16. The compact genetic algorithm
17. Learning Bayesian networks: The combination of knowledge and statistical data
18. OMEGA-ordering messy GA: Solving permutation problems with the fast messy genetic algorithm and random keys
19. On information and sufficiency
20. Hill climbing with learning (an abstraction of genetic algorithm)
21. The equation for response to selection and its use for prediction
22. Convergence theory and applications of the factorized distribution algorithm
23. FDA-a scalable evolutionary algorithm for the optimization of additively decomposed functions
24. Schemata, distributions and graphical models in evolutionary optimization
25. From recombination of genes to the estimation of distributions I. Binary parameters
26. A real-coded genetic algorithm for function optimization using unimodal normal distribution crossovers
27. Linkage problem, distribution estimation, and Bayesian networks
28. BOA: The Bayesian optimization algorithms
29. Bayesian optimization algorithm, population sizing, and time to convergence
30. Hierarchical problem solving by the Bayesian optimization algorithms
31. Linkage problem, distribution estimation, and Bayesian networks
32. The bivariate marginal distribution algorithm
33. Bad codings and the utility of well-designed genetic algorithms
34. Stochastic hill climbing with learning by vectors of normal distributions
35. Probabilistic incremental program evolution: Stochastic search through program space
36. Experimental study: Hypergraph partitioning based on the simple and advanced algorithms BMDA and BOA
37. Extending population-based incremental learning to continuous search spaces
38. Telephone network traffic overloading diagnosis and evolutionary computation techniques
39. Thinking backwards for knowledge acquisition
40. Analysis and design of genetic algorithm
41. Fuzzy recombination for the breeder genetic algorithm