Salesman
An application testing the different solutions for the travelling salesman problem
Platforms: Windows, Mac, Linux
License: Freeware | Size: 37.34 KB | Download (49): the travelling salesman Download |
traveling-salesman is a GPS -route-planning and -navigation -system based on libosm and the OpenStreetMap.
Platforms: Windows, Mac, Linux
License: Freeware | Size: 7.35 MB | Download (51): Traveling Salesman Download |
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...
Platforms: Matlab
License: Freeware | Size: 512 KB | Download (49): Traveling Salesman Problem (TSP) using Simulated Annealing Download |
The user has to supply the fixed ending points before the script can be ran. Requirements: - MATLAB 7.6 or higher
Platforms: Windows, Mac, *nix, Matlab, BSD Solaris
License: Freeware | Download (62): Fixed Endpoints Open Traveling Salesman Problem - Genetic Algorithm 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).Each salesman starts at the...
Platforms: Windows, Mac, *nix, Matlab, BSD Solaris
License: Freeware | Download (53): Fixed Start Open Multiple Traveling Salesmen Problem - Genetic Algorithm Download |
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...
Platforms: Windows, Mac, *nix, Matlab, BSD Solaris
License: Freeware | Download (54): Fixed Endpoints Open Multiple Traveling Salesmen Problem - Genetic Algorithm Download |
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...
Platforms: Windows, Mac, *nix, Matlab, BSD Solaris
License: Freeware | Download (54): Fixed Start/End Point Multiple Traveling Salesmen Problem - Genetic Algorithm Download |
This method produces different results depending on what city is choosen as the starting point.This function determines the Nearest Neighbor routes for multiple starting points and returns the best of those routes. Requirements: - MATLAB 7.6 or higher
Platforms: Windows, Mac, *nix, Matlab, BSD Solaris
License: Freeware | Download (60): Traveling Salesman Problem - Nearest Neighbor Download |
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
Platforms: Windows, Mac, *nix, Matlab, BSD Solaris
License: Freeware | Download (49): Fixed Start Open Traveling Salesman Problem - Genetic Algorithm Download |
Simulated Annealing Optimization m-file The program set can be used to solve TRAVELING SALESMAN PROBLEMSfrom the TSPLIB.
Platforms: Matlab
License: Freeware | Size: 10 KB | Download (48): tspsa Download |
The user is presented with the near-optimal solution and performance chart in a dialog window.
Platforms: Matlab
License: Freeware | Size: 10 KB | Download (49): Traveling Salesman Problem - Genetic Algorithm Script Download |
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...
Platforms: Matlab
License: Freeware | Size: 10 KB | Download (40): Fixed Start/End Point Multiple Traveling Salesmen Problem - Genetic Algorithm Script Download |
The user has to supply the fixed ending points before the script can be ran.
Platforms: Matlab
License: Freeware | Size: 10 KB | Download (43): Fixed Endpoints Open Traveling Salesman Problem - Genetic Algorithm Script Download |
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...
Platforms: Matlab
License: Freeware | Size: 10 KB | Download (46): Multiple Variable Traveling Salesmen Problem - Genetic Algorithm Script 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).Each salesman starts at the...
Platforms: Matlab
License: Freeware | Size: 10 KB | Download (39): Fixed Start Open Multiple Traveling Salesmen Problem - Genetic Algorithm Script Download |
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...
Platforms: Matlab
License: Freeware | Size: 10 KB | Download (39): Fixed Endpoints Open Multiple Traveling Salesmen Problem - Genetic Algorithm Script Download |
The algorithm computes the optimal route from a fixed predetermined starting point to all other cities without returning to the starting point.
Platforms: Matlab
License: Freeware | Size: 10 KB | Download (45): Fixed Start Open Traveling Salesman Problem - Genetic Algorithm Script Download |
DKRouteFinder is a free Cocoa class that offers a practical solution to the Travelling Salesman Problem - efficiently finding an optimal route among a set of arbitrarily distributed objects.
Platforms: Mac
License: Freeware | Size: 10.24 KB | Download (41): DKRouteFinder Download |
JOpt.SDK is spatial route optimization and planning Java library for automatic resource scheduling and transportation planning. It uses specialized genetic algorithms to calculate an optimized allocation of orders and stops to mobile resources. The algorithm not only provides tours at minimum...
Platforms: Java
License: Freeware | Size: 102.4 KB | Download (56): JOpt.SDK - vehicle routing library Download |
JOpt.NET TourPlanner is an automated vehicle routing software and dispatching .NET component for logistic applications that can solve Traveling Salesman Problems (TSP) and Capacitated Vehicle Routing Problems with Time Windows (CVRPTW,VRPTW). JOpt.NET offers route and transport optimisation with...
Platforms: Windows
License: Freeware | Size: 3.91 MB | Download (56): JOpt.NET - Vehicle Routing Software Libr Download |