Fixed Start/End Point Multiple Traveling Salesmen Problem - Genetic Algorithm 1.0

Operating systemsOS : Windows / Linux / Mac OS / BSD / Solaris
Program licensingScript Licensing : BSD - BSD License
CreatedCreated : Jul 30, 2009
Size downloadDownloads : 11
Program licensing
Thank you for voting...

Finds a (near) optimal solution to a variation of the ...

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).
Each salesman starts at the first point, and ends at the first point, but travels to a unique set of cities in between.
Except for the first, each city is visited by exactly one salesman.
This tool provides a graphic user interface in which the user is presented with detailed graphs and charts about the solution.
This tool provides a graphic user interface in which the user is presented with detailed graphs and charts about the solution.

Demands:
• MATLAB 7. 6 or higher

Fixed Start/End Point Multiple Traveling Salesmen Problem - Genetic Algorithm 1.0 scripting tags: cities, interface, traveling salesman problem, determine route, mtsp, user, genetic algorithm, presented. What is new in Fixed Start/End Point Multiple Traveling Salesmen Problem - Genetic Algorithm 1.0 software script? - Unable to find Fixed Start/End Point Multiple Traveling Salesmen Problem - Genetic Algorithm 1.0 news. What is improvements are expecting? Newly-made Fixed Start/End Point Multiple Traveling Salesmen Problem - Genetic Algorithm 1.1 will be downloaded from here. You may download directly. Please write the reviews of the Fixed Start/End Point Multiple Traveling Salesmen Problem - Genetic Algorithm. License limitations are unspecified.