Change search
ReferencesLink to record
Permanent link

Direct link
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 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
National Category
URN: urn:nbn:se:liu:diva-113944ISRN: LiTH-MAT-R--2015/01--SEOAI: diva2:785696
Available from: 2015-02-03 Created: 2015-02-03 Last updated: 2015-02-03

Open Access in DiVA

Map Matching by Optimization(1581 kB)301 downloads
File information
File name FULLTEXT01.pdfFile size 1581 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: 301 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: 932 hits
ReferencesLink to record
Permanent link

Direct link