Cart (Loading....) | Create Account
Close category search window

Ant colonies are good at solving 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
$31 $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)
Schoofs, L. ; Dept. of Math. & Comput. Sci., Antwerp Univ., Belgium ; Naudts, B.

We define an ant algorithm for solving random binary constraint satisfaction problems (CSPs). We empirically investigate the behavior of the algorithm on this type of problems and establish the parameter settings under which the ant algorithm performs best for a specific class of CSPs. The ant algorithm is compared to six other state-of-the-art stochastic algorithms from the field of evolutionary computing. It turns out that the ant algorithm outperforms all other algorithms and that bivariate distribution algorithms perform worse than the univariate ones, the latter largely due to the fact that they cannot model the randomly generated instances

Published in:

Evolutionary Computation, 2000. Proceedings of the 2000 Congress on  (Volume:2 )

Date of Conference:


Need Help?

IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.