01078nas a2200181 4500008004100000245010300041210006900144260001700213300001300230520050200243653002800745653002200773100001600795700001600811700001600827700001400843856003900857 2005 eng d00aComplexity Transitions in Evolutionary Algorithms: Evaluating the impact of the initial population0 aComplexity Transitions in Evolutionary Algorithms Evaluating the b{IEEE} Press a196--2033 aThis 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.10aconstraint satisfaction10atransition models1 aDefaweux, A1 aLenaerts, T1 aHemert, J I1 aParent, J uhttp://research.nesc.ac.uk/node/12