Please use this identifier to cite or link to this item:
https://hdl.handle.net/2440/70712
Citations | ||
Scopus | Web of Science® | Altmetric |
---|---|---|
?
|
?
|
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Kötzing, T. | - |
dc.contributor.author | Neumann, F. | - |
dc.contributor.author | Sudholt, D. | - |
dc.contributor.author | Wagner, M. | - |
dc.date.issued | 2011 | - |
dc.identifier.citation | Proceeding: FOGA '11: Proceedings of the 11th Workshop Proceedings on Foundations of Genetic Algorithms, 2011, vol.abs/1007.4707, pp.209-218 | - |
dc.identifier.isbn | 9781450306331 | - |
dc.identifier.uri | http://hdl.handle.net/2440/70712 | - |
dc.description.abstract | With this paper, we contribute to the understanding of ant colony optimization (ACO) algorithms by formally analyzing their runtime behavior. We study simple MAX-MIN ant systems on the class of linear pseudo-Boolean functions defined on binary strings of length n. Our investigations point out how the progress according to function values is stored in the pheromones. We provide a general upper bound of O((n3 log n)ρ) on the running time for two ACO variants on all linear functions, where ρ determines the pheromone update strength. Furthermore, we show improved bounds for two well-known linear pseudo-Boolean functions called ONEMAX and BINVAL and give additional insights using an experimental study. | - |
dc.description.statementofresponsibility | Timo Kötzing, Frank Neumann, Dirk Sudholt, Markus Wagner | - |
dc.description.uri | http://www.sigevo.org/foga-2011/ | - |
dc.language.iso | en | - |
dc.publisher | ACM Press | - |
dc.rights | Copyright 2011 ACM | - |
dc.source.uri | http://doi.acm.org/10.1145/1967654.1967673 | - |
dc.subject | Ant colony optimization; MMAS; runtime analysis; pseudo-Boolean optimization; theory | - |
dc.title | Simple max-min ant systems and the optimization of linear pseudo-boolean functions | - |
dc.type | Conference paper | - |
dc.contributor.conference | ACM SIGEVO Workshop on Foundations of Genetic Algorithms (5 Jan 2011 - 9 Jan 2011 : Schwarzenberg, Austria) | - |
dc.identifier.doi | 10.1145/1967654.1967673 | - |
dc.publisher.place | New York | - |
pubs.publication-status | Published | - |
dc.identifier.orcid | Neumann, F. [0000-0002-2721-3618] | - |
dc.identifier.orcid | Wagner, M. [0000-0002-3124-0061] | - |
Appears in Collections: | Aurora harvest Computer Science publications |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
RA_hdl_70712.pdf Restricted Access | Restricted Access | 1.07 MB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.