Please use this identifier to cite or link to this item:
https://hdl.handle.net/2440/66756
Citations | ||
Scopus | Web of Science® | Altmetric |
---|---|---|
?
|
?
|
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Neumann, F. | - |
dc.contributor.author | Sudholt, D. | - |
dc.contributor.author | Witt, C. | - |
dc.contributor.editor | Stutzle, T. | - |
dc.contributor.editor | Birattari, M. | - |
dc.contributor.editor | Hoos, H.H. | - |
dc.date.issued | 2007 | - |
dc.identifier.citation | Engineering Stochastic Local Search Algorithms: Designing, Implementing and Analyzing Effective Heuristics: International Workshop, SLS 2007, Brussels, Belgium, September 6-8, 2007: Proceedings / T. Stützle, M. Birattari, H. H. Hoos (eds.), pp. 61-75 | - |
dc.identifier.isbn | 9783540744450 | - |
dc.identifier.issn | 0302-9743 | - |
dc.identifier.issn | 1611-3349 | - |
dc.identifier.uri | http://hdl.handle.net/2440/66756 | - |
dc.description | Also published as a journal article: Lecture Notes in Computer Science, 2007; 4638:61-75 | - |
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 Stutzle 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. | - |
dc.description.statementofresponsibility | Frank Neumann, Dirk Sudholt, and Carsten Witt | - |
dc.language.iso | en | - |
dc.publisher | Springer | - |
dc.relation.ispartofseries | Lecture Notes in Computer Science | - |
dc.rights | © Springer-Verlag Berlin Heidelberg 2007 | - |
dc.title | Comparing Variants of MMAS ACO Algorithms on Pseudo-Boolean Functions | - |
dc.type | Conference paper | - |
dc.contributor.conference | International Workshop on Engineering Stochastic Local Search Algorithms (2007 : Brussels, Belgium) | - |
dc.identifier.doi | 10.1007/978-3-540-74446-7 | - |
dc.publisher.place | Berlin | - |
pubs.publication-status | Published | - |
dc.identifier.orcid | Neumann, F. [0000-0002-2721-3618] | - |
Appears in Collections: | Aurora harvest Computer Science publications |
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.