Shaky ladders, hyperplane-defined functions and genetic algorithms: Systematic controlled observation in dynamic environments

6Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Though recently there has been interest in examining genetic algorithms (GAs) in dynamic environments, work still needs to be done in investigating the fundamental behavior of these algorithms in changing environments. When researching the GA in static environments, it has been useful to use test suites of functions that are designed for the GA so that the performance can be observed under systematic controlled conditions. One example of these suites is the hyperplane-defined functions (hdfs) designed by Holland. We have created an extension of these functions, specifically designed for dynamic environments, which we call the shaky ladder functions. In this paper, we examine the qualities of this suite that facilitate its use in examining the GA in dynamic environments, describe the construction of these functions and present some preliminary results of a GA operating on these functions. © Springer-Verlag Berlin Heidelberg 2005.

Cite

CITATION STYLE

APA

Rand, W., & Riolo, R. (2005). Shaky ladders, hyperplane-defined functions and genetic algorithms: Systematic controlled observation in dynamic environments. In Lecture Notes in Computer Science (Vol. 3449, pp. 600–609). Springer Verlag. https://doi.org/10.1007/978-3-540-32003-6_63

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free