{"id":"https://openalex.org/W3159030661","doi":"https://doi.org/10.1080/13658816.2021.1919307","title":"An offline map matching algorithm based on shortest paths","display_name":"An offline map matching algorithm based on shortest paths","publication_year":2021,"publication_date":"2021-04-28","ids":{"openalex":"https://openalex.org/W3159030661","doi":"https://doi.org/10.1080/13658816.2021.1919307","mag":"3159030661"},"language":"en","primary_location":{"id":"doi:10.1080/13658816.2021.1919307","is_oa":false,"landing_page_url":"https://doi.org/10.1080/13658816.2021.1919307","pdf_url":null,"source":{"id":"https://openalex.org/S4210181446","display_name":"International Journal of Geographical Information Systems","issn_l":"0269-3798","issn":["0269-3798","1362-3087"],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Geographical Information Science","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5020005002","display_name":"Dongqing Zhang","orcid":"https://orcid.org/0000-0001-5180-7419"},"institutions":[{"id":"https://openalex.org/I24185976","display_name":"Sichuan University","ror":"https://ror.org/011ashp19","country_code":"CN","type":"education","lineage":["https://openalex.org/I24185976"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Dongqing Zhang","raw_affiliation_strings":["Business School, Sichuan University, Chengdu, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Business School, Sichuan University, Chengdu, China","institution_ids":["https://openalex.org/I24185976"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5101813917","display_name":"Zhaoxia Guo","orcid":"https://orcid.org/0000-0002-5232-2023"},"institutions":[{"id":"https://openalex.org/I24185976","display_name":"Sichuan University","ror":"https://ror.org/011ashp19","country_code":"CN","type":"education","lineage":["https://openalex.org/I24185976"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Zhaoxia Guo","raw_affiliation_strings":["Business School, Sichuan University, Chengdu, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Business School, Sichuan University, Chengdu, China","institution_ids":["https://openalex.org/I24185976"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5067896213","display_name":"Feng Guo","orcid":"https://orcid.org/0000-0002-2572-481X"},"institutions":[{"id":"https://openalex.org/I24185976","display_name":"Sichuan University","ror":"https://ror.org/011ashp19","country_code":"CN","type":"education","lineage":["https://openalex.org/I24185976"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Feng Guo","raw_affiliation_strings":["Business School, Sichuan University, Chengdu, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Business School, Sichuan University, Chengdu, China","institution_ids":["https://openalex.org/I24185976"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5050358854","display_name":"Yucheng Dong","orcid":"https://orcid.org/0000-0002-0028-6796"},"institutions":[{"id":"https://openalex.org/I24185976","display_name":"Sichuan University","ror":"https://ror.org/011ashp19","country_code":"CN","type":"education","lineage":["https://openalex.org/I24185976"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Yucheng Dong","raw_affiliation_strings":["Business School, Sichuan University, Chengdu, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Business School, Sichuan University, Chengdu, China","institution_ids":["https://openalex.org/I24185976"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5101813917"],"corresponding_institution_ids":["https://openalex.org/I24185976"],"apc_list":null,"apc_paid":null,"fwci":0.7486,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.69291722,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"35","issue":"11","first_page":"2238","last_page":"2261"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9994999766349792,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9994999766349792,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11344","display_name":"Traffic Prediction and Management Techniques","score":0.9980000257492065,"subfield":{"id":"https://openalex.org/subfields/2215","display_name":"Building and Construction"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T13282","display_name":"Automated Road and Building Extraction","score":0.9947999715805054,"subfield":{"id":"https://openalex.org/subfields/2212","display_name":"Ocean Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/map-matching","display_name":"Map matching","score":0.9055590629577637},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.73856520652771},{"id":"https://openalex.org/keywords/global-positioning-system","display_name":"Global Positioning System","score":0.6692012548446655},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.5945600271224976},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.5644510984420776},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5379029512405396},{"id":"https://openalex.org/keywords/blossom-algorithm","display_name":"Blossom algorithm","score":0.5017848014831543},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4572862982749939},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4539376199245453},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3505566716194153},{"id":"https://openalex.org/keywords/geography","display_name":"Geography","score":0.20086506009101868},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.1113995909690857},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.10168510675430298},{"id":"https://openalex.org/keywords/geodesy","display_name":"Geodesy","score":0.07954409718513489}],"concepts":[{"id":"https://openalex.org/C2778559875","wikidata":"https://www.wikidata.org/wiki/Q1892023","display_name":"Map matching","level":3,"score":0.9055590629577637},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.73856520652771},{"id":"https://openalex.org/C60229501","wikidata":"https://www.wikidata.org/wiki/Q18822","display_name":"Global Positioning System","level":2,"score":0.6692012548446655},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.5945600271224976},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.5644510984420776},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5379029512405396},{"id":"https://openalex.org/C61455927","wikidata":"https://www.wikidata.org/wiki/Q1030529","display_name":"Blossom algorithm","level":3,"score":0.5017848014831543},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4572862982749939},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4539376199245453},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3505566716194153},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.20086506009101868},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.1113995909690857},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.10168510675430298},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"score":0.07954409718513489},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1080/13658816.2021.1919307","is_oa":false,"landing_page_url":"https://doi.org/10.1080/13658816.2021.1919307","pdf_url":null,"source":{"id":"https://openalex.org/S4210181446","display_name":"International Journal of Geographical Information Systems","issn_l":"0269-3798","issn":["0269-3798","1362-3087"],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Geographical Information Science","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G8876453320","display_name":"\u6570\u636e\u9a71\u52a8\u4e0b\u52a8\u6001\u4f9b\u5e94\u94fe\u7684\u751f\u4ea7\u4e0e\u8fd0\u9001\u534f\u540c\u8c03\u5ea6\u7814\u7a76","funder_award_id":"71872118","funder_id":"https://openalex.org/F4320321001","funder_display_name":"National Natural Science Foundation of China"}],"funders":[{"id":"https://openalex.org/F4320321001","display_name":"National Natural Science Foundation of China","ror":"https://ror.org/01h0zpd94"},{"id":"https://openalex.org/F4320322725","display_name":"China Scholarship Council","ror":"https://ror.org/04atp4p48"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":28,"referenced_works":["https://openalex.org/W145270132","https://openalex.org/W311217234","https://openalex.org/W1514900972","https://openalex.org/W1779869868","https://openalex.org/W1995415305","https://openalex.org/W2006317032","https://openalex.org/W2020602155","https://openalex.org/W2075123554","https://openalex.org/W2078240650","https://openalex.org/W2084224084","https://openalex.org/W2088061407","https://openalex.org/W2090227767","https://openalex.org/W2091770595","https://openalex.org/W2094283130","https://openalex.org/W2123988414","https://openalex.org/W2143083884","https://openalex.org/W2166771065","https://openalex.org/W2408262133","https://openalex.org/W2471223835","https://openalex.org/W2618281804","https://openalex.org/W2773077602","https://openalex.org/W2778155454","https://openalex.org/W2799155862","https://openalex.org/W2910170770","https://openalex.org/W2981579652","https://openalex.org/W4210777595","https://openalex.org/W4246153096","https://openalex.org/W4248820698"],"related_works":["https://openalex.org/W1942402104","https://openalex.org/W2108155874","https://openalex.org/W2055676503","https://openalex.org/W2385361142","https://openalex.org/W309190371","https://openalex.org/W2369446480","https://openalex.org/W1728881569","https://openalex.org/W3044605350","https://openalex.org/W3159030661","https://openalex.org/W2550389196"],"abstract_inverted_index":{"Offline":[0],"map":[1,43,92,141],"matching":[2,27,44,93,102,123,142,154,181],"identifies":[3],"corresponding":[4,33],"roads":[5],"to":[6,20,35,115,134,166,174],"a":[7,12,47,62,178],"GPS":[8,37,76,127],"trajectory":[9],"represented":[10],"by":[11,99],"series":[13],"of":[14,64,74,82,152],"recorded":[15],"geographic":[16],"coordinates":[17],"(GPS":[18],"points)":[19],"the":[21,32,41,67,72,79,85,101,109,117,120],"road":[22],"network.":[23],"This":[24],"paper":[25],"defines":[26],"error":[28,103,124],"as":[29,46,61],"cost":[30],"on":[31,58,96,104,187],"road-link":[34],"matched":[36,56,75,163],"points":[38,57,77,83,184],"and":[39,107,156,169],"formulates":[40],"offline":[42,91],"problem":[45,50],"shortest":[48,97,112],"path":[49,113,118],"with":[51,119,138],"resource":[52,65,68],"constraints.":[53],"By":[54],"regarding":[55],"one":[59],"link":[60,106],"type":[63],"consumed,":[66],"constraint":[69],"indicates":[70],"that":[71],"number":[73,81],"equals":[78],"total":[80,122],"in":[84,150],"given":[86],"trajectory.":[87],"We":[88,129],"propose":[89],"an":[90],"algorithm":[94,114,137,145,160],"based":[95],"paths":[98],"calculating":[100],"each":[105],"extending":[108],"classic":[110],"label-setting":[111],"find":[116],"minimum":[121],"for":[125],"all":[126,147],"points.":[128],"use":[130],"real-world":[131],"taxi":[132],"trajectories":[133],"compare":[135],"our":[136],"three":[139],"state-of-the-art":[140],"algorithms.":[143],"Our":[144,159],"outperforms":[146],"benchmark":[148],"algorithms":[149],"terms":[151],"both":[153],"accuracy":[155],"computational":[157],"efficiency.":[158],"achieves":[161],"greater":[162],"length":[164,172],"(5.36":[165],"12.27%":[167],"larger)":[168],"lower":[170],"mis-matched":[171],"(3.72":[173],"75.30%":[175],"smaller)":[176],"at":[177],"very":[179],"high":[180],"speed":[182],"(60.59":[183],"per":[185],"second":[186],"average":[188],"over":[189],"thirteen":[190],"sampling":[191],"intervals).":[192]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":2},{"year":2021,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}