Orienteering Problem (OP)
Table of Contents
Orienteering Problem (OP) #
The Orienteering Problem involves selecting a subset of locations to visit with profit maximization subject to distance constraints.
Recent Literature #
A reinforcement learning approach to the orienteering problem with time windows Computers & Operations Research, 2021. paper, code
Ricardo Gama, Hugo L. Fernandes
Meta-SAGE: Scale Meta-Learning Scheduled Adaptation with Guided Exploration for Mitigating Scale Shift on Combinatorial Optimization ICML, 2023. paper
Son, Jiwoo and Kim, Minsu and Kim, Hyeonah and Park, Jinkyoo
DeepACO: Neural-enhanced Ant Systems for Combinatorial Optimization NeurIPS, 2023. paper, code
Ye, Haoran and Wang, Jiarui and Cao, Zhiguang and Liang, Helan and Li, Yong
UDC: A Unified Neural Divide-and-Conquer Framework for Large-Scale Combinatorial Optimization Problems NeurIPS, 2024. paper, code
Zhi Zheng, Changliang Zhou, Tong Xialiang, Mingxuan Yuan, Zhenkun Wang