Evolutionary optimization and the estimation of search distributions with applications to graph bipartitioning.

DOI10.1016/S0888-613X(02)00093-2MaRDI QIDQ1399501zbMATH OpenFDO

Authors H. Mühlenbein, Thilo Mahnig

Publication date 30 July 2003

Published in International Journal of Approximate Reasoning (Search for Journal in Brave)

zbMATH Keywords

Kullback-Leibler divergencestochastic processesBoltzmann distributionGenetic algorithmslinkage equilibriumadaptive annealingadvanced meanfactorization of distributionsfield methods

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Approximation methods and heuristics in mathematical programming (90C59) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Mathematical analysis of evolutionary algorithms
• Schemata, distributions and graphical models in evolutionary optimization
• scientific article; zbMATH DE number 1664953
• The factorized distribution algorithm and the minimum relative entropy principle
• Using Maximum Entropy and Generalized Belief Propagation in Estimation of Distribution Algorithms

Cites work

• scientific article; zbMATH DE number 1664953 (Why is no real title available?)
• scientific article; zbMATH DE number 1702339 (Why is no real title available?)
• scientific article; zbMATH DE number 3497315 (Why is no real title available?)
• scientific article; zbMATH DE number 1222283 (Why is no real title available?)
• scientific article; zbMATH DE number 1134987 (Why is no real title available?)
• scientific article; zbMATH DE number 1754722 (Why is no real title available?)
• scientific article; zbMATH DE number 194544 (Why is no real title available?)
• scientific article; zbMATH DE number 3806623 (Why is no real title available?)
• A Bayesian method for the induction of probabilistic networks from data
• Advanced mean field methods. Theory and practice
• An Efficient Heuristic Procedure for Partitioning Graphs
• Estimating the dimension of a model
• Evolutionary computation and Wright's equation.
• On the Probability Theory of Linkage in Mendelian Heredity
• Optimization by simulated annealing
• Schemata, distributions and graphical models in evolutionary optimization
• The dynamics of a genetic algorithm for simple random Ising systems

Cited in

(16)

• Schemata, distributions and graphical models in evolutionary optimization
• scientific article; zbMATH DE number 1754526 (Why is no real title available?)
• A review of message passing algorithms in estimation of distribution algorithms
• Combining variable neighborhood search and estimation of distribution algorithms in the protein side chain placement problem
• Single- and multi-objective evolutionary algorithms for graph bisectioning
• scientific article; zbMATH DE number 1664953 (Why is no real title available?)
• Scalability of using restricted Boltzmann machines for combinatorial optimization
• Estimation of distribution algorithms for the computation of innovation estimators of diffusion processes
• On the use of polytrees in evolutionary optimization
• An overview of population-based algorithms for multi-objective optimisation
• Distributed Evolutionary Graph Partitioning
• Mathematical analysis of evolutionary algorithms
• Artificial Evolution
• scientific article; zbMATH DE number 1844617 (Why is no real title available?)
• Convergence theorems of estimation of distribution algorithms
• Moving clusters within a memetic algorithm for graph partitioning

This page was built for publication: Evolutionary optimization and the estimation of search distributions with applications to graph bipartitioning.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1399501)