Publication
Title
Ant colonies are good at solving constraint satisfaction problems
Author
Abstract
In this paper 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 held 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.
Language
English
Source (journal)
Proceedings of the 2000 congress on evolutionary computation,vols 1 and 2
Source (book)
2000 Congress on Evolutionary Computation (CEC2000), JUL 16-19, 2000, LA JOLLA, CA
Publication
2000
ISBN
0-7803-6375-2
Volume/pages
(2000), p. 1190-1195
ISI
000089884700166
UAntwerpen
Faculty/Department
Research group
Publication type
Subject
Affiliation
Publications with a UAntwerp address
External links
Web of Science
Record
Identification
Creation 03.01.2013
Last edited 21.04.2017
To cite this reference