DocumentCode :
2731056
Title :
Complexity transitions in evolutionary algorithms: evaluating the impact of the initial population
Author :
Defaweux, Anne ; Lenaerts, Tom ; van Hemert, Jano ; Parent, Johan
Author_Institution :
Fac. of Sci., Vrije Univ. Brussel, Brussels, Belgium
Volume :
3
fYear :
2005
fDate :
2-5 Sept. 2005
Firstpage :
2174
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 :
computational complexity; constraint theory; evolutionary computation; binary constraint satisfaction problems; complexity transitions; evolutionary algorithms; evolutionary biology; Biological system modeling; Collaboration; Constraint optimization; Context modeling; Evolution (biology); Evolutionary computation; NP-complete problem; Stochastic processes; Symbiosis; Testing;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Evolutionary Computation, 2005. The 2005 IEEE Congress on
Print_ISBN :
0-7803-9363-5
Type :
conf
DOI :
10.1109/CEC.2005.1554964
Filename :
1554964
Link To Document :
بازگشت