DocumentCode
419019
Title
Recurrent distributed constraint satisfaction via genetic and evolutionary societies of hill-climbers
Author
Dozier, Gerry
Author_Institution
Dept. of Comput. Sci. & Software Eng., Auburn Univ., AL, USA
Volume
1
fYear
2004
fDate
19-23 June 2004
Firstpage
273
Abstract
In this paper, we compare genetic and evolutionary societies of hill-climbers (GSoHCs and ESoHCs) by G. Dozier and V. Rupela (2002) for solving recurrent DisCSPs. Our results show that: (1) the GSoHCs outperform the ESoHCs; (2) the GSoHCs and ESoHCs that use virtual constraints have better performance than those that do not; (3) GsoHCs and ESoHCs which discover multiple solutions per occasion have better performance than those that discover fewer solutions per occasion; and (4) thrashing that results from a dynamic virtual constraint set may adversely affect the performance of genetic and evolutionary search on recurrent DisACSPs.
Keywords
constraint theory; evolutionary computation; search problems; dynamic virtual constraint set; evolutionary search; evolutionary society; genetic search; genetic society; hill-climbers; recurrent distributed constraint satisfaction; thrashing; Computer science; Distributed algorithms; Fellows; Genetics; Message passing; Monitoring; Privacy; Security; Software engineering; Stability;
fLanguage
English
Publisher
ieee
Conference_Titel
Evolutionary Computation, 2004. CEC2004. Congress on
Print_ISBN
0-7803-8515-2
Type
conf
DOI
10.1109/CEC.2004.1330867
Filename
1330867
Link To Document