Towards Robust Memetic Algorithms

作者: Natalio Krasnogor

DOI: 10.1007/3-540-32363-5_9

关键词:

摘要: This chapter reports the results of Multimeme algorithms that employ adaptive helpers. A Algorithm resorts to a variety local search neighborhoods for its stage allowing more robust global search. Each neighborhood is explored by an helper allows non-improving moves render Memetic algorithm even deceptive optima. We will report on use single Traveling Salesman Problem (TSP) and helpers within TSP Protein Structure Prediction (PSP).

参考文章(18)
Armin Heinzl, David E. Goldberg, Franz Rothlauf, Bad codings and the utility of well-designed genetic algorithms genetic and evolutionary computation conference. pp. 355- 362 ,(2000)
N. Krasnogor, B. P. Blackburne, E. K. Burke, J. D. Hirst, Multimeme Algorithms for Protein Structure Prediction parallel problem solving from nature. pp. 769- 778 ,(2002) , 10.1007/3-540-45712-7_74
Thorsten Boseniuk, Werner Ebeling, Boltzmann-, Darwin-, and Haeckel-Strategies in Optimization Problems parallel problem solving from nature. pp. 430- 444 ,(1990) , 10.1007/BFB0029785
Kenneth Dean Boese, Models for iterative global optimization University of California at Los Angeles. ,(1996)
N. Krasnogor, J. Hirst, E. Burke, W. Hart, B. Carr, J. Smith, Alignment of protein structures with a memetic evolutionary algorithm genetic and evolutionary computation conference. pp. 1027- 1034 ,(2002)
Natalio Krasnogor, Jim Smith, Emergence of profitable search strategies based on a simple inheritance mechanism genetic and evolutionary computation conference. pp. 432- 439 ,(2001)
Natalio Krasnogor, David A. Pelta, Fuzzy Memes in Multimeme Algorithms: a Fuzzy-Evolutionary Hybrid Springer Berlin Heidelberg. pp. 49- 66 ,(2003) , 10.1007/978-3-540-36461-0_4
Natalio Krasnogor, Jim Smith, A Memetic Algorithm with self-adaptive local search: TSP as a case study genetic and evolutionary computation conference. pp. 987- 994 ,(2000)