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: | Wang, Benquan |
---|---|
Other Authors: | Meng-Hiot Lim |
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 |
Similar Items
-
Memetic framework with adaptive meme pool for the travelling salesman problem
by: Zeng, Yuntao
Published: (2023) -
Efficient graph neural networks for travelling salesman problem using multilevel clustering
by: Dwivedee, Lakshyajeet
Published: (2021) -
Comparison of metaheuristic optimization algorithms for solving constrained mechanical design optimization problems
by: Gupta, Shubham, et al.
Published: (2022) -
Optimization of traveling salesman problem with Google app engine project report
by: Lin, Runhui.
Published: (2011) -
Comparative analysis of solving traveling salesman problem using artificial intelligence algorithms
by: Brucal, Stanley Glenn E., et al.
Published: (2017)