4 citations · 11 across the 4 of their papers we have counts for
Showing cs.AIShow all
3 papers · 1 filter
cs.AI2023★ 2 cited
Pointerformer: Deep Reinforced Multi-Pointer Transformer for the Traveling Salesman Problem
Yan Jin, Yuandong Ding, Xuanhao Pan +5
Traveling Salesman Problem (TSP), as a classic routing optimization problem originally arising in the domain of transportation and logistics, has become a critical task in broader…
cs.AI2023★ 4 cited
H-TSP: Hierarchically Solving the Large-Scale Travelling Salesman Problem
Xuanhao Pan, Yan Jin, Yuandong Ding +4
We propose an end-to-end learning framework based on hierarchical reinforcement learning, called H-TSP, for addressing the large-scale Travelling Salesman Problem (TSP). The propos…
cs.AI2022★ 1 cited
Reinforced Lin-Kernighan-Helsgaun Algorithms for the Traveling Salesman Problems
Jiongzhi Zheng, Kun He, Jianrong Zhou +2
TSP is a classical NP-hard combinatorial optimization problem with many practical variants. LKH is one of the state-of-the-art local search algorithms for the TSP. LKH-3 is a power…