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.
· MATLAB 7.6 or higher
Top 4 Download periodically updates information of Fixed Start Open Multiple Traveling Salesmen Problem - Genetic Algorithm script from the developer, but some information may be slightly out-of-date.
Our script download links are directly from our mirrors or publisher's website. Fixed Start Open Multiple Traveling Salesmen Problem - Genetic Algorithm torrent files or shared files from free file sharing and free upload services, including Rapidshare, MegaUpload, YouSendIt, MailBigFile, DropSend, HellShare, HotFile, FileServe, MediaMax, zUpload, MyOtherDrive, SendSpace, DepositFiles, Letitbit, LeapFile, DivShare or MediaFire, are not allowed!