1 citations · 1 across the 2 of their papers we have counts for
2 papers
cs.AI2022
An Effective Iterated Two-stage Heuristic Algorithm for the Multiple Traveling Salesmen Problem
Jiongzhi Zheng, Yawei Hong, Wenchang Xu +2
The multiple Traveling Salesmen Problem (mTSP) is a general extension of the famous NP-hard Traveling Salesmen Problem (TSP), that there are m (m > 1) salesmen to visit the cities.…
cs.AI2020★ 1 cited
Combining Reinforcement Learning with Lin-Kernighan-Helsgaun Algorithm for the Traveling Salesman Problem
Jiongzhi Zheng, Kun He, Jianrong Zhou +2
We address the Traveling Salesman Problem (TSP), a famous NP-hard combinatorial optimization problem. And we propose a variable strategy reinforced approach, denoted as VSR-LKH, wh…