By Topic

Swarm intelligence on the binary constraint satisfaction problem

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

2 Author(s)
L. Schoofs ; Antwerp Univ., Belgium ; B. Naudts

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

Published in:

Evolutionary Computation, 2002. CEC '02. Proceedings of the 2002 Congress on  (Volume:2 )

Date of Conference: