e-Science logo Nesc logo
 
 
About NeSC
e-Science Institute
e-Science Hub
TOE
Contacts
e-Science Events
Resources
Newsroom
Presentations & Lectures
Technical Papers
Global Grid Links
Projects
UK e-Science Centres
UK e-Science Teams
Career Opportunities
Bibliographic Database
 

 

Paper ID: 2694

Complexity Transitions in Evolutionary Algorithms: Evaluating the impact of the initial population
Defaweux,A. Lenaerts,T. van Hemert,J.I. Parent,J. ,

Appeared in: Proceedings of the Congress on Evolutionary Computation,
Page Numbers:196--203
Publisher: {IEEE} Press
Year: 2005
ISBN/ISSN:
Contributing Organisation(s):
Field of Science: e-Science

URL:

Abstract: This paper proposes an evolutionary approach for the composition of solutions in an incremental way. The approach is based on the metaphor of transitions in complexity discussed in the context of evolutionary biology. Partially defined solutions interact and evolve into aggregations until a full solution for the problem at hand is found. The impact of the initial population on the outcome and the dynamics of the process is evaluated using the domain of binary constraint satisfaction problems.

Keywords: constraint satisfaction, transition models,


BIB DOC HTM HTML PDF PPT PS RTF TEX TXT ZIP




 

Last Updated: 22 Jun 12 11:02
This is an archived website, preserved and hosted by the School of Physics and Astronomy at the University of Edinburgh. The School of Physics and Astronomy takes no responsibility for the content, accuracy or freshness of this website. Please email webmaster [at] ph [dot] ed [dot] ac [dot] uk for enquiries about this archive.