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 …
[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 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 …
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) …
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 …
The transformer network for the traveling salesman problem
The Traveling Salesman Problem (TSP) is the most popular and most studied combinatorial
problem, starting with von Neumann in 1951. It has driven the discovery of several …
problem, starting with von Neumann in 1951. It has driven the discovery of several …
Improving the state-of-the-art in the traveling salesman problem: An anytime automatic algorithm selection
II Huerta, DA Neira, DA Ortega, V Varas… - Expert Systems with …, 2022 - Elsevier
This work presents a new metaheuristic for the euclidean Traveling Salesman Problem
(TSP) based on an Anytime Automatic Algorithm Selection model using a portfolio of five …
(TSP) based on an Anytime Automatic Algorithm Selection model using a portfolio of five …
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 …
Benchmarking optimization algorithms: An open source framework for the traveling salesman problem
We introduce an experimentation procedure for evaluating and comparing optimization
algorithms based on the Traveling Salesman Problem (TSP). We argue that end-of-run …
algorithms based on the Traveling Salesman Problem (TSP). We argue that end-of-run …
Memory-efficient transformer-based network model for traveling salesman problem
Combinatorial optimization problems such as Traveling Salesman Problem (TSP) have a
wide range of real-world applications in transportation, logistics, manufacturing. It has …
wide range of real-world applications in transportation, logistics, manufacturing. It has …