Ant colonies are good at solving constraint satisfaction problemsAnt colonies are good at solving constraint satisfaction problems
Faculty of Sciences. Mathematics and Computer Science

Department of Mathematics - Computer Sciences

conferenceObject

2000 2000

Mathematics

Biology

Computer. Automation

Proceedings of the 2000 congress on evolutionary computation,vols 1 and 2

2000 Congress on Evolutionary Computation (CEC2000), JUL 16-19, 2000, LA JOLLA, CA

(2000), p. 1190-1195

0-7803-6375-2

000089884700166

E

English (eng)

University of Antwerp

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.

http://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=PARTNER_APP&SrcAuth=LinksAMR&KeyUT=WOS:000089884700166&DestLinkType=RelatedRecords&DestApp=ALL_WOS&UsrCustomerID=ef845e08c439e550330acc77c7d2d848

http://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=PARTNER_APP&SrcAuth=LinksAMR&KeyUT=WOS:000089884700166&DestLinkType=FullRecord&DestApp=ALL_WOS&UsrCustomerID=ef845e08c439e550330acc77c7d2d848

http://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=PARTNER_APP&SrcAuth=LinksAMR&KeyUT=WOS:000089884700166&DestLinkType=CitingArticles&DestApp=ALL_WOS&UsrCustomerID=ef845e08c439e550330acc77c7d2d848