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:
Main Author: | Xu, Yihan |
---|---|
Other Authors: | Meng-Hiot Lim |
Format: | Thesis-Master by Coursework |
Language: | English |
Published: |
Nanyang Technological University
2022
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/161462 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Language: | English |
Similar Items
-
Large scale optimization for resource planning
by: Ajeet Singh
Published: (2021) -
Particle swarm optimization-based algorithms for TSP and generalized TSP
by: Shi, X.H., et al.
Published: (2014) -
Parallel memetic algorithms for solving large scale combinatorial optimization problems
by: Tang, Jing
Published: (2008) -
Large-scale portfolio optimization using multiobjective evolutionary algorithms and preselection methods
by: Qu, B. Y., et al.
Published: (2018) -
Compact and fast machine learning accelerator for IoT devices
by: Huang, Hantao
Published: (2018)