旅行商问题（TravelingSalesmanProblem，TSP）是经典的组合优化问题，而一些实际应用问题不能归纳为经典TSP，其中涉及到多个（项）任务的分派与优化，问题演变为多（人）旅行商问题（multipleTravelingSalesmanProblem，mTSP）-The traveling salesman problem (TravelingSalesmanProblem TSP) is a classic combinatorial optimization problem,

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 exa

基于遗传算法的多旅行商问题，其中有5种情况，均有代码(Multiple travel quotient problem based on genetic algorithm)

5 kinds of genetic algorithms to solve multiple traveling salesman problem (mtsp) matlab program 5, respectively, the following situations: 1. Back to the starting point a different starting point (TSP fixed amount) 2. Back to the starting point a di