Traveling Salesman Problem (TSP)

The Traveling Salesman Problem (TSP) is a benchmark problem in combinatorial optimization that involves finding the shortest possible route that visits a set of cities and returns to the origin city, used to evaluate the effectiveness of various algorithmic strategies.

Papers using Traveling Salesman Problem (TSP) (3)

Decoupling Numerical and Structural Parameters: An Empirical Study on Adaptive Genetic Algorithms via Deep Reinforcement Learning for the Large-Scale TSP2026Preference Optimization for Combinatorial Optimization Problems2025Leader Reward for POMO-Based Neural Combinatorial Optimization2024