Freeware Listing: Salesman
- Open Traveling Salesman Problem - Genetic Algorithm Script
- License: Freeware

The difference to the classic TSP is that the salesman doesn't travel in loop across the circuit..
- Publisher: Joseph Kirk
- Date: 26-04-2013
- Size: 10 KB
- Platform: Matlab, Scripts
- Travelling Salesman problem in the city
- License: Freeware

Let's imagine for an example such situation. You are engaged in delivery of small goods in the city.You need to optimize a route of the courier (traveling salesman or vehicle) to go round some customers in different places of city and to return to a point of departure.There can be such situation.You need to go round, we shall admit, 16 customers. One vehicle can to not have time to make it. It is necessary to make the plan of use of several vehicles, having optimized, both the general route, and a route of each vehicle. Version 1.1.0.0 - Algorithm enhancements.
- Publisher: shobb@narod.ru
- Date: 26-09-2012
- Size: 460 KB
- Platform: WinOther
- Smiling Salesman
- License: Freeware

Smiling Salesman is a commerce management system written in Perl.
- Publisher: ssalesman.sourceforge.net
- Date: 12-05-2012
- Size: 8 KB
- Platform: Linux, Unix, WinOther
- the travelling salesman
- License: Freeware

An application testing the different solutions for the travelling salesman problem.
- Publisher: jcconvenant.sourceforge.net
- Date: 25-09-2012
- Size: 37 KB
- Platform: Linux, Mac OS X, WinOther
- Traveling Salesman
- License: Freeware

traveling-salesman is a GPS -route-planning and -navigation -system based on libosm and the OpenStreetMap..
- Publisher: travelingsales.sourceforge.net
- Date: 27-07-2012
- Size: 7531 KB
- Platform: Linux, Mac OS X, WinOther
- Traveling Salesman Problem (TSP) using Simulated Annealing
- License: Freeware

simulatedannealing() is an optimization routine for traveling salesman problem. Any dataset from the TSPLIB can be suitably modified and can be used with this routine. A detailed description about the function is included in "Simulated_Annealing_Support_Document.pdf." A GUI is used with the core function to visualize and to vary annealing parameters. Four sample data set from TSPLIB is provided. You can create your own data set by following a simple procedure given in the supporting document. You can access the TSPLIB by following this link http://www.iwr.uni-heidelberg.de/groups/co...tware/TSPLIB95/ Feel free to drop in your comments, suggestions, bugs and mistakes in the algorithm.
- Publisher: Aravind Seshadri
- Date: 21-03-2013
- Size: 512 KB
- Platform: Matlab, Scripts
- tspsa
- License: Freeware

Simulated Annealing Optimization m-file The program set can be used to solve TRAVELING SALESMAN PROBLEMS from the TSPLIB..
- Publisher: Jericho A. Corpus
- Date: 01-04-2013
- Size: 10 KB
- Platform: Matlab, Scripts
- Fixed Start/End Point Multiple Traveling Salesmen Problem - Genetic Algorithm Script
- License: Freeware

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.
- Publisher: Joseph Kirk
- Date: 19-04-2013
- Size: 10 KB
- Platform: Matlab, Scripts
- Multiple Variable Traveling Salesmen Problem - Genetic Algorithm Script
- License: Freeware

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..
- Publisher: Joseph Kirk
- Date: 27-02-2013
- Size: 10 KB
- Platform: Matlab, Scripts
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..
- Publisher: Joseph Kirk
- Date: 25-03-2013
- Size: 10 KB
- Platform: Matlab, Scripts
- Fixed Endpoints Open Multiple Traveling Salesmen Problem - Genetic Algorithm Script
- License: Freeware

The script 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 and finally to the end location). Each salesman starts at the first point, and ends at the last point, but travels to a unique set of cities in between (none of them close their loops by returning to their starting points). Each city is visited by exactly one salesman, except for the first and last..
- Publisher: Joseph Kirk
- Date: 16-03-2013
- Size: 10 KB
- Platform: Matlab, Scripts
- Multiple Traveling Salesmen Problem - Genetic Algorithm Script
- License: Freeware

The script needs starting locations for every salesman taken into account in the algorithm. It will find a (near) optimal solution to 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 and return to their starting locations)..
- Publisher: Joseph Kirk
- Date: 09-06-2013
- Size: 10 KB
- Platform: Matlab, Scripts
- Simulated Annealing Demonstration
- License: Freeware

This is a Java application that demonstrates the Simulated Annealing algorithm with an attack on the "traveling salesman" problem. What is simulated annealing? Simulated annealing is a technique, which was developed to help solve large combinatorial optimization problems. It is based on probabilistic methods that avoid being stuck at local (non-global) minima. It has proven to be a simple but powerful method for large-scale combinatorial optimization. For practical purposes, simulated annealing has solved the famous traveling salesman problem: find the shortest of N! paths connecting N cities.
- Publisher: Abecedarical Systems
- Date: 12-01-2000
- Size: 11 KB
- Platform: Not Applicable
- The Travelling Salesman Problem using GA
- License: Freeware

Solution for the Travelling Salesman Problem using genetic algorithm. Speed, particularly at large data volumes, is of essence. The project uses advanced variants of cross-over and mutation algorithms in order to expedite search in the solution space.
The Travelling Salesman Problem using GA License - Common Public License 1.0.
- Publisher: Ga-tsp
- Date:
- Platform: WinOther
- OsmSharp
- License: Freeware

OsmSharp - OpenStreetMap (OSM) Library and Tools. Focus is on routing and solving complex transportation problems. Working code for solving instances of the travelling salesman and the multiple travelling salesman problem..
- Publisher: 14k.be
- Date: 26-05-2012
- Size: 1430 KB
- Platform: Linux, WinOther
- Sales Portal
- License: Freeware

Web Sales tool for Businesses and Salesman who do not want or need a traditional CRM package.Manage prospects and customers throughout the sales cycle from your desktop,laptop,or mobile phone. Easy to use & install.Java,Tomcat,Ubuntu.Sept 2010.
- Publisher: randrinc.com
- Date: 11-10-2012
- Size: 49939 KB
- Platform: Linux, Unix
- TSPEnryGA
- License: Freeware

Genetic Algorithm based software to resolve the Traveling Salesman Problem (Problema del Commesso Viaggiatore)..
- Publisher: tspenryga.sourceforge.net
- Date: 24-07-2012
- Size: 1106 KB
- Platform: WinOther
- Traveling Salesman Problem - Genetic Algorithm Script
- License: Freeware

The user is presented with the near-optimal solution and performance chart in a dialog window..
- Publisher: Joseph Kirk
- Date: 13-02-2013
- Size: 10 KB
- Platform: Matlab, Scripts
The user has to supply the fixed ending points before the script can be ran..
- Publisher: Joseph Kirk
- Date: 25-05-2013
- Size: 10 KB
- Platform: Matlab, Scripts
- Open Multiple Traveling Salesmen Problem - Genetic Algorithm Script
- License: Freeware

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). Each salesman travels to a unique set of cities (although none of them close their loops by returning to their starting points). Each city is visited by exactly one salesman. This tool will provide the user with a graphic interface complete with generated graphs, the optimal solution and various charts..
- Publisher: Joseph Kirk
- Date: 12-03-2013
- Size: 10 KB
- Platform: Matlab, Scripts
Salesman: Freeware | All













