Subscribe to our newsletter:


  • Utilities
  • Games
  • Puzzle
  • Trivia
I want this app
Download from AppStore

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 exactly once and returns to the origin city? It is an NP-hard problem in combinatorial optimization, important in operations research and theoretical computer science.
This app use a new evolutionary algorithm-3M.Its calculation speed is faster than GA and ACO. Coordinate with 2opt, you can get the accurate result of 100 cities within 2 second. It is a very good reference tool for the study of TSP.