论文标题
蚂蚁可以在抢劫中朝着小偷定位小偷
Ants can orienteer a thief in their robbery
论文作者
论文摘要
小偷定位式问题（THOP）是一个多组分问题，结合了两个经典组合优化问题的特征：定向启动问题和背包问题。由于给定的时间限制及其组件之间的相互作用，THOP具有挑战性。我们提出了一种蚂蚁菌落优化算法以及一种新的包装启发式，以单独和互动处理问题成分。我们的方法在超过90％的基准实例上的现有工作优于现有工作，平均提高了300％以上。
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%.
