Title
Swarm intelligence on the binary constraint satisfaction problem Swarm intelligence on the binary constraint satisfaction problem
Author
Faculty/Department
Faculty of Sciences. Mathematics and Computer Science
Publication type
conferenceObject
Publication
Los Alamitos, Calif. :IEEE, [*]
Subject
Mathematics
Biology
Engineering sciences. Technology
Computer. Automation
Source (book)
IEEE World Congress on Computational Intelligence (WCCI2002), May 12-17, 2002, Honolulu, Hawaii
ISBN
0-7803-7282-4
ISI
000180919800246
Carrier
E
Target language
English (eng)
Affiliation
University of Antwerp
Abstract
In this paper we introduce a discrete particle swarm (PS) algorithm for solving binary constraint satisfaction problems (CSPs). It uses information about the conflicts between the variables to compute the velocity of the individual particles. We tune the parameters of the PS algorithm to a quasi-optimal setting and study the behavior of the algorithm under changes to this setting. The PS algorithm is then empirically compared with ant colonies (which also belong to the swarm intelligence class) and genetic algorithms on a whole range of randomly generated binary CSP instances.
E-info
http://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=PARTNER_APP&SrcAuth=LinksAMR&KeyUT=WOS:000180919800246&DestLinkType=RelatedRecords&DestApp=ALL_WOS&UsrCustomerID=ef845e08c439e550330acc77c7d2d848
http://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=PARTNER_APP&SrcAuth=LinksAMR&KeyUT=WOS:000180919800246&DestLinkType=FullRecord&DestApp=ALL_WOS&UsrCustomerID=ef845e08c439e550330acc77c7d2d848
http://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=PARTNER_APP&SrcAuth=LinksAMR&KeyUT=WOS:000180919800246&DestLinkType=CitingArticles&DestApp=ALL_WOS&UsrCustomerID=ef845e08c439e550330acc77c7d2d848
Handle