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

The algorithm computes the optimal route from a fixed predetermined starting point to all other cities without returning to the starting point.

**Requirements:**

· MATLAB 7.6 or higher

Hyperlink code:

Hyperlink for Forum code:

Top 4 Download periodically updates information of **Fixed Start Open Traveling Salesman 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 Traveling Salesman 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!

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

The script finds a (near) optimal **solution** to a variation of the "**open**" M-**TSP** by ... 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 ... them close their loops by returning to their **start**ing points).Each city is visited by exactly one **salesman**, ...

Finds a (near) optimal **solution** to a variation of the "**open**" M-**TSP** by ... the shortest route (least distance needed for each **salesman** to travel from the **start** location to unique individual cities without returning to the **start**ing location).Each **salesman start**s at the first point, but travels to a ... them close their loops by returning to their **start**ing points).Except for the first, each city is visited ...

Finds a (near) optimal **solution** to a variation of the M-**TSP** by setting ... 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 ends at the ... first, each city is visited by exactly one **salesman**.This tool provides a graphic user **interface** in which ...

It finds a (near) optimal **solution** to a variation of the M-**TSP** (that has ... each city exactly once and return to their **start**ing locations). Each **salesman** travels to a unique set of cities and ... the route by returning to the city he **start**ed from In this script, each city is visited ...