An optimization framework of K-means clustering and metaheuristic for traveling salesman problem

In this dissertation, we first studied the optimization framework of K-means clustering genetic algorithm. By comparing with traditional genetic algorithm, we verified that the optimization framework can effectively save computing time when solving large-scale traveling salesman problems and the fin...

全面介紹

Saved in:
書目詳細資料
主要作者: Wang, Benquan
其他作者: Meng-Hiot Lim
格式: Thesis-Master by Coursework
語言:English
出版: Nanyang Technological University 2021
主題:
在線閱讀:https://hdl.handle.net/10356/154401
標簽: 添加標簽
沒有標簽, 成為第一個標記此記錄!
機構: Nanyang Technological University
語言: English

相似書籍