Sisi Zheng

ASPDD: An Adaptive Knowledge Distillation Framework for TSP Generalization Problems

2024 · IEEE Access

The traveling salesman problem (TSP) is a classic non-deterministic polynomial-hard (NP-hard) problem. Currently, almost all the research works utilizing Transformers to solve TSP problems employ supervised learning. However, it is extremely challenging to obtain accurate …