# Ants can orienteer a thief in their robbery

arXiv: https://arxiv.org/abs/2004.07017 · HTML: https://mlsanity.com/paper/2004.07017/

## Key facts

- Cited by 1 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 15 Apr 2020.

## Built on by (most cited first, 1 of 1)

- [Efficiently solving the thief orienteering problem with a max-min ant colony optimization approach](https://mlsanity.com/paper/2109.13103/) (2021)

## Abstract (arXiv)

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%.