Traveling Salesman Problem (TSP) using Simulated Annealing

A GUI for sovling TSP's using Simulated Annealing

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/comopt/software/TSPLIB95/

Feel free to drop in your comments, suggestions, bugs and mistakes in the algorithm.

Note: Simulated Annealing is a memory intensive and processor intensive algorithm. A big data set may take hours depending on your computer configuration.