I have a list of 1000 cities around the globe, and want to find a short route that covers them all.

Is there an implementation of this in Java?


  • Open source
  • Easy to use: just call a method with as a parameter the list of cities. (Internally the library can use fancy things like AI or generic algorithms but it must be hidden)
  • Works on a sphere. Most Travelling Salesman algorithms are designed for flat worlds (small areas where Earth curvature is negligible).

Apparently Mathematica embeds a non-open-source method for this, but I need open source.

enter image description here

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Browse other questions tagged or ask your own question.