Multiple traveling salesmen problem genetic algorithm in matlab

The following Matlab project contains the source code and Matlab examples used for multiple traveling salesmen problem genetic algorithm. 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 exactly once and return to their starting locations) Summary: 1.


Subscribe to RSS - Algorithm