arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2004.07017cs.AI
收藏

蚂蚁在抢劫时能使小偷定向

Ants can orienteer a thief in their robbery

Universidade Federal de Ouro Preto(欧鲁普雷图联邦大学);Universidade Federal de Viçosa(维索萨联邦大学);The University of Adelaide(阿德莱德大学)

Jonatas B. C. Chagas, Markus Wagner

摘要:

小偷定向问题(Thief Orienteering Problem,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%.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑