most citedDeep Reinforcement Learning for Orienteering Problems Based on Decomposition

2 citations · 2 across the 1 of their papers we have counts for

collaborators

1 paper

cs.NE2022★ 2 cited

Deep Reinforcement Learning for Orienteering Problems Based on Decomposition

Wei Liu, Tao Zhang, Rui Wang +3

This paper presents a new method for solving an orienteering problem (OP) by breaking it down into two parts: a knapsack problem (KP) and a traveling salesman problem (TSP). A KP s…