Fixed Endpoints Open Multiple Traveling Salesmen Problem - Genetic Algorithm Script 1.1

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.

Requirements:	No special requirements
Platforms:	Matlab
Keyword:	Cities,  Close,  Finds,  Loops,  Optimal,  Point,  Pointseach,  Returning,  Salesman,  Solution,  Starting,  Starts,  Travels,  Unique,  Visited
Users rating:	0/10