McNaughton, Luke (2023) Clustered Travelling Salesman Problem. Bachelor's Thesis, Computing Science.
|
Text
TSP_Thesis-5.pdf Download (658kB) | Preview |
|
![[img]](https://fse.studenttheses.ub.rug.nl/style/images/fileicons/text.png) |
Text
toestemming.pdf Restricted to Registered users only Download (144kB) |
Abstract
The Travelling Salesman Problem is a categorically NP-Hard problem with many proposed solutions for Optimization. The use of Approximation is one such way of increasing the speed of the process at the cost of retrieving, at times, sub-optimal results. We want to see what the effects are with the introduction of Clustering to such a process. For this project, we would like to test what effect varying levels of Clusteredness according to multiple Clustering methods have on the Travelling Salesman Problem relative to its derivative, the Clustered Traveling Salesman Problem. We will see if the establishment of well-formed clusters has any particular effect on search performance.
| Item Type: | Thesis (Bachelor's Thesis) |
|---|---|
| Supervisor name: | Bunte, K. and Mohsen, F.F.M. |
| Degree programme: | Computing Science |
| Thesis type: | Bachelor's Thesis |
| Language: | English |
| Date Deposited: | 02 Aug 2023 11:54 |
| Last Modified: | 02 Aug 2023 11:54 |
| URI: | https://fse.studenttheses.ub.rug.nl/id/eprint/31059 |
Actions (login required)
 |
View Item |