arXiv:2004.07017
공식 코드 · Papers with Code
Ants can orienteer a thief in their robbery
원문 초록
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%.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
B-XAIC Dataset: Benchmarking Explainable AI for Graph Neural Networks Using Chemical Data
SenseShift6D: Multimodal RGB-D Benchmarking for Robust 6D Pose Estimation across Environment and Sensor Variations
DVFL-Net: A Lightweight Distilled Video Focal Modulation Network for Spatio-Temporal Action Recognition
DCR: Quantifying Data Contamination in LLMs Evaluation
FLsim: A Modular and Library-Agnostic Simulation Framework for Federated Learning
DrafterBench: Benchmarking Large Language Models for Tasks Automation in Civil Engineering
토론
이 논문과 연결된 포럼 글이 아직 없습니다.