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.
引用格式
Duc Chung Tran (2024). TSP.zip (https://www.mathworks.com/matlabcentral/fileexchange/46629-tsp-zip), MATLAB Central File Exchange. 检索来源 .
MATLAB 版本兼容性
创建方式
R2013a
兼容任何版本
平台兼容性
Windows macOS Linux类别
- 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 >
在 Help Center 和 MATLAB Answers 中查找有关 Nearest Neighbors 的更多信息
标签
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!TSP/
版本 | 已发布 | 发行说明 | |
---|---|---|---|
1.0.0.0 |