Simulated Annealing for Travelling Salesman Problem
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 (2024). Simulated Annealing for Travelling Salesman Problem (https://www.mathworks.com/matlabcentral/fileexchange/74017-simulated-annealing-for-travelling-salesman-problem), MATLAB Central File Exchange. Retrieved .
MATLAB Release Compatibility
Platform Compatibility
Windows macOS LinuxCategories
- Mathematics and Optimization > Global Optimization Toolbox > Particle Swarm >
- AI and Statistics > Statistics and Machine Learning Toolbox > Cluster Analysis and Anomaly Detection > Nearest Neighbors >
- Mathematics and Optimization > Optimization Toolbox > Solver-Based Optimization Problem Setup >
Tags
Acknowledgements
Inspired by: Real-coded Simulated Annealing, Hill Climbing Algorithm: A Simple Implementation
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!Discover Live Editor
Create scripts with code, output, and formatted text in a single executable document.