arXiv Open Access 2020

Ants can orienteer a thief in their robbery

Jonatas B. C. Chagas Markus Wagner

Lihat Sumber

Abstrak

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

Topik & Kata Kunci

cs.AI

Penulis (2)

Jonatas B. C. Chagas

Markus Wagner

Format Sitasi

APA MLA BibTeX

Chagas, J.B.C., Wagner, M. (2020). Ants can orienteer a thief in their robbery. https://arxiv.org/abs/2004.07017

Akses Cepat

Lihat di Sumber

Informasi Jurnal

Tahun Terbit: 2020
Bahasa: en
Sumber Database: arXiv
Akses: Open Access ✓