H-tsp: Hierarchically solving the large-scale traveling salesman problem
We propose an end-to-end learning framework based on hierarchical reinforcement
learning, called H-TSP, for addressing the large-scale Traveling Salesman Problem (TSP) …
learning, called H-TSP, for addressing the large-scale Traveling Salesman Problem (TSP) …
[HTML][HTML] Learning 2-opt heuristics for routing problems via deep reinforcement learning
Recent works using deep learning to solve routing problems such as the traveling salesman
problem (TSP) have focused on learning construction heuristics. Such approaches find good …
problem (TSP) have focused on learning construction heuristics. Such approaches find good …
Learning 2-opt heuristics for the traveling salesman problem via deep reinforcement learning
PR d O Costa, J Rhuggenaath… - Asian conference on …, 2020 - proceedings.mlr.press
Recent works using deep learning to solve the Traveling Salesman Problem (TSP) have
focused on learning construction heuristics. Such approaches find TSP solutions of good …
focused on learning construction heuristics. Such approaches find TSP solutions of good …
Graph neural network guided local search for the traveling salesperson problem
Solutions to the Traveling Salesperson Problem (TSP) have practical applications to
processes in transportation, logistics, and automation, yet must be computed with minimal …
processes in transportation, logistics, and automation, yet must be computed with minimal …
Pointerformer: Deep reinforced multi-pointer transformer for the traveling salesman problem
Abstract Traveling Salesman Problem (TSP), as a classic routing optimization problem
originally arising in the domain of transportation and logistics, has become a critical task in …
originally arising in the domain of transportation and logistics, has become a critical task in …
Generalize a small pre-trained model to arbitrarily large tsp instances
For the traveling salesman problem (TSP), the existing supervised learning based
algorithms suffer seriously from the lack of generalization ability. To overcome this …
algorithms suffer seriously from the lack of generalization ability. To overcome this …
Unsupervised learning for solving the travelling salesman problem
Y Min, Y Bai, CP Gomes - Advances in Neural Information …, 2024 - proceedings.neurips.cc
We propose UTSP, an Unsupervised Learning (UL) framework for solving the Travelling
Salesman Problem (TSP). We train a Graph Neural Network (GNN) using a surrogate loss …
Salesman Problem (TSP). We train a Graph Neural Network (GNN) using a surrogate loss …
Learning to solve travelling salesman problem with hardness-adaptive curriculum
Various neural network models have been proposed to tackle combinatorial optimization
problems such as the travelling salesman problem (TSP). Existing learning-based TSP …
problems such as the travelling salesman problem (TSP). Existing learning-based TSP …
SplitNet: a reinforcement learning based sequence splitting method for the MinMax multiple travelling salesman problem
Abstract MinMax Multiple Travelling Salesman Problem (mTSP) is an important class of
combinatorial optimization problems with many practical applications, of which the goal is to …
combinatorial optimization problems with many practical applications, of which the goal is to …
AMARL: An attention-based multiagent reinforcement learning approach to the min-max multiple traveling salesmen problem
H Gao, X Zhou, X Xu, Y Lan… - IEEE Transactions on …, 2023 - ieeexplore.ieee.org
In recent years, the multiple traveling salesmen problem (MTSP or multiple TSP) has
received increasing research interest and one of its main applications is coordinated …
received increasing research interest and one of its main applications is coordinated …