There is software like concorde that solves traveling salesman problems really fast and optimal: http://www.math.uwaterloo.ca/tsp/methods/opt/opt.htm http://www

There is software like concorde that solves traveling salesman problems really fast and optimal: http://www.math.uwaterloo.ca/tsp/methods/opt/opt.htm http://www.math.uwaterloo.ca/tsp/methods/opt/opt.htm Still these type of problems are much trickier in practise, e.g. with time windows or even with multiple salesmen (then it is a vehicle routing problem). For these problems still specialized software exists like jsprit (shameless plug!) and others: https://github.com/graphhopper/jsprit/blob/master/docs/Other-Projects.md https://github.com/graphhopper/jsprit/blob/master/docs/Other...