New Methods for Tunable, Random Landscapes
R.E. Smith; J.E. Smith The Intelligent Computer Systems Centre, The University of The West of England, Bristol, UK
Abstract
To understand the behaviour of search methods (including GAs), it is useful to understand the nature of the landscapes they search. What makes a landscape complex to search? Since there are an infinite number of landscapes, with an infinite number of characteristics, this is a difficult question. Therefore, it is interesting to consider parameterised landscape generators, if the parameters they employ have direct and identifiable effects on landscape complexity. A prototypical examination of this sort is the generator provided by NK landscapes. However, previous work by the authors ...
Get Foundations of Genetic Algorithms 2001 (FOGA 6) now with the O’Reilly learning platform.
O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.
