Fixed start end point multiple traveling salesmen problem genetic algorithm in matlab

The following Matlab project contains the source code and Matlab examples used for fixed start end point multiple traveling salesmen problem genetic algorithm. MTSPF_GA Fixed Multiple Traveling Salesmen Problem (M-TSP) Genetic Algorithm (GA)   Finds a (near) optimal solution to a variation of the 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 individual cities   and back to the original starting place) Summary: 1.

The source code and files included in this project are listed in the project files section, please make sure whether the listed source code meet your needs there.

Project Files: 

File NameSize
license.txt 1501
mtspf_ga.m 14650