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: | |
---|---|
Other Authors: | |
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 |
Be the first to leave a comment!