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

Abstract The aim of this work is to introduce several proposals for combining two metaheuristics: variable neighborhood search (VNS) and estimation of distribution algorithms (EDAs). Although each of these metaheuristics has been previously hybridized in several ways, this paper constitutes the first attempt to combine both optimization methods. The different ways of combining VNS and EDAs will be classified into three groups. In the first group, we will consider combinations where the philosophy underlying VNS is embedded in EDAs. Considering different neighborhood spaces (points, populations or probability distributions), we will obtain instantiations for the approaches in this group. The second group of algorithms is obtained when probabilistic models (or any other machine learning paradigm) are used in order to exploit the good and bad shakes of the randomly generated solutions in a reduced variable neighborhood search. The last group of algorithms contains the results of alternating VNS and EDAs. An application of the first approach is presented in the protein side chain placement problem. The results obtained show the superiority of the hybrid algorithm in comparison with EDAs and VNS.

[1]  Pierre Hansen,et al.  Improvement and Comparison of Heuristics for Solving the Uncapacitated Multisource Weber Problem , 2000, Oper. Res..

[2]  Pedro Larrañaga,et al.  Estimation of Distribution Algorithms , 2002, Genetic Algorithms and Evolutionary Computation.

[3]  H. Mühlenbein,et al.  From Recombination of Genes to the Estimation of Distributions I. Binary Parameters , 1996, PPSN.

[4]  Pedro Larrañaga,et al.  Solving the Traveling Salesman Problem with EDAs , 2002, Estimation of Distribution Algorithms.

[5]  María S. Pérez-Hernández,et al.  GA-EDA: A New Hybrid Cooperative Search Evolutionary Algorithm , 2006, Towards a New Evolutionary Computation.

[6]  Chen Yanover,et al.  Approximate Inference and Side-chain Prediction , 2007 .

[7]  Vasant Honavar,et al.  Evolutionary Synthesis of Bayesian Networks for Optimization , 2001 .

[8]  D. Nilsson,et al.  An efficient algorithm for finding the M most probable configurationsin probabilistic expert systems , 1998, Stat. Comput..

[9]  P. Hansen,et al.  Parallel Variable Neighborhood Search , 2004 .

[10]  Pierre Hansen,et al.  A Tutorial on Variable Neighborhood Search , 2003 .

[11]  Roland L. Dunbrack,et al.  Bayesian statistical analysis of protein side‐chain rotamer preferences , 1997, Protein science : a publication of the Protein Society.

[12]  David J. Spiegelhalter,et al.  Local computations with probabilities on graphical structures and their application to expert systems , 1990 .

[13]  Panos M. Pardalos,et al.  Handbook of applied optimization , 2002 .

[14]  Christopher A. Voigt,et al.  Trading accuracy for speed: A quantitative comparison of search algorithms in protein sequence design. , 2000, Journal of molecular biology.

[15]  B. Efron.  The jackknife, the bootstrap, and other resampling plans , 1987 .

[16]  Pedro Larrañaga,et al.  Parallel Estimation of Distribution Algorithms , 2002, Estimation of Distribution Algorithms.

[17]  David E. Goldberg,et al.  Hierarchical Bayesian Optimization Algorithm , 2006, Scalable Optimization via Probabilistic Modeling.

[18]  J. Hsu.  Multiple Comparisons: Theory and Methods , 1996 .

[19]  Yair Weiss,et al.  Approximate Inference and Protein-Folding , 2002, NIPS.

[20]  A. P. Dawid,et al.  Applications of a general propagation algorithm for probabilistic expert systems , 1992 .

[21]  Heinz Mühlenbein,et al.  Evolutionary optimization and the estimation of search distributions with applications to graph bipartitioning , 2002, Int. J. Approx. Reason..

[22]  S. Subbiah,et al.  Prediction of protein side-chain conformation by packing optimization. , 1991, Journal of molecular biology.

[23]  David E. Goldberg,et al.  A Survey of Optimization by Building and Using Probabilistic Models , 2002, Comput. Optim. Appl..

[24]  Marc De Maeyer,et al.  The Dead-End Elimination Theorem: , 2000 .

[25]  Inmaculada Rodríguez Martín,et al.  Variable neighborhood tabu search and its application to the median cycle problem , 2003, Eur. J. Oper. Res..

[26]  Alexander Mendiburu,et al.  Parallel implementation of EDAs based on probabilistic graphical models , 2005, IEEE Transactions on Evolutionary Computation.

[27]  É. Taillard,et al.  Improvements and Comparison of Heuristics for solving the Multisource Weber Problem , 1997 .

[28]  Pedro Larrañaga,et al.  Globally Multimodal Problem Optimization Via an Estimation of Distribution Algorithm Based on Unsupervised Learning of Bayesian Networks , 2005, Evolutionary Computation.

[29]  Pierre Hansen,et al.  Variable Neighborhood Search , 2018, Handbook of Heuristics.

[30]  Celso C. Ribeiro,et al.  Heuristics for the Phylogeny Problem , 2002, J. Heuristics.

[31]  J. A. Lozano,et al.  Estimation of Distribution Algorithms: A New Tool for Evolutionary Computation , 2001 .

[32]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

[33]  Goldberg,et al.  Genetic algorithms , 1993, Robust Control Systems with Genetic Algorithms.

[34]  Fred W. Glover,et al.  Future paths for integer programming and links to artificial intelligence , 1986, Comput. Oper. Res..

[35]  Nir Friedman,et al.  Bayesian Network Classifiers , 1997, Machine Learning.

[36]  Hans-Paul Schwefel,et al.  Parallel Problem Solving from Nature — PPSN IV , 1996, Lecture Notes in Computer Science.

[37]  Qingfu Zhang,et al.  A model-based evolutionary algorithm for bi-objective optimization , 2005, 2005 IEEE Congress on Evolutionary Computation.

[38]  Pierre Hansen,et al.  Variable neighborhood search: Principles and applications , 1998, Eur. J. Oper. Res..

[39]  Pedro Larrañaga,et al.  Mathematical modelling of UMDAc algorithm with tournament selection. Behaviour on linear and quadratic functions , 2002, Int. J. Approx. Reason..

[40]  Pedro Larrañaga,et al.  Mathematical Modeling of Discrete Estimation of Distribution Algorithms , 2002, Estimation of Distribution Algorithms.

[41]  Judea Pearl,et al.  Probabilistic reasoning in intelligent systems - networks of plausible inference , 1991, Morgan Kaufmann series in representation and reasoning.

[42]  Marco Zaffalon.  The naive credal classifier , 2002 .

[43]  M. Cangalovic,et al.  TABU search methodology in global optimization , 1999 .

[44]  Nenad Mladenovic,et al.  Local and variable neighborhood search for the k-cardinality subgraph problem , 2008, J. Heuristics.

[45]  Lothar Thiele,et al.  A Comparison of Selection Schemes Used in Evolutionary Algorithms , 1996, Evolutionary Computation.

[46]  Y. Weiss,et al.  Finding the M Most Probable Configurations using Loopy Belief Propagation , 2003, NIPS 2003.

[47]  TATJANA DAVIDOVIĆ,et al.  Permutation-Based Genetic, Tabu, and Variable Neighborhood Search Heuristics for Multiprocessor Scheduling with Communication delays , 2004, Asia Pac. J. Oper. Res..

[48]  Martin Pelikan,et al.  Hierarchical Bayesian optimization algorithm: toward a new generation of evolutionary algorithms , 2010, SICE 2003 Annual Conference (IEEE Cat. No.03TH8734).

[49]  Pierre Hansen,et al.  Fuzzy J-Means: a new heuristic for fuzzy clustering , 2001, Pattern Recognit..

[50]  F. Glover,et al.  Handbook of Metaheuristics , 2019, International Series in Operations Research & Management Science.

[51]  Robin Hons,et al.  Estimation of Distribution Algorithms and Minimum Relative Entropy , 2005 .

[52]  J. A. Lozano,et al.  Towards a New Evolutionary Computation: Advances on Estimation of Distribution Algorithms (Studies in Fuzziness and Soft Computing) , 2006 .

[53]  Pedro Larrañaga,et al.  Feature selection in Bayesian classifiers for the prognosis of survival of cirrhotic patients treated with TIPS , 2005, J. Biomed. Informatics.

[54]  Roland L. Dunbrack.  Rotamer libraries in the 21st century. , 2002, Current opinion in structural biology.

[55]  D. Goldberg,et al.  BOA: the Bayesian optimization algorithm , 1999 .