Comparing variants of MMAS ACO algorithms on pseudo-boolean functions

dc.contributor.author	Neumann, Frank	de
dc.contributor.author	Sudholt, Dirk	de
dc.contributor.author	Witt, Carsten	de
dc.date.accessioned	2009-05-12T16:01:21Z
dc.date.available	2009-05-12T16:01:21Z
dc.date.issued	2007-05	de
dc.description.abstract	Recently, the first rigorous runtime analyses of ACO algorithms have been presented. These results concentrate on variants of the MAX-MIN ant system by St¨utzle and Hoos and consider their runtime on simple pseudo-Boolean functions such as OneMax and LeadingOnes. Interestingly, it turns out that a variant called 1-ANT is very sensitive to the choice of the evaporation factor while a recent technical report by Gutjahr and Sebastiani suggests partly opposite results for their variant called MMAS. In this paper, we elaborate on the differences between the two ACO algorithms, generalize the techniques by Gutjahr and Sebastiani and show improved results.	en
dc.identifier.uri	http://hdl.handle.net/2003/26137
dc.identifier.uri	http://dx.doi.org/10.17877/DE290R-8707
dc.language.iso	en	de
dc.relation.ispartofseries	Reihe CI; 230-07	de
dc.subject.ddc	004	de
dc.title	Comparing variants of MMAS ACO algorithms on pseudo-boolean functions	en
dc.type	Text	de
dc.type.publicationtype	report	de
dcterms.accessRights	open access

Files

Now showing 1 - 1 of 1