%0 Conference Paper
%B Proceedings of the Congress on Evolutionary Computation
%D 2005
%T Complexity Transitions in Evolutionary Algorithms: Evaluating the impact of the initial population
%A Defaweux, A.
%A Lenaerts, T.
%A van Hemert, J. I.
%A Parent, J.
%K constraint satisfaction
%K transition models
%X 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.
%B Proceedings of the Congress on Evolutionary Computation
%I {IEEE} Press
%P 196--203
%G eng
%9 inproceedings
%0 Conference Paper
%B Proceedings of the Genetic and Evolutionary Computation Conference
%D 2005
%T Transition Models as an incremental approach for problem solving in Evolutionary Algorithms
%A Defaweux, A.
%A Lenaerts, T.
%A van Hemert, J. I.
%A Parent, J.
%E H.-G. Beyer
%E et al
%K constraint satisfaction
%K transition models
%X This 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.
%B Proceedings of the Genetic and Evolutionary Computation Conference
%I {ACM} Press
%P 599--606
%G eng
%9 inproceedings