旅行商问题，是图论问题中的经典问题，本例是实现该算法的典例-Solves the m-tsp with optimization. Used as part of the project to optimize vehicle

routes leading to fuel efficient solutions.



Change the coordinates array to modify the input coordinates.



INPUT :

coordinates in the form (x,y) of the list.

Number of Salesmen



OUTPUT:

Optimized total routes and workload distribution among the vehicles