Traveling Salesman Problem (TSP) using Simulated Annealing

Version 1.0.0.0 (491 KB) by Aravind Seshadri
A GUI for sovling TSP's using Simulated Annealing
4.0
(20)
17.8K Downloads
Updated 23 Mar 2006

View License

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.

Cite As

Aravind Seshadri (2024). Traveling Salesman Problem (TSP) using Simulated Annealing (https://www.mathworks.com/matlabcentral/fileexchange/9612-traveling-salesman-problem-tsp-using-simulated-annealing), MATLAB Central File Exchange. Retrieved .

MATLAB Release Compatibility
Created with R14SP3
Compatible with any release
Platform Compatibility
Windows macOS Linux
Tags Add Tags
Acknowledgements

Inspired: TSP2024

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!

SA_TSP/

Version Published Release Notes
1.0.0.0

1. Added a few more benchmark problems.
2. Added support for running GUI for users with MATLAB version 6.1 or higher. A single m file which replaces the fig and m file combination can be used. Use stsp_v61_export.m