Map‐matching algorithm applied to bicycle global positioning system traces in Bologna

Abstract

A novel map-matching algorithm is proposed, implemented and applied to global positioning system (GPS) traces which have been recorded by cyclists in Bologna, a medium-sized city in the North of Italy. The algorithm has been developed to match geo-referenced traces to a sequence of edges of a given road network model. Map-matching for bike trips is particularly challenging as cyclists often use footpath or parks which are not necessarily represented by the road network model. The matching algorithm should smartly tolerate the lack of network information. The algorithm should also be fast and capable of processing thousands of GPS traces in a reasonable time. The proposed probability-based method, which also exploits information on various network attributes, allows a reliable and fast map matching, even in dense street networks and with interrupted GPS data streams. In fact, one serious issue is to find a reliability measure which allows to verify the matched routes, without the knowledge of the real routes, as the available cyclist traces are anonymous. In addition to the reliability check, a sensitivity analyses with respect to the most relevant parameters has been conducted. The advantages of the proposed map-matching algorithm are quantified through a direct comparison with a topology-based map-matching algorithm from literature.