**Language:**Matlab**Platform:**Windows / Linux / Mac OS / BSD / Solaris**License:**BSD - BSD License**Databases:**N/A**Downloads:**4527**Released:**Jul 30, 2009

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.

**Requirements:**

· MATLAB 7.6 or higher

Hyperlink code:

Hyperlink for Forum code:

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!

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 **start**ing locations). Each salesman travels to a unique set ...

The script finds a (near) optimal **solution** to a variation of the "**open**" M-TSP by ... 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 **start**s at the first point, and ends at the ...

Finds a (near) optimal **solution** to a variation of the 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 individual cities and back to the original **start**ing place).Each salesman **start**s at the first point, and ...

The **algorithm** computes the optimal **route** from a **fixed** pre**determine**d **start**ing point to all other cities without returning to the **start**ing point. Requirements: · MATLAB 7.6 or higher ...

The difference to the classic TSP is that the salesman doesn't travel in loop across the circuit. Requirements: · MATLAB 7.6 or higher ...