2 papers
cs.AI2025
Bandit based Dynamic Candidate Edge Selection in Solving Traveling Salesman Problems
Long Wang, Jiongzhi Zheng, Zhengda Xiong +2
Algorithms designed for routing problems typically rely on high-quality candidate edges to guide their search, aiming to reduce the search space and enhance the search efficiency.…
cs.DS2025
Multi-armed Bandit and Backbone boost Lin-Kernighan-Helsgaun Algorithm for the Traveling Salesman Problems
Long Wang, Jiongzhi Zheng, Zhengda Xiong +1
The Lin-Kernighan-Helsguan (LKH) heuristic is a classic local search algorithm for the Traveling Salesman Problem (TSP). LKH introduces an -value to replace the traditional dis…