Please use this identifier to cite or link to this item: http://hdl.handle.net/2440/128753
Citations
Scopus Web of Science® Altmetric
?
?
Full metadata record
DC FieldValueLanguage
dc.contributor.authorChagas, J.en
dc.contributor.authorWagner, M.en
dc.date.issued2020en
dc.identifier.citationOperations Research Letters, 2020; 48(6):708-714en
dc.identifier.issn0167-6377en
dc.identifier.urihttp://hdl.handle.net/2440/128753-
dc.description.abstractThe Thief Orienteering Problem (ThOP) is a multi-component problem that combines features of two classic combinatorial optimization problems: Orienteering Problem and Knapsack Problem. The ThOP is challenging due to the given time constraint and the interaction between its components. We propose an Ant Colony Optimization algorithm together with a new packing heuristic to deal individually and interactively with problem components. Our approach outperforms existing work on more than 90% of the benchmarking instances, with an average improvement of over 300%.en
dc.description.statementofresponsibilityJonatas B.C. Chagas, Markus Wagneren
dc.language.isoenen
dc.publisherElsevieren
dc.rights© 2020 Elsevier B.V. All rights reserved.en
dc.subjectOrienteering problem; knapsack problem; multi-component problems; ant colony optimizationen
dc.titleAnts can orienteer a thief in their robberyen
dc.typeJournal articleen
dc.identifier.rmid1000026232en
dc.identifier.doi10.1016/j.orl.2020.08.011en
dc.identifier.pubid547627-
pubs.library.collectionComputer Science publicationsen
pubs.library.teamDS14en
pubs.verification-statusVerifieden
pubs.publication-statusPublisheden
dc.identifier.orcidWagner, M. [0000-0002-3124-0061]en
Appears in Collections: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.