Distributed simulated re-annealing for dynamic constraint satisfaction problems

The aim of the paper is to show the advantage of the distributed approach based on an optimization process like simulated annealing. This advantage is exhibited through the example of constraint satisfaction problems. Since most of these problems are currently dynamic, the paper presents an extension of the basic model, which has already been developed and successfully experimented with (K. Ghedira, 1994). Thus, two revision mechanisms, based on distributed simulated “re-annealing”, are proposed and compared from the efficiency, stability and optimality points of view