The following Matlab project contains the source code and Matlab examples used for fixed endpoints open multiple traveling salesmen problem genetic algorithm.
MTSPOF_GA Fixed Open Multiple Traveling Salesmen Problem (M-TSP) Genetic Algorithm (GA)
Finds a (near) optimal solution to a variation of the "open" M-TSP by
setting up a GA to search for the shortest route (least distance needed
for each salesman to travel from the start location to unique
individual cities and finally to the end location)