Please use this identifier to cite or link to this item:
|Scopus||Web of Science®||Altmetric|
|Title:||Ants can orienteer a thief in their robbery|
|Citation:||Operations Research Letters, 2020; 48(6):708-714|
|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.|
|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.