A systematic literature review on the use of machine learning in traveling salesman problems
The Traveling Salesman Problem (TSP) has been documented in the history of combinatorial optimization since the 18th century. TSP is a well-known NP-hard problem that has been extensively studied, where a salesman aims to visit each of a set of cities exactly once and return to the starting city with minimal distance t...