Please use this identifier to cite or link to this item: https://hdl.handle.net/2440/107950
Citations
Scopus Web of Science® Altmetric
?
?
Full metadata record
DC FieldValueLanguage
dc.contributor.authorFaulkner, H.-
dc.contributor.authorPolyakovskiy, S.-
dc.contributor.authorSchultz, T.-
dc.contributor.authorWagner, M.-
dc.contributor.editorSilva, S.-
dc.date.issued2015-
dc.identifier.citationProceedings of the 2015 Annual Conference on Genetic and Evolutionary Computation, 2015 / Silva, S. (ed./s), pp.385-392-
dc.identifier.isbn978-1-4503-3472-3-
dc.identifier.urihttp://hdl.handle.net/2440/107950-
dc.description.abstractThis study addresses the recently introduced Traveling Thief Problem (TTP) which combines the classical Traveling Salesman Problem (TSP) with the 0-1 Knapsack Problem (KP). The problem consists of a set of cities, each containing a set of available items with weights and profits. It involves searching for a permutation of the cities to visit and a decision on items to pick. A selected item contributes its profit to the overall profit at the price of higher transportation cost incurred by its weight. The objective is to maximize the resulting profit. We propose a number of problem-specific packing strategies run on top of TSP solutions derived by the Chained Lin-Kernighan heuristic. The investigations provided on the set of benchmark instances prove their rapidity and efficiency when compared with an approximate mixed integer programming based approach and state-of-the-art heuristic solutions from the literature.-
dc.description.statementofresponsibilityHayden Faulkner, Sergey Polyakovskiy, Tom Schultz, Markus Wagner-
dc.language.isoen-
dc.publisherACM-
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-
dc.subjectTraveling thief problem, local search, multi-component problems-
dc.titleApproximate approaches to the traveling thief problem-
dc.typeConference paper-
dc.contributor.conference2015 Annual Conference on Genetic and Evolutionary Computation (GECCO '15) (11 Jul 2015 - 15 Jul 2015 : Madrid, Spain)-
dc.identifier.doi10.1145/2739480.2754716-
dc.relation.granthttp://purl.org/au-research/grants/arc/DP130104395-
pubs.publication-statusPublished-
dc.identifier.orcidPolyakovskiy, S. [0000-0001-9489-1972]-
dc.identifier.orcidWagner, M. [0000-0002-3124-0061]-
Appears in Collections:Aurora harvest 3
Computer Science publications

Files in This Item:
File Description SizeFormat 
RA_hdl_107950.pdf
  Restricted Access
Restricted Access4.51 MBAdobe PDFView/Open


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