An evolution strategy and genetic algorithm hybrid: An initial implementation and first results

Bull, Lawrence; Fogarty, Terence C.

Abstract

Evolution Strategies (ESs)[15] and Genetic Algorithms (GAs)[13] have both been used to optimise functions, using the natural process of evolution as inspiration for their search mechanisms. The ES uses gene mutation as it’s main search operator whilst the GA mainly relies upon gene recombination. This paper describes how the addition of a second mutation operator, used in conjunction with the mutation and crossover operators of the normal GA, can improve the GA’s performance on rugged fitness landscapes. We then show that by adding Lamarckian replacement the GA’s performance on smooth landscapes can also be improved, further improving it’s performance on rugged landscapes. We explain how the extra operators allow the GA to gain and exploit local information about the fitness landscape, and how this local random hill climbing can be seen to combine the search characteristics of the ES with those of the GA.

• Presentation Conference Type: Conference Paper (Published)
• Conference Name: AISB EC 1994: Evolutionary Computing
• Start Date: Apr 11, 1994
• End Date: Apr 13, 1994
• Publication Date: Jan 1, 1994
• Pages: 95-102
• Series Title: Lecture Notes in Computer Science
• Series Number: 865
• Series ISSN: 0302-9743
• Book Title: AISB EC 1994: Evolutionary Computing
• ISBN: 9783540584834
• DOI: https://doi.org/10.1007/3-540-58483-8_8
• Keywords: computation by abstract devices, algorithm analysis and problem complexity, artificial intelligence, pattern recognition, computer applications in life sciences, mathematical biology
• Public URL: https://uwe-repository.worktribe.com/output/1108672
• Publisher URL: http://dx.doi.org/10.1007/3-540-58483-8_8