Constraint satisfaction on dynamic environments by the means of coevolutionary genetic algorithms

Abstract

We discuss adaptability of evolutionary computations in dynamic environments. We introduce two classes of dynamic environments which are utilizing the notion of constraint satisfaction problems: changeover and gradation. The changeover environment is a problem class which consists of a sequence of the constraint networks with the same nature. On the other hand, the gradation environment is a problem class which consists of a sequence of the constraint networks such that the sequence is associated with two constraint networks, i. e., initial and target, and all constraint networks in the sequence metamorphosis from the initial constraint network to the target constraint network. We compare coevolutionary genetic algorithms with SGA in computational simulations. Experimental results on the above dynamic environments confirm us the effectiveness of our approach, i.e., coevolutionary genetic algorithm.