Google Maps Fun » A Practical Approach to the Traveling Salesman Problem

Below is a Google maps application that will attempt to find the shortest path between all points listed. It is currently in beta at the moment and will be updated as time goes on and I find issues. Right now, there are only two algorithms available, Brute Force and Nearest Neighbor. Other features are somewhat limited, but will (hopefully) be put in as I have time. If you have any questions, or comments, or find a bug, please shoot me off some information via my contact page. Comments can also be made via my blog. Enjoy!

TODO:

Brute force will always provide the best solution to the problem, but unfortunately due to the exploding nature of the problem does not provide a quick solution once the number of points reaches double digits. You are limited to a maximum of 8 points when using this algorithm.

Add
Points/Addresses
No addresses available.
Directions
No directions available.