Open 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 the salesmen to travel to each city exactly once without returning to their starting location).
Each salesman travels to a unique set of cities (although none of them close their loops by returning to their starting points).
Each city is visited by exactly one salesman.
This tool will provide the user with a graphic interface complete with generated graphs, the optimal solution and various charts.
Demands:
• MATLAB 7. 6 or higher

Open Multiple Traveling Salesmen Problem - Genetic Algorithm 1.0 scripting tags: genetic algorithm, determine optimum route, optimal, city, solution, starting, returning, traveling salesman problem. What is new in Open Multiple Traveling Salesmen Problem - Genetic Algorithm 1.0 software script? - Unable to find Open Multiple Traveling Salesmen Problem - Genetic Algorithm 1.0 news. What is improvements are expecting? Newly-made Open Multiple Traveling Salesmen Problem - Genetic Algorithm 1.1 will be downloaded from here. You may download directly. Please write the reviews of the Open Multiple Traveling Salesmen Problem - Genetic Algorithm. License limitations are unspecified.