Fixed Start 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 : 4
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 "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 without returning to the starting location).
Each salesman starts at the first point, but travels to a unique set of cities after that (and none of them close their loops by returning to their starting points).
Except for the first, each city is visited by exactly one salesman and so covering the whole area of cities.
Demands:
• MATLAB 7. 6 or higher

Fixed Start Open Multiple Traveling Salesmen Problem - Genetic Algorithm 1.0 scripting tags: salesman, unique, traveling salesman problem, starting, determine, determine route, optimum solution, cities. What is new in Fixed Start Open Multiple Traveling Salesmen Problem - Genetic Algorithm 1.0 software script? - Unable to find Fixed Start Open Multiple Traveling Salesmen Problem - Genetic Algorithm 1.0 news. What is improvements are expecting? Newly-made Fixed Start 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 Start Open Multiple Traveling Salesmen Problem - Genetic Algorithm. License limitations are unspecified.