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

DOI10.1016/S0888-613X(02)00093-2zbMath1056.68135MaRDI QIDQ1399501

Thilo Mahnig, Heinz Mühlenbein

Publication date: 30 July 2003

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

zbMATH Keywords

stochastic processesGenetic algorithmsKullback-Leibler divergenceBoltzmann distributionlinkage equilibriumadaptive annealingadvanced meanfactorization of distributionsfield methods

Mathematics Subject Classification ID

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

Related Items (7)

Moving clusters within a memetic algorithm for graph partitioning ⋮ Estimation of distribution algorithms for the computation of innovation estimators of diffusion processes ⋮ Combining variable neighborhood search and estimation of distribution algorithms in the protein side chain placement problem ⋮ Convergence Theorems of Estimation of Distribution Algorithms ⋮ Scalability of using restricted Boltzmann machines for combinatorial optimization ⋮ A review of message passing algorithms in estimation of distribution algorithms ⋮ An overview of population-based algorithms for multi-objective optimisation

Cites Work

• Optimization by Simulated Annealing
• The dynamics of a genetic algorithm for simple random Ising systems
• A Bayesian method for the induction of probabilistic networks from data
• Estimating the dimension of a model
• Schemata, distributions and graphical models in evolutionary optimization
• Evolutionary computation and Wright's equation.
• An Efficient Heuristic Procedure for Partitioning Graphs
• On the Probability Theory of Linkage in Mendelian Heredity
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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