The application of machine learning models to optimal TSP tour length estimation
The traveling salesman problem (TSP) is a well‐known NP‐hard problem in combinatorial optimization, with numerous applications in logistics and elsewhere. This paper introduces a machine learning‐based approach to estimate the optimal tour length of the TSP, using linear regression, random forests (RF), and neural ne...