Solving the Min-Max Clustered Traveling Salesmen Problem Based on Genetic Algorithm
The min-max clustered traveling salesmen problem Food Grater (MMCTSP) is a generalized variant of the classical traveling salesman problem (TSP).In this problem, the vertices of the graph are partitioned into a given number of clusters and we are asked to find a collection of tours to visit all the vertices with the constraint that the vertices of