iMTSP: Solving Min-Max Multiple Traveling Salesman Problem with Imperative Learning

arXiv:2405.00285v1 Announce Type: cross
Abstract: This paper considers a Min-Max Multiple Traveling Salesman Problem (MTSP), where the goal is to find a set of tours, one for each agent, to collectively visit all the cities while minimizing the length of the longest tour. Though MTSP has been widely studied, obtaining near-optimal solutions for large-scale problems is still challenging due to its NP-hardness. Recent efforts in data-driven methods face challenges of the need for hard-to-obtain supervision and issues with high variance …

abstract agent arxiv cities cs.ai cs.lg cs.ro max min multiple paper set type while