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

The difference to the classic TSP is that the salesman doesn't travel in loop across the circuit.

**Requirements:**

· MATLAB 7.6 or higher

Hyperlink code:

Hyperlink for Forum code:

Top 4 Download periodically updates information of **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.
**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 **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 ...

... 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 ... starting points).Each city is visited by exactly one **salesman**, except for the first and last. Requirements: ...

... once and return to their starting locations). Each **salesman** travels to a unique set of cities and ... script, each city is visited by exactly one **salesman**. Requirements: · MATLAB 7.6 or higher ...

... 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 ... first, each city is visited by exactly one **salesman** and so covering the whole area of cities. ...

... the shortest route (least distance needed for each **salesman** to travel from the start location to individual cities and back to the original starting place).Each **salesman** starts at the first point, and ends at ... first, each city is visited by exactly one **salesman**.This tool provides a graphic user **interface** in which ...