Hierarchical Neural Constructive Solver for Real-world TSP Scenarios
<|reference_start|>Hierarchical Neural Constructive Solver for Real-world TSP Scenarios: Existing neural constructive solvers for routing problems have predominantly employed transformer architectures, conceptualizing the route construction as a set-to-sequence learning task. However, their efficacy has primarily been demonstrated on entirely random problem instances that inadequately capture real-world scenarios. In this paper, we introduce realistic Traveling Salesman Problem (TSP) scenarios relevant to industrial settings and derive the following insights: (1) The optimal next node (or city) to visit often lies within proximity to the current node, suggesting the potential benefits of biasing choices based on current locations. (2) Effectively solving the TSP requires robust tracking of unvisited nodes and warrants succinct grouping strategies. Building upon these insights, we propose integrating a learnable choice layer inspired by Hypernetworks to prioritize choices based on the current location, and a learnable approximate clustering algorithm inspired by the Expectation-Maximization algorithm to facilitate grouping the unvisited cities. Together, these two contributions form a hierarchical approach towards solving the realistic TSP by considering both immediate local neighbourhoods and learning an intermediate set of node representations. Our hierarchical approach yields superior performance compared to both classical and recent transformer models, showcasing the efficacy of the key designs.<|reference_end|>
@article{goh2024hierarchical,
    title={Hierarchical Neural Constructive Solver for Real-world TSP Scenarios},
    author={Yong Liang Goh, Zhiguang Cao, Yining Ma, Yanfei Dong, Mohammed Haroon
  Dupty, Wee Sun Lee},
    journal={arXiv preprint arXiv:2408.03585},
    year={2024},
    doi={10.1145/3637528.3672053},
    archivePrefix={arXiv},
    eprint={2408.03585},
    primaryClass={cs.LG cs.AI}
}