| dc.rights.license | CC-BY-NC-ND | |
| dc.contributor.advisor | Rooij, J. van | |
| dc.contributor.advisor | Bodlaender, H. | |
| dc.contributor.author | Beimers, M.J. | |
| dc.date.accessioned | 2015-09-21T17:00:58Z | |
| dc.date.available | 2015-09-21T17:00:58Z | |
| dc.date.issued | 2015 | |
| dc.identifier.uri | https://studenttheses.uu.nl/handle/20.500.12932/24356 | |
| dc.description.abstract | The TSP and VRP are well known optimization problems. In this thesis we
evaluate the use of a dynamic programming algorithm on a tree decomposition
of a graph, with the goal to improve the solutions to these problems given by
several heuristics. The used heuristics are the LKH algorithm, the savings
algorithm and the sweep algorithm. | |
| dc.description.sponsorship | Utrecht University | |
| dc.format.extent | 288025 | |
| dc.format.mimetype | application/pdf | |
| dc.language.iso | en | |
| dc.title | Tour merging via tree decomposition | |
| dc.type.content | Master Thesis | |
| dc.rights.accessrights | Open Access | |
| dc.subject.keywords | tourmerging, treewidth, TSP, VRP, heuristics, DP | |
| dc.subject.courseuu | Computing Science | |
