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:
主要作者: | Xu, Yihan |
---|---|
其他作者: | Meng-Hiot Lim |
格式: | Thesis-Master by Coursework |
語言: | English |
出版: |
Nanyang Technological University
2022
|
主題: | |
在線閱讀: | https://hdl.handle.net/10356/161462 |
標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
機構: | Nanyang Technological University |
語言: | English |
相似書籍
-
Large scale optimization for resource planning
由: Ajeet Singh
出版: (2021) -
Parallel memetic algorithms for solving large scale combinatorial optimization problems
由: Tang, Jing
出版: (2008) -
Particle swarm optimization-based algorithms for TSP and generalized TSP
由: Shi, X.H., et al.
出版: (2014) -
Compact and fast machine learning accelerator for IoT devices
由: Huang, Hantao
出版: (2018) -
Large-scale portfolio optimization using multiobjective evolutionary algorithms and preselection methods
由: Qu, B. Y., et al.
出版: (2018)