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:
Main Author: | |
---|---|
Other Authors: | |
Format: | Thesis-Master by Coursework |
Language: | English |
Published: |
Nanyang Technological University
2021
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/154401 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Language: | English |