Registrar: a complete-memory operator to enhance performance of genetic algorithms
We examine the concept of storing all evaluated chromosomes and directly reuse them in Genetic Algorithms (GAs). This is achieved by a fully encapsulated operator, called Registrar, which is effortlessly placed between the GA and the objective function. The Registrar does not approximate the objective function. Instead, it replaces the chromosomes requested by the GA with similar ones taken from the registry, bypassing the function evaluation. Unlike other methods that use external memory to increase genetic diversity, our simple implementation encourages revisits in order to avoid evaluations in an aggressive manner. Significant increase in performance is observed which is present even at the early stages of evolution, in accordance with the Birthday Problem of probability theory. Implementation with Standard GA shows great promise, while the encapsulation of the code facilitates implementation with other Evolutionary Algorithms. Copyright Springer Science+Business Media, LLC. 2012
Volume (Year): 54 (2012)
Issue (Month): 3 (November)
|Contact details of provider:|| Web page: http://www.springer.com|
|Order Information:||Web: http://www.springer.com/business/operations+research/journal/10898|
When requesting a correction, please mention this item's handle: RePEc:spr:jglopt:v:54:y:2012:i:3:p:449-483. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Sonal Shukla)or (Rebekah McClure)
If references are entirely missing, you can add them using this form.