It finds a (near) optimal solution to a variation of the M-TSP (that has a variable number of salesmen) by setting up a GA to search for the shortest route (least distance needed for the salesmen to travel to each city exactly once and return to their starting locations).
Each salesman travels to a unique set of cities and completes the
route by returning to the city he started from
In this script, each city is visited by exactly one salesman.
· MATLAB 7.6 or higher
Top 4 Download periodically updates information of Multiple Variable 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. Multiple Variable 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!