Solving large-scale traveling salesman problems based on large language model
The Traveling Salesman Problem (TSP) is an NP-hard yet fundamental combinatorial optimization problem with applications across numerous real-world fields, including transportation, logistics, and manufacturing. In recent years, artificial intelligence (AI)-based algorithms have gained popularity for solving TSP, partic...