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.…