Combining variable neighborhood search and estimation of distribution algorithms in the protein side chain placement problem

DOI10.1007/s10732-007-9049-8zbMath1211.90316OpenAlexW2105506484WikidataQ62637421 ScholiaQ62637421MaRDI QIDQ953320

Roberto Santana, Pedro Larrañaga, José A. Lozano

Publication date: 17 November 2008

Published in: Journal of Heuristics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10732-007-9049-8

zbMATH Keywords

VNSprotein foldingEDAsprotein side chain placementrotamersUMDA

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (15)

Unnamed Item ⋮ A review of distances for the Mallows and generalized Mallows estimation of distribution algorithms ⋮ EA/G-GA for single machine scheduling problems with earliness/tardiness costs ⋮ The Impact of Exact Probabilistic Learning Algorithms in EDAs Based on Bayesian Networks ⋮ Discretization vertex orders in distance geometry ⋮ MN-EDA and the Use of Clique-Based Factorisations in EDAs ⋮ Fast Fitness Improvements in Estimation of Distribution Algorithms Using Belief Propagation ⋮ A hybrid optimization algorithm based on chaotic differential evolution and estimation of distribution ⋮ The discretizable molecular distance geometry problem ⋮ Variable neighbourhood search: methods and applications ⋮ Quantum-inspired evolutionary algorithms: a survey and empirical study ⋮ HPBILc: A histogram-based EDA for continuous optimization ⋮ Molecular distance geometry methods: from continuous to discrete ⋮ Variable neighbourhood search: Methods and applications ⋮ Memory and Learning in Metaheuristics

Uses Software

• J-MEANS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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.
• Variable neighborhood search
• Bayesian network classifiers
• Evolutionary optimization and the estimation of search distributions with applications to graph bipartitioning.
• Mathematical modelling of UMDA\(_{c}\) algorithm with tournament selection. Behaviour on linear and quadratic functions
• Variable neighborhood tabu search and its application to the median cycle problem.
• The naive credal classifier
• Future paths for integer programming and links to artificial intelligence
• Heuristics for the phylogeny problem
• Fuzzy J-means: a new heuristic for fuzzy clustering
• TABU search methodology in global optimization
• Multiple Comparisons
• Variable Neighborhood Search
• PERMUTATION-BASED GENETIC, TABU, AND VARIABLE NEIGHBORHOOD SEARCH HEURISTICS FOR MULTIPROCESSOR SCHEDULING WITH COMMUNICATION DELAYS
• Variable neighborhood search: Principles and applications
• A survey of optimization by building and using probabilistic models

This page was built for publication: Combining variable neighborhood search and estimation of distribution algorithms in the protein side chain placement problem