By Topic

A Comparison of Evolutionary Protocols for Solving Distributed Constraint Satisfaction Problems

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
W. R. Britt ; Computer Science and Software Engineering Department of Auburn University, Auburn, AL 36849. Phone: 334-546-8273; e-mail: brittwr@auburn.edu ; H. D. Cunningham ; G. V. Dozier

Evolutionary Computation (EC) is the field of study devoted to problem solving using simulated evolution. In this paper, evolutionary operators are applied and a number of societies of hill-climbers (SoHCs), such as a genetic SoHC (GSoHC) and an evolutionary SoHC (ESoHC) are employed for solving randomly generated distributed asymmetric constraint satisfaction problems (DisACSPs). Further, we develop an Estimation of Distribution Algorithm SoHC (EDA-SoHC) variant using a uniform mutation operator. This variant produces offspring by drawing genetic material from a distribution of above-average individuals in the population. In this paper, we compare GSoHCs using distributed restricted forms of single-point, two-point, modified two-point, and uniform crossover. The GSoHCs are also compared with an ESoHC that uses a distributed restricted form of uniform mutation and a simple SoHC which does not use any evolutionary operators. Finally, we compare the SoHC, GSoHCs, and ESoHC to the EDA-SoHC.

Published in:

2006 IEEE International Conference on Evolutionary Computation

Date of Conference:

0-0 0