Change search
ReferencesLink to record
Permanent link

Direct link
Computational Results for Map Matching by Optimization
Linköping University, Department of Mathematics, Optimization . Linköping University, The Institute of Technology.ORCID iD: 0000-0001-5907-0087
2015 (English)Report (Other academic)
Abstract [en]

The problem of map matching appears when evaluating GPS-tracks recorded by service vehicles, and is used to associate the sequences of GPS-points to links in a graph. Difficulties are errors in the GPS-coordinates and possible lack of GPS-points on short street segments. This paper reports computational tests on integer programming models for the problem, and on several heuristic methods, based on shortest paths and rural postman problems. We present extensive computational results for several methods and for both artificial and real life test cases.

Place, publisher, year, edition, pages
Linköping University Electronic Press, 2015. , 104 p.
LiTH-MAT-R, ISSN 0348-2960 ; 2015:02
National Category
URN: urn:nbn:se:liu:diva-113945ISRN: LiTH-MAT-R--2015/02--SEOAI: diva2:785701
Available from: 2015-02-03 Created: 2015-02-03 Last updated: 2015-02-03

Open Access in DiVA

Computational Results for Map Matching by Optimization(1301 kB)95 downloads
File information
File name FULLTEXT01.pdfFile size 1301 kBChecksum SHA-512
Type fulltextMimetype application/pdf

Search in DiVA

By author/editor
Holmberg, Kaj
By organisation
Optimization The Institute of Technology

Search outside of DiVA

GoogleGoogle Scholar
Total: 95 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Total: 290 hits
ReferencesLink to record
Permanent link

Direct link