A fast and compact algorithm for large-scale TSP optimization
This project proposes a fast and compact algorithms for solving large-scale TSP problems. It is based on three stages: Separation, Solution for small TSP, Fusion. The result shows that compared to the traditional heuristic algorithms, the new algorithm can reach a good balance between the time-cost...
Saved in:
主要作者: | |
---|---|
其他作者: | |
格式: | Thesis-Master by Coursework |
語言: | English |
出版: |
Nanyang Technological University
2022
|
主題: | |
在線閱讀: | https://hdl.handle.net/10356/161462 |
標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|