Adelaide Research & Scholarship
Please use this identifier to cite or link to this item:
https://hdl.handle.net/2440/128753
| Citations | ||
| Scopus | Web of Science® | Altmetric |
|---|---|---|
|
?
|
?
|
|
| Type: | Journal article |
| Title: | Ants can orienteer a thief in their robbery |
| Author: | Chagas, J.B.C. Wagner, M. |
| Citation: | Operations Research Letters, 2020; 48(6):708-714 |
| Publisher: | Elsevier |
| Issue Date: | 2020 |
| ISSN: | 0167-6377 1872-7468 |
| Statement of Responsibility: | Jonatas B.C. Chagas, Markus Wagner |
| Abstract: | The 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%. |
| Keywords: | Orienteering problem; knapsack problem; multi-component problems; ant colony optimization |
| Rights: | © 2020 Elsevier B.V. All rights reserved. |
| DOI: | 10.1016/j.orl.2020.08.011 |
| Published version: | http://dx.doi.org/10.1016/j.orl.2020.08.011 |
| Appears in Collections: | Aurora harvest 8 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.