Algorithm that solves the Multiple Travelling Salemsan Problem. This algorithm needs the starting position of every salesman.

MTSP_GA Multiple Traveling Salesmen Problem (M-TSP) Genetic Algorithm (GA) Finds a (near) optimal solution to the M-TSP by setting up a GA to search for the shortest route (least distance needed for the salesmen to travel to each city exactly o

遗传算法解TSP问题-多旅行商方案，增加了重量的限制-Genetic Algorithm for TSP problem- traveling salesman program

多旅行商的最短路径选择。80个城市，5个旅行商，距离矩阵部分采用最优算法(Shortest path selection for multiple traveling salesman problem)