Multiple Variable Traveling Salesmen Pro

Category: Python - Image Viewers

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. Requirements: MATLAB 7.6 or higher Date: 23 January, 2012


Traveling Salesman Problem - Determine Route - Generic Algorithm - Determine - Solution - Route

Homepage: http://www.mathworks.com/

Developer: mathworks.com

License: Freeware

Operating System: All

Add a Comment

all are required fields

     
What do you think of this resource?

Select Your Rate:

Votes:0

 

Related Scripts Download

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

developer Developer: mathworks.com
license License: Freeware
operating systems Operating System: All


The user is presented with the near-optimal solution and performance chart in a dialog window.

developer Developer: mathworks.com
license License: Freeware
operating systems Operating System: All


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

developer Developer: mathworks.com
license License: Freeware
operating systems Operating System: All


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 the salesmen to travel to each city exactly once without returning to their starting location).

developer Developer: mathworks.com
license License: Freeware
operating systems Operating System: All


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

developer Developer: mathworks.com
license License: Freeware
operating systems Operating System: All


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

developer Developer: mathworks.com
license License: Freeware
operating systems Operating System: All


The user has to supply the fixed ending points before the script can be ran.

developer Developer: mathworks.com
license License: Freeware
operating systems Operating System: All


This script raises an error when trying to set an undeclared name.

developer Developer: code.activestate.com
license License: Freeware
operating systems Operating System: All


This script allows you to record the order in which items are added.

developer Developer: code.activestate.com
license License: Freeware
operating systems Operating System: All