tju-thj / an-access-to-mtsp-problem-based-on-lethal-gene- Goto Github PK

Author uses the GA algorithm to solve MTSP very skillfully. I notice that the author sets the condition of traversing at least one vertex for each traveling salesman, which prevents the degeneration of the MTSP problem into a TSP problem.However,when there are too many nodes in the graph,the result may not be satisfactory,because there's a possibility that one traveling salesman may travel to N-4 cities(N is the number of cities),while the other four salesmen only need to travel one,which is not fair for the one traveling N-4 cities.

So it would be great if there is an algorithm to make the result more "fair".