On Solving Distributed Configuration with Distributed Genetic Annealing Algorithms

DCSP(distributed constraint satisfaction problem) algorithms can not give satisfactory result while solving distributed configuration in over-constrained or under-constrained situation. Then distributed configuration was regarded as distributed combinatorial optimization problem. The genetic annealing algorithms were expanded to distributed genetic annealing algorithms(DGAA) to solve distributed configuration problem. A test software platform was programmed based on SOAP(simple object access protocol). The computing results were satisfactory in any constraint situation. As a result, DGAA can solve distributed configuration problem in any constraint situation.