Show simple item record

dc.rights.licenseCC-BY-NC-ND
dc.contributor.advisorBisseling, R.H.
dc.contributor.advisorLeeuwen, E.J. van
dc.contributor.authorBreed, M.
dc.date.accessioned2021-08-27T18:00:13Z
dc.date.available2021-08-27T18:00:13Z
dc.date.issued2021
dc.identifier.urihttps://studenttheses.uu.nl/handle/20.500.12932/41294
dc.description.abstractCurrent state-of-the-art shortest path algorithms can compute shortest paths on continental-sized graphs within a couple of milliseconds. Customizable Route Planning (CRP) is one such algorithm and distinguishes itself from other algorithms by being robust to metric changes and by being able to incorporate new metrics quickly. CRP uses three stages: two separate preprocessing stages and a query stage. In this research project, we focus on the query stage, in which shortest paths are computed using a multilevel Dijkstra search. Our goal is to find a distributed memory approach to this stage of CRP, such that scalability is improved. We treat three different approaches and investigate their implications for scalability, performance and total amount of used resources.
dc.description.sponsorshipUtrecht University
dc.format.extent5500614
dc.format.mimetypeapplication/pdf
dc.language.isoen
dc.titleScalability of Customizable Route Planning
dc.type.contentMaster Thesis
dc.rights.accessrightsOpen Access
dc.subject.courseuuMathematical Sciences


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record