Solution for The Travelling Salesman Problem:
- A salesman has to visit a number of cities in a single closed tour.
- He always starts and ends the tour in his home city.
- He has to visit each other city on the tour exactly once.
-> The solution attempts to minimize the overall travelling distance.
Cite As
Duc Chung Tran (2024). TSP.zip (https://www.mathworks.com/matlabcentral/fileexchange/46629-tsp-zip), MATLAB Central File Exchange. Retrieved .
MATLAB Release Compatibility
Created with
R2013a
Compatible with any release
Platform Compatibility
Windows macOS LinuxCategories
- AI, Data Science, and Statistics > Statistics and Machine Learning Toolbox > Cluster Analysis and Anomaly Detection > Nearest Neighbors >
- MATLAB > Mathematics > Graph and Network Algorithms > Shortest Path > Traveling Salesman (TSP) >
- Mathematics and Optimization > Optimization Toolbox > Linear Programming and Mixed-Integer Linear Programming > Problem-Based Linear Programming >
Find more on Nearest Neighbors in Help Center and MATLAB Answers
Tags
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.
TSP/
Version | Published | Release Notes | |
---|---|---|---|
1.0.0.0 |