Solving distributed asymmetric constraint satisfaction problems using an evolutionary society of hill-climbers

  • Authors:

  • Gerry Dozier

  • Affiliations:

  • Department of Computer Science and Software Engineering, Auburn University, Auburn, AL

  • Venue:
  • GECCO'03 Proceedings of the 2003 international conference on Genetic and evolutionary computation: PartI
  • Year:
  • 2003

Quantified Score

Hi-index 0.00

Visualization

Abstract

The distributed constraint satisfaction problem (DisCSP) can be viewed as a 4-tuple (X, D, C, A), where X is a set of n variables, D is a set of n domains (one domain for each of the n variables), C is a set of constraints that constrain the values that can be assigned to the n variables, and A is a set of agents for which the variables and constraints are distributed. The objective in solving a DisCSP is to allow the agents in A to develop a consistent distributed solution by means of message passing. In this paper, we present an evolutionary society of hill-climbers (ESoHC) that outperforms a previously developed algorithm for solving randomly generated DisCSPs that are composed of asymmetric constraints on a test suite of 2,800 distributed asymmetric constraint satisfaction problems.