Summary
This chapter reports the results of Multimeme algorithms that employ adaptive helpers. A Multimeme Algorithm resorts to a variety of local search neighborhoods for its local search stage allowing for a more robust global search. Each neighborhood is explored by an adaptive helper that allows non-improving moves that render the Memetic algorithm even more robust to deceptive local optima. We will report results on the use of a single adaptive helper Memetic algorithm for the Traveling Salesman Problem (TSP) and on adaptive helpers within a Multimeme algorithm for the TSP and Protein Structure Prediction Problem (PSP).
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
E. Aarts, F. de Bont, E. Habers, and P. van Laarhoven. Parallel implementations of the statistical cooling algorithm. Integration, the VLSI Journal, 4:209–238, 1986.
O. Becker and M. Karplus. The topology of multidimensional potential energy surfaces: Theory and application to peptide structure and kinetics. J. Chemical Physics, 106(4):1495–1517, 97.
K. Boese. Models For Iterative Global Optimization. Ph.D. Thesis, UCLA Computer Science Department, 1996.
T. Boseniuk and W. Ebeling. Boltzmann, darwin and haeckel strategies in optimization problems. In H. Schwefel and R. Manner, editors, Parallel Problem Solving From Nature, pages 430–444. Springer-Verlag, 1991.
B. Carr, W. Hart, N. Krasnogor, E. Burke, J. Hirst, and J. Smith. Alignment of protein structures with a memetic evolutionary algorithm. In GECCO-2002: Proceedings of the Genetic and Evolutionary Computation Conference. Morgan Kaufman, 2002.
P. Coveney and R. Highfield. Frontiers of Complexity, the search for order in a chaotic world. faber and faber (ff), 1995.
A. Kolinski, M. Betancourt, D. Kihara, P. Rotkiewicz, and J. Skolnick. Generalized comparative modeling (genecomp): A combination of sequence comparison, threading, and lattice modeling for protein structure prediction and refinement. PROTEINS: Structure, Function, and Genetics, 44:133–149, 2001.
N. Krasnogor. Two dimensional triangular lattice instances for the hp model. In http://dirac.chem.nott.ac.uk/natk/Public/HP-PDB/2dtrihp.html.
N. Krasnogor. Co-evolution of genes and memes in memetic algorithms. In A. Wu, editor, Proceedings of the 1999 Genetic And Evolutionary Computation Conference Workshop Program, 1999.
N. Krasnogor. http://www.cs.nott.ac.uk/~nxk/papers.html. In Studies on the Theory and Design Space of Memetic Algorithms. Ph.D. Thesis, University of the West of England, Bristol, United Kingdom., 2002.
N. Krasnogor, B. Blackburne, E. Burke, and J. Hirst. Multimeme algorithms for protein structure prediction. In Proceedings of the Parallel Problem Solving from Nature VII. Lecture notes in computer science, 2002.
N. Krasnogor and D. Pelta. Fuzzy memes in multimeme algorithms: a fuzzy-evolutionary hybrid. In J. Verdegay, editor, Book chapter in “Fuzzy Sets based Heuristics for Optimization”. Physica Verlag, 2002.
N. Krasnogor and J. Smith. Memetic algorithms: Syntactic model and taxonomy. submitted to The Journal of Heuristics. Available from the authors.
N. Krasnogor and J. Smith. A memetic algorithm with self-adaptive local search: Tsp as a case study. In Proceedings of the 2000 Genetic and Evolutionary Computation Conference. Morgan Kaufmann, 2000.
N. Krasnogor and J. Smith. Emergence of profitable search strategies based on a simple inheritance mechanism. In Proceedings of the 2001 Genetic and Evolutionary Computation Conference. Morgan Kaufmann, 2001.
N. Krasnogor. Self-Generating Metaheuristics in Bioinformatics: The Proteins Structure Comparison Case Journal of Genetic Programming and Evolvable Machines (to appear, May 2004), 5:2, 2004
S. Lee and K. Lee. Asynchronus communication of multiple markov chains in parallel simulated annealing. Proceedings of International Conference on Parallel Processing, 3:169–176, 1992.
S. Mahfoud and D. Goldberg. Parallel recombinative simulated annealing. Parallel Computing, 21:1–28, 1995.
P. Moscato. http://www.densis.fee.unicamp.br/~moscato/memetic_home.html.
H. Nakamura, T. Sasaki, and M. Sasai. Strange kinetics and complex energy landscapes in a lattice model of protein folding. Chemical Physics Letters, 347:247–254, 2001.
G. Reinelt. Tsplib (http://www.iwr.uni-heidelberg.de/iwr/comopt/soft/tsplib95/tsplib.html). In mirror site: gopher://softlib.rice.edu/ll/softlib/tsplib.
F. Rothlauf, D. Goldberg, and A. Heinz. Bad codings and the utility of well-designed genetic algorithms. In Proceedings of the Genetic and Evolutionary Computation Conference. Morgan-Kaufmann, 2000.
Y. Xia, E. Huang, M. Levitt, and R. Samudrala. Ab initio construction of protein tertiary structures using a hierarchical approach. Journal of Molecular Biology, 300:171–185, 2000.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Krasnogor, N. (2005). Towards Robust Memetic Algorithms. In: Hart, W.E., Smith, J.E., Krasnogor, N. (eds) Recent Advances in Memetic Algorithms. Studies in Fuzziness and Soft Computing, vol 166. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-32363-5_9
Download citation
DOI: https://doi.org/10.1007/3-540-32363-5_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22904-9
Online ISBN: 978-3-540-32363-1
eBook Packages: EngineeringEngineering (R0)