Using Evolutionary Computations to Solve Dynamic Constrait Satisfaction Problems

Abstract

In this paper, we examine the behavior of Evolutionary Computations under dynamic environments. In order to generate the dynamic environments systematically, we define the framework of the Dynamic Constraint Satisfaction Problems. Our comparisons of ECs to investigate the applicability to solve the DCSPs are based upon two viewpoints: the difference of reproduction manner and the use of local search methods, i.e., repair methods in the case of solving CSPs. The experimental results carried out in this paper show that Estimation of Distribution Algorithms with repair method could track the changed environments well.