Traveling

traveling-salesman is a GPS -route-planning and -navigation -system based on libosm and the OpenStreetMap. Platforms: Windows, Mac, Linux

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

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

The Simulated Annealing Method for the Traveling Salesman Model demonstrates the use of the "simulated annealing algorithm" to attempt to solve the "travelling salesman" problem. A text file containing longitude and latitude data for 120 cities in the US and southern Canada is loaded when this... Platforms: Mac

Send e-mail messages easily and securely from your portable PC while you are traveling around the world! Every time you change your location connecting your PC to different Internet Service Providers (ISPs), you must reconfigure your e-mail program to be able to send messages via different SMTP... Platforms: Windows

Transport Icons for Vista is a set of first-grade icons dedicated to traveling, the globe and different types of vehicles. In this collection, you will find plenty of fine icons related to tourism, as well as icons for all sorts of transport, including big and small cars, bikes, buses, trucks,... Platforms: OS/2, Windows, Mac, *nix, Windows CE, Pocket PC, Other,Android,BlackBerry,iPhone,iPod,iTouch,Palm,Palm OS 6.0,Handheld/Mobile Other,Java

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

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: Windows, Mac, *nix, Matlab, BSD Solaris

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

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

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

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

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

Simulated Annealing Optimization m-file The program set can be used to solve TRAVELING SALESMAN PROBLEMSfrom the TSPLIB. Platforms: Matlab

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

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

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

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

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

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