|Appears in Collections:||Computing Science and Mathematics Book Chapters and Sections|
|Title:||The cooperative royal road: Avoiding Hitchhiking|
|Citation:||Ochoa G, Lutton E & Burke E (2008) The cooperative royal road: Avoiding Hitchhiking. In: Monmarche N, Talbi E.-G, Collet P, Schoenauer M, Lutton E (ed.). Artificial Evolution: 8th International Conference, Evolution Artificielle, EA 2007, Tours, France, October 29-31, 2007, Revised Selected Papers. Lecture Notes in Computer Science, 4926, Berlin Heidelberg: Springer, pp. 184-195.|
|Series/Report no.:||Lecture Notes in Computer Science, 4926|
|Abstract:||We propose using the so called Royal Road functions as test functions for cooperative co-evolutionary algorithms (CCEAs). The Royal Road functions were created in the early 90's with the aim of demonstrating the superiority of genetic algorithms over local search methods. Unexpectedly, the opposite was found to be true. The research deepened our understanding of the phenomenon of hitchhiking where unfavorable alleles may become established in the population following an early association with an instance of a highly fit schema. Here, we take advantage of the modular and hierarchical structure of the Royal Road functions to adapt them to a co-evolutionary setting. Using a multiple population approach, we show that a CCEA easily outperforms a standard genetic algorithm on the Royal Road functions, by naturally overcoming the hitchhiking effect. Moreover, we found that the optimal number of sub-populations for the CCEA is not the same as the number of components that the function can be linearly separated into, and propose an explanation for this behavior. We argue that this class of functions may serve in foundational studies of cooperative co-evolution.|
|Rights:||The publisher does not allow this work to be made publicly available in this Repository. Please use the Request a Copy feature at the foot of the Repository record to request a copy directly from the author. You can only request a copy if you wish to use this work for your own research or private study.|
|Type:||Part of book or chapter of book|
|Affiliation:||Computing Science - CSM Dept|
INRIA Rocquencourt, France
Computing Science and Mathematics
|Cooperative Royal Road.pdf||445.11 kB||Adobe PDF||Under Embargo until 31/12/2999 Request a copy|
Note: If any of the files in this item are currently embargoed, you can request a copy directly from the author by clicking the padlock icon above. However, this facility is dependant on the depositor still being contactable at their original email address.
This item is protected by original copyright
Items in the Repository are protected by copyright, with all rights reserved, unless otherwise indicated.
If you believe that any material held in STORRE infringes copyright, please contact firstname.lastname@example.org providing details and we will remove the Work from public display in STORRE and investigate your claim.