Previous work investigating the performance of genetic algorithms (GAs) has attempted to develop a set of fitness landscapes, called "Royal Roads" functions, which should be ideally suited for search with GAs. Surprisingly, many studies have shown that genetic algorithms actually perform worse than random mutation hill-climbing on these landscapes, and several different explanations have been offered to account for these observations. Using a detailed stochastic model of genetic search on R1, we attempt to determine a lower bound for the required number of function evaluations, and then use it to evaluate the performance of an actual genetic algorithm on R1. © Springer-Verlag Berlin Heidelberg 2004.
CITATION STYLE
Howard, B., & Sheppard, J. (2004). The royal road not taken: A re-examination of the reasons for GA failure on R1. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3102, 1208–1219. https://doi.org/10.1007/978-3-540-24854-5_117
Mendeley helps you to discover research relevant for your work.