TSP

The TSP dataset/benchmark contains instances of the Traveling Salesperson Problem, which is used to evaluate the effectiveness of algorithms in finding optimal or near-optimal solutions through various search and improvement methods.

Papers using TSP (4)

TSS GAZ PTP: Towards Improving Gumbel AlphaZero with Two-stage Self-play for Multi-constrained Electric Vehicle Routing Problems2025ASAP: Exploiting the Satisficing Generalization Edge in Neural Combinatorial Optimization2025Synergizing Reinforcement Learning and Genetic Algorithms for Neural Combinatorial Optimization2025A First Guess is Rarely the Final Answer: Learning to Search in the Travelling Salesperson Problem2026