Personalised routing algorithm: modelling "familiarity" in proposing A to B routes
dc.contributor.advisor
Mackaness, William
en
dc.contributor.author
van Haeren, Maud Sophie Madeleine
en
dc.date.accessioned
2015-05-06T13:58:12Z
dc.date.available
2015-05-06T13:58:12Z
dc.date.issued
2014
dc.description.abstract
This research paper addresses the question why the preferred route pedestrians take to get from A to B is not necessarily the shortest route. The assumption is tested that the concept of familiarity affects route choice decisions. The research aims to create a quantitative measure for familiarity, and incorporate this with Dijkstra’s Shortest Path algorithm efficiently.
A Familiarity Index is built, using personal GPS trajectories of ten participants. The results show that on average people are willing to walk 15% longer to walk through familiar space, as opposed to walking the shortest route in distance. They also show that people do not do what they say they would do. Quantitative shape comparison measures, such as the Discrete Fréchet Distance, were used to explore the differences between routes in more depth. Participants were asked to draw on paper maps the routes they would take from origin to destination, as a method of validation for the use of the Familiarity Index as a prediction for route choice. The research concludes that it is possible to quantify and implement familiarity as an edge weight and that a simulation on the basis of this concept is accurate to a certain extent.
en
dc.identifier.uri
http://hdl.handle.net/1842/10361
dc.language.iso
en
dc.publisher
The University of Edinburgh
en
dc.subject
Familiarity
en
dc.subject
Pedestrian Wayfinding
en
dc.subject
Navigation
en
dc.subject
Environment
en
dc.subject
Familiarity
en
dc.subject
Pedestrian Wayfinding
en
dc.subject
Navigation
en
dc.subject
Environment
en
dc.subject
MSc Geographical Information Science
en
dc.subject
GIS
en
dc.title
Personalised routing algorithm: modelling "familiarity" in proposing A to B routes
en
dc.title.alternative
A personalised routing algorithm: modelling "familiarity" in proposing A to B routes
en
dc.type
Thesis or Dissertation
en
dc.type.qualificationlevel
Masters
en
dc.type.qualificationname
MSc Master of Science
en
dcterms.accessRights
RESTRICTED ACCESS
en
Files
This item appears in the following Collection(s)

