Claim your 3000 XEL
- Using the BF algorithm does not solve the TSP efficiently
- Using the Algorithm: Simulated Annealing Solution solves the TSP in an efficient manner
- Your job is to make this script work with ePL. Be the first one to do it and win the 3000 XEL prize!
- Contact XEL community administrators once you have solved it and claim your XEL
- Learn more about ePL here
Traveling Salesman Problem
ATT48 is a set of 48 cities (US state capitals) from TSPLIB. The minimal tour has length 10628 .
The travelling salesman problem (TSP) asks the following question: "Given a list of cities and the distances between each pair of cities, what is the shortest possible route that visits each city and returns to the origin city?" It is an NP-hard problem in combinatorial optimization, important in operations research and theoretical computer science.
The travelling purchaser problem and the vehicle routing problem are both generalizations of TSP.
In the theory of computational complexity, the decision version of the TSP (where, given a length L, the task is to decide whether the graph has any tour shorter than L) belongs to the class of NP-complete problems. Thus, it is possible that the worst-case running time for any algorithm for the TSP increases superpolynomially (but no more than exponentially) with the number of cities.
