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

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 starting place).

Each salesman starts at the first point, and ends at the first point, but travels to a unique set of cities in between.

Except for the first, each city is visited by exactly one salesman.

This tool provides a graphic user interface in which the user is presented with detailed graphs and charts about the solution.

This tool provides a graphic user interface in which the user is presented with detailed graphs and charts about the solution.

**Requirements:**

· MATLAB 7.6 or higher

Hyperlink code:

Hyperlink for Forum code:

Top 4 Download periodically updates information of **Fixed Start/End Point 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/End Point 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!

... 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 last **point**, but travels to a unique set of cities ...

... 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 of cities and completes the **route** by returning to the city he **start**ed from ...

... 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 **start**ing location).Each salesman **start**s at the first **point**, but travels to a unique set of cities ... them close their loops by returning to their **start**ing **point**s).Except for the first, each city is visited ...

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 ...