Memetic framework with adaptive meme pool for the travelling salesman problem
The Travelling Salesman Problem (TSP) is a well-known combinatorial optimization problem. As the number of cities increases, traditional algorithms become less effective in finding the optimal solution in the vast search space of TSP, and it is also difficult to achieve good sub-optimal solutions....
Saved in:
Main Author: | Zeng, Yuntao |
---|---|
Other Authors: | Meng-Hiot Lim |
Format: | Thesis-Master by Coursework |
Language: | English |
Published: |
Nanyang Technological University
2023
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/164088 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Language: | English |
Similar Items
-
An optimization framework of K-means clustering and metaheuristic for traveling salesman problem
by: Wang, Benquan
Published: (2021) -
A study on probabilistic memetic algorithm and meme-centric framework
by: Liang, Feng
Published: (2014) -
A probabilistic memetic framework
by: Nguyen, Quang Huy, et al.
Published: (2010) -
Adaptive and formal memetic frameworks.
by: Nguyen, Quang Huy.
Published: (2011) -
Meme-based computational optimization framework
by: Dwiyasa, Felis, et al.
Published: (2020)