Traveling salesperson problem using Python
A well-known optimization issue in operations research, mathematics, and computer science is the Traveling Salesman Problem (TSP). It entails determining the quickest path a salesman can take to travel to a series of cities, stop in each one exactly once, and then return to the beginning locat...
Saved in:
| 主要作者: | |
|---|---|
| 其他作者: | |
| 格式: | Final Year Project |
| 語言: | English |
| 出版: |
Nanyang Technological University
2023
|
| 主題: | |
| 在線閱讀: | https://hdl.handle.net/10356/167015 |
| 標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|