Traveling Sprinkler

traveling-salesman is a GPS -route-planning and -navigation -system based on libosm and the OpenStreetMap.

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

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

The script can display how the route rearranges at each script iteration.The input for the program is an Nx2 cities array sorted in the initial traveling path.The output is the cities arranged in a more effective route, index vector of the order the cities should be visited & the total rout length.


Platforms: Matlab

Spacejunk is a computer game about traveling in 2D planetary systems. The player must collect drifting garbage by navigating through the gravitational fields of planets and stars. A rough editor for planetary systems is provided too.


Platforms: *nix

Free SMTP Server is a SMTP server program for Windows that lets you send email messages directly from your computer. It's very simple but very useful for laptop users traveling around the world and connecting their PCs to different Internet Service Providers in different countries. You can use it...


Platforms: Windows, Windows 7