Please use this identifier to cite or link to this item: http://hdl.handle.net/2440/109186
Citations
Scopus Web of Science® Altmetric
?
?
Full metadata record
DC FieldValueLanguage
dc.contributor.authorPourhassan, M.en
dc.contributor.authorNeumann, F.en
dc.date.issued2015en
dc.identifier.citationProceedings of the 2015 Genetic and Evolutionary Computation Conference, 2015 / Silva, S. (ed./s), pp.465-472en
dc.identifier.isbn9781450334723en
dc.identifier.urihttp://hdl.handle.net/2440/109186-
dc.description.abstractThe generalized travelling salesperson problem is an important NP-hard combinatorial optimization problem where local search approaches have been very successful. We investigate the two hierarchical approaches of Hu and Raidl [9] for solving this problem from a theoretical perspective. We examine the complementary abilities of the two approaches caused by their neighbourhood structures and the advantage of combining them into variable neighbourhood search. We first point out complementary abilities of the two approaches by presenting instances where they mutually outperform each other. Afterwards, we introduce an instance which is hard for both approaches, but where a variable neighbourhood search combining them finds the optimal solution in polynomial time.en
dc.description.statementofresponsibilityMojgan Pourhassan, Frank Neumannen
dc.language.isoenen
dc.publisherAssocation for Computing Machineryen
dc.rights© 2015 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 citation 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 republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from permissions@acm.org.en
dc.source.urihttp://dl.acm.org/citation.cfm?id=2739480en
dc.subjectGeneralized travelling salesperson problem, local search, variable neighbourhood search, 2-OPT, combinatorial optimisationen
dc.titleOn the impact of local search operators and variable neighbourhood search for the generalized travelling salesperson problemen
dc.typeConference paperen
dc.identifier.rmid0030042088en
dc.contributor.conference2015 Genetic and Evolutionary Computation Conference (GECCO 2015) (11 Jul 2015 - 15 Jul 2015 : Madrid, Spain)en
dc.identifier.doi10.1145/2739480.2754656en
dc.relation.granthttp://purl.org/au-research/grants/arc/DP130104395en
dc.relation.granthttp://purl.org/au-research/grants/arc/DP140103400en
dc.identifier.pubid233686-
pubs.library.collectionComputer Science publicationsen
pubs.library.teamDS06en
pubs.verification-statusVerifieden
pubs.publication-statusPublisheden
dc.identifier.orcidNeumann, F. [0000-0002-2721-3618]en
Appears in Collections:Computer Science publications

Files in This Item:
File Description SizeFormat 
RA_hdl_109186.pdfRestricted Access911.67 kBAdobe PDFView/Open


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