Solving the Travelings Sales Problem (TSP) is hard because it is an NP-Complex problem. But with a new algorithm it is made easy and fast. The algorithm does not give the right answer in all cases but it comes close.
Try it for your self.
You can use the examples, the TSP-lib, real world cities or you can make your own case.
With the Real World Cities option you can even use it for your own logistics.
Please report back if you found flaws in the results or if you have suggestions. Together we make the algorithm better.
Kind Regards,
Pieter Horchner