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....
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Thesis-Master by Coursework |
| Language: | English |
| Published: |
Nanyang Technological University
2023
|
| Subjects: | |
| Online Access: | https://hdl.handle.net/10356/164088 |