1. Adelaide Research & Scholarship
  2. Schools and Disciplines
  3. School of Computer Science
  4. Computer Science publications
Please use this identifier to cite or link to this item: https://hdl.handle.net/2440/109119
Citations
Scopus Web of Science® Altmetric
?
?
Full metadata record
DC FieldValueLanguage
dc.contributor.authorNallaperuma, S.-
dc.contributor.authorNeumann, F.-
dc.contributor.authorSudholt, D.-
dc.contributor.editorIgel, C.-
dc.date.issued2014-
dc.identifier.citationProceedings of the 2014 Annual Conference on Genetic and Evolutionary Computation, 2014 / Igel, C. (ed./s), pp.807-814-
dc.identifier.isbn9781450326629-
dc.identifier.urihttp://hdl.handle.net/2440/109119-
dc.description.abstractRandomized Search heuristics are frequently applied to NP-hard combinatorial optimization problems. The runtime analysis of randomized search heuristics has contributed tremendously to their theoretical understanding. Recently, randomized search heuristics have been examined regarding their achievable progress within a fixed time budget. We follow this approach and present a first fixed budget runtime analysis for a NP-hard combinatorial optimization problem. We consider the well-known Traveling Salesperson problem (TSP) and analyze the fitness increase that randomized search heuristics are able to achieve within a given fixed budget.-
dc.description.statementofresponsibilitySamadhi Nallaperuma, Frank Neumann, Dirk Sudholt-
dc.language.isoen-
dc.publisherAssociation for Ccomputing Machinery-
dc.rightsCopyright 2014 ACM. Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full cita- tion on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or re- publish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from permissions@acm.org.-
dc.source.urihttp://dl.acm.org/citation.cfm?id=2576768-
dc.subjectTraveling salesperson problem, fitness gain, theory-
dc.titleA fixed budget analysis of randomized search heuristics for the traveling salesperson problem-
dc.typeConference paper-
dc.contributor.conference2014 Annual Conference on Genetic and Evolutionary Computation (GECCO'14) (12 Jul 2014 - 16 Jul 2014 : Vancouver, Canada)-
dc.identifier.doi10.1145/2576768.2598302-
dc.relation.granthttp://purl.org/au-research/grants/arc/DP130104395-
dc.relation.granthttp://purl.org/au-research/grants/arc/DP140103400-
pubs.publication-statusPublished-
dc.identifier.orcidNeumann, F. [0000-0002-2721-3618]-
Appears in Collections:Aurora harvest 8
Computer Science publications

Files in This Item:
File Description SizeFormat 
RA_hdl_109119.pdf
  Restricted Access		Restricted Access394.68 kBAdobe PDFView/Open
Show simple item record


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.