Simulated Annealing for Travelling Salesman Problem
The simplest implementation of Simulated Annealing for solving Travelling Salesman Problem
You are now following this Submission
- You will see updates in your followed content feed
- You may receive emails, depending on your communication preferences
This submission includes the implement the Simulated Annealing algorithm for solving the Travelling Salesman Problem. There are four graphs with different numbers of cities to test the Simulated Annealing.
For more algorithm, visit my website: www.alimirjalili.com
You can enrol to the online course about this submission here: https://www.udemy.com/course/hill-climbing-and-simulated-annealing-ai-algorithms/?referralCode=F917866C6F40A1E76840
Cite As
Seyedali Mirjalili (2026). Simulated Annealing for Travelling Salesman Problem (https://se.mathworks.com/matlabcentral/fileexchange/74017-simulated-annealing-for-travelling-salesman-problem), MATLAB Central File Exchange. Retrieved .
Acknowledgements
Inspired by: Real-coded Simulated Annealing, Hill Climbing Algorithm: A Simple Implementation
General Information
- Version 1.0.2 (4.65 KB)
MATLAB Release Compatibility
- Compatible with any release
Platform Compatibility
- Windows
- macOS
- Linux
