Transition models as an incremental approach for problem solving in evolutionary algorithms

This paper proposes an incremental approach for building solutions using evolutionary computation. It presents a simple evolutionary model called a Transition model in which partial solutions are constructed that interact to provide larger solutions. An evolutionary process is used to merge these partial solutions into 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. Categories and Subject Descriptors Computing Methodologies [Artificial Intelligence]: Problem Solving, Control Methods, and Search General Terms Algorithms Keywords Evolutionary Algorithms, Constraint Satisfaction Problem, Emergence of Complexity, Local search, Combinatorial Optimization

• Type: Conference
• Year: 2005
• Where: GECCO
• Authors: Anne Defaweux, Tom Lenaerts, Jano I. van Hemert, Johan Parent
• Keywords: Evolutionary, GECCO 2005, Partial Solutions, Simple Evolutionary Model