Memetic framework with adaptive meme pool for the travelling salesman problem
The Travelling Salesman Problem (TSP) is a well-known combinatorial optimization problem. As the number of cities increases, traditional algorithms become less effective in finding the optimal solution in the vast search space of TSP, and it is also difficult to achieve good sub-optimal solutions....
Saved in:
| 主要作者: | |
|---|---|
| 其他作者: | |
| 格式: | Thesis-Master by Coursework |
| 語言: | English |
| 出版: |
Nanyang Technological University
2023
|
| 主題: | |
| 在線閱讀: | https://hdl.handle.net/10356/164088 |
| 標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|