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/1201208nas a2200241 4500008004100000020001800041245007300059210006900132260002000201300001300221520051200234653002800746653002200774100001600796700001600812700001600828700001800844700001700862700001700879700001700896700001400913856003900927 2005 eng d a3-540-28848-100aEvolutionary Transitions as a Metaphor for Evolutionary Optimization0 aEvolutionary Transitions as a Metaphor for Evolutionary Optimiza bSpringer-Verlag a342--3523 aThis paper proposes a computational model for solving optimisation problems that mimics the principle of evolutionary transitions in individual complexity. More specifically it incorporates mechanisms for the emergence of increasingly complex individuals from the interaction of more simple ones. The biological principles for transition are outlined and mapped onto an evolutionary computation context. The class of binary constraint satisfaction problems is used to illustrate the transition mechanism.10aconstraint satisfaction10atransition models1 aDefaweux, A1 aLenaerts, T1 aHemert, J I1 aCapcarrere, M1 aFreitas, A A1 aBentley, P J1 aJohnson, C G1 aTimmis, J uhttp://research.nesc.ac.uk/node/1301125nas a2200205 4500008004100000245009600041210006900137260001600206300001300222520051000235653002800745653002200773100001600795700001600811700001600827700001400843700001600857700000700873856003900880 2005 eng d00aTransition Models as an incremental approach for problem solving in Evolutionary Algorithms0 aTransition Models as an incremental approach for problem solving b{ACM} Press a599--6063 aThis paper proposes an incremental approach for building solutions using evolutionary computation. It presents a simple evolutionary model called a Transition model. It lets building units of a solution interact and then uses an evolutionary process to merge these units toward a full solution for the problem at hand. The paper provides a preliminary study on the evolutionary dynamics of this model as well as an empirical comparison with other evolutionary techniques on binary constraint satisfaction.10aconstraint satisfaction10atransition models1 aDefaweux, A1 aLenaerts, T1 aHemert, J I1 aParent, J1 aBeyer, H -G1 aal uhttp://research.nesc.ac.uk/node/14