{"id":"https://openalex.org/W2050086875","doi":"https://doi.org/10.1109/geoinformatics.2010.5567477","title":"Exploring time varying shortest path of urban OD Pairs based on floating car data","display_name":"Exploring time varying shortest path of urban OD Pairs based on floating car data","publication_year":2010,"publication_date":"2010-06-01","ids":{"openalex":"https://openalex.org/W2050086875","doi":"https://doi.org/10.1109/geoinformatics.2010.5567477","mag":"2050086875"},"language":"en","primary_location":{"id":"doi:10.1109/geoinformatics.2010.5567477","is_oa":false,"landing_page_url":"https://doi.org/10.1109/geoinformatics.2010.5567477","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2010 18th International Conference on Geoinformatics","raw_type":"proceedings-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/A5022293237","display_name":"Wei Tu","orcid":"https://orcid.org/0000-0002-0255-4037"},"institutions":[{"id":"https://openalex.org/I37461747","display_name":"Wuhan University","ror":"https://ror.org/033vjfk17","country_code":"CN","type":"education","lineage":["https://openalex.org/I37461747"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Wei Tu","raw_affiliation_strings":["Engineering Research Centre of Spatio-Temporal Data Smart Acquisition and Application, Ministry of Education of China, Wuhan University of China, Wuhan, China"],"affiliations":[{"raw_affiliation_string":"Engineering Research Centre of Spatio-Temporal Data Smart Acquisition and Application, Ministry of Education of China, Wuhan University of China, Wuhan, China","institution_ids":["https://openalex.org/I37461747"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5033711071","display_name":"Zhixiang Fang","orcid":"https://orcid.org/0000-0003-1651-878X"},"institutions":[{"id":"https://openalex.org/I37461747","display_name":"Wuhan University","ror":"https://ror.org/033vjfk17","country_code":"CN","type":"education","lineage":["https://openalex.org/I37461747"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Zhixiang Fang","raw_affiliation_strings":["Wuhan University, Wuhan, Hubei, CN"],"affiliations":[{"raw_affiliation_string":"Wuhan University, Wuhan, Hubei, CN","institution_ids":["https://openalex.org/I37461747"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5100404067","display_name":"Qingquan Li","orcid":"https://orcid.org/0000-0002-2438-6046"},"institutions":[{"id":"https://openalex.org/I37461747","display_name":"Wuhan University","ror":"https://ror.org/033vjfk17","country_code":"CN","type":"education","lineage":["https://openalex.org/I37461747"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Qingquan Li","raw_affiliation_strings":["Wuhan University, Wuhan, Hubei, CN"],"affiliations":[{"raw_affiliation_string":"Wuhan University, Wuhan, Hubei, CN","institution_ids":["https://openalex.org/I37461747"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5022293237"],"corresponding_institution_ids":["https://openalex.org/I37461747"],"apc_list":null,"apc_paid":null,"fwci":0.5896,"has_fulltext":false,"cited_by_count":15,"citation_normalized_percentile":{"value":0.75047471,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"36","issue":null,"first_page":"1","last_page":"6"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11344","display_name":"Traffic Prediction and Management Techniques","score":0.9998000264167786,"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"}},"topics":[{"id":"https://openalex.org/T11344","display_name":"Traffic Prediction and Management Techniques","score":0.9998000264167786,"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/T10698","display_name":"Transportation Planning and Optimization","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/3313","display_name":"Transportation"},"field":{"id":"https://openalex.org/fields/33","display_name":"Social Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10524","display_name":"Traffic control and management","score":0.9983000159263611,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems 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/shortest-path-problem","display_name":"Shortest path problem","score":0.71595299243927},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5750895738601685},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4477097690105438},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.1511676013469696},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.11214593052864075},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.05967414379119873}],"concepts":[{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.71595299243927},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5750895738601685},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4477097690105438},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.1511676013469696},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.11214593052864075},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.05967414379119873}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/geoinformatics.2010.5567477","is_oa":false,"landing_page_url":"https://doi.org/10.1109/geoinformatics.2010.5567477","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2010 18th International Conference on Geoinformatics","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.8199999928474426,"id":"https://metadata.un.org/sdg/11","display_name":"Sustainable cities and communities"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W233789739","https://openalex.org/W1519770485","https://openalex.org/W1969261977","https://openalex.org/W2032646680","https://openalex.org/W2036888763","https://openalex.org/W2050560064","https://openalex.org/W2088769880","https://openalex.org/W2116951794","https://openalex.org/W2136429529","https://openalex.org/W2149742236","https://openalex.org/W4285719527","https://openalex.org/W6609050208"],"related_works":["https://openalex.org/W2371125232","https://openalex.org/W2023505575","https://openalex.org/W2373437113","https://openalex.org/W2125453582","https://openalex.org/W2317449002","https://openalex.org/W3106476875","https://openalex.org/W2384974102","https://openalex.org/W2316925676","https://openalex.org/W2384965074","https://openalex.org/W2784047283"],"abstract_inverted_index":{"Traffic":[0],"state":[1,34,184,206],"(for":[2],"instance,":[3],"link":[4,69],"travel":[5,64,103],"time,":[6],"velocity,":[7],"volume)":[8],"in":[9,27,41,240,263],"the":[10,13,24,32,36,58,91,101,117,146,149,168,172,182,208,246,250,254,264],"links":[11],"of":[12,35,66,131,139,151,171,185,202,217,252,260],"urban":[14,37],"road":[15,38,52,68,94,173],"network":[16,39,53,95,211],"should":[17],"be":[18,71,97],"taken":[19],"into":[20],"account":[21],"while":[22],"calculating":[23],"shortest":[25,61,120,215,228,256],"path":[26,121,216,229],"real":[28,82],"application":[29],"situations.":[30],"However,":[31],"traffic":[33,84,88,155,169,183,198,205],"varies":[40],"different":[42,46,221],"places":[43],"and":[44,86,148,197,214,245],"at":[45,162,188,220],"time.":[47],"Constructing":[48],"a":[49,67,261],"time":[50,59,65,83,92,104,118,223,259,265],"varying":[51,60,93,102,119,266],"is":[54,178,192],"critical":[55],"to":[56,115,144,165,180],"explore":[57],"path.":[62],"The":[63],"can":[70,96],"described":[72],"by":[73,106,226,258],"some":[74],"probability":[75],"distribution":[76,150],"functions,":[77],"or":[78],"estimated":[79],"through":[80],"using":[81],"information":[85],"short-term":[87],"forecast.":[89],"Therefore,":[90],"built":[98],"based":[99,122,194],"on":[100,123,195],"captured":[105],"various":[107],"approaches.":[108],"This":[109],"paper":[110],"proposes":[111],"an":[112],"effective":[113],"approach":[114],"investigate":[116],"floating":[124,132,140,237],"car":[125,141,238],"data.":[126,142],"First,":[127],"all":[128,157],"space-time":[129,158],"paths":[130,159,257],"cars":[133],"are":[134,160],"reconstructed":[135],"after":[136],"map-matching":[137],"process":[138],"Then,":[143],"capture":[145],"velocity":[147,196],"vehicles":[152],"that":[153],"reflects":[154],"density,":[156],"sliced":[161],"every":[163],"minute":[164],"build":[166],"up":[167],"snapshot":[170,187],"network.":[174,268],"A":[175,231],"congestion":[176],"index":[177],"introduced":[179],"quantify":[181],"each":[186],"any":[189],"location,":[190],"which":[191],"calculated":[193,225],"density.":[199],"By":[200],"virtue":[201],"these":[203],"time-series":[204],"snapshots,":[207],"time-varying":[209,255],"transport":[210,267],"was":[212,224,243],"established":[213],"OD":[218],"pair":[219],"departure":[222],"A*":[227],"algorithm.":[230],"case":[232],"study":[233],"with":[234],"one":[235],"day":[236,262],"data":[239],"Wuhan,":[241],"China":[242],"implemented,":[244],"experimental":[247],"prototype":[248],"provides":[249],"capability":[251],"exploring":[253]},"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":4},{"year":2015,"cited_by_count":4},{"year":2013,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}
