Fixed Endpoints 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 : 1
Program licensing
Thank you for voting...

The script finds a (near) optimal solution to a ...

The script 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).
Each salesman starts at the first point, and ends at the last point, but travels to a unique set of cities in between (none of them close their loops by returning to their starting points).
Each city is visited by exactly one salesman, except for the first and last.
Demands:
• MATLAB 7. 6 or higher

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