Map Matching by Optimization
2015 (English)Report (Other academic)
The problem of map matching appears when evaluating GPS-tracks recorded by service vehicles, and utilizing GPS-information in graphs suitable for route optimization. The task is to associate sequences of GPS-points to links in a graph, suitable for optimization, and thereby obtain paths or tours in the graph. Difficulties are errors in the GPS-coordinates and possible lack of GPS-points on short street segments. We apply mathematical modeling to the problem, in the form of integer programming, and do computational tests of the solvability of the models. In addition to integer programming, we develop several heuristic methods for off-line solution of this problem, based on heuristics, shortest paths and rural postman problems. All methods are computationally tested, and summarized results are reported.
Place, publisher, year, edition, pages
Linköping University Electronic Press, 2015. , 74 p.
LiTH-MAT-R, ISSN 0348-2960 ; 2015:01
IdentifiersURN: urn:nbn:se:liu:diva-113944ISRN: LiTH-MAT-R--2015/01--SEOAI: oai:DiVA.org:liu-113944DiVA: diva2:785696