{"id":"https://openalex.org/W2736738957","doi":"https://doi.org/10.1080/13658816.2017.1356460","title":"Computing a hierarchy favored optimal route in a Voronoi-based road network with multiple levels of detail","display_name":"Computing a hierarchy favored optimal route in a Voronoi-based road network with multiple levels of detail","publication_year":2017,"publication_date":"2017-07-19","ids":{"openalex":"https://openalex.org/W2736738957","doi":"https://doi.org/10.1080/13658816.2017.1356460","mag":"2736738957"},"language":"en","primary_location":{"id":"doi:10.1080/13658816.2017.1356460","is_oa":false,"landing_page_url":"https://doi.org/10.1080/13658816.2017.1356460","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/A5101891849","display_name":"Zhenghua Hu","orcid":"https://orcid.org/0000-0003-4316-776X"},"institutions":[{"id":"https://openalex.org/I159389169","display_name":"Ningbo University of Technology","ror":"https://ror.org/037dym702","country_code":"CN","type":"education","lineage":["https://openalex.org/I159389169"]},{"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":"Zhenghua Hu","raw_affiliation_strings":["School of Electronic and Information Engineering, NingBo University of Technology, Ningbo, China","School of Remote Sensing and Information Engineering, Wuhan University, Wuhan, China"],"affiliations":[{"raw_affiliation_string":"School of Electronic and Information Engineering, NingBo University of Technology, Ningbo, China","institution_ids":["https://openalex.org/I159389169"]},{"raw_affiliation_string":"School of Remote Sensing and Information Engineering, Wuhan University, Wuhan, China","institution_ids":["https://openalex.org/I37461747"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5004896771","display_name":"Tao Jia","orcid":"https://orcid.org/0000-0003-4921-6833"},"institutions":[{"id":"https://openalex.org/I14243506","display_name":"Hong Kong Polytechnic University","ror":"https://ror.org/0030zas98","country_code":"HK","type":"education","lineage":["https://openalex.org/I14243506"]},{"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","HK"],"is_corresponding":true,"raw_author_name":"Tao Jia","raw_affiliation_strings":["Department of Land Surveying and Geo-informatics, The Hong Kong Polytechnic University, Kowloon, Hong Kong, China","School of Remote Sensing and Information Engineering, Wuhan University, Wuhan, China"],"affiliations":[{"raw_affiliation_string":"Department of Land Surveying and Geo-informatics, The Hong Kong Polytechnic University, Kowloon, Hong Kong, China","institution_ids":["https://openalex.org/I14243506"]},{"raw_affiliation_string":"School of Remote Sensing and Information Engineering, Wuhan University, Wuhan, China","institution_ids":["https://openalex.org/I37461747"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Guofeng Wang","orcid":null},"institutions":[{"id":"https://openalex.org/I4210103140","display_name":"CCCC Highway Consultants (China)","ror":"https://ror.org/01bs84e19","country_code":"CN","type":"company","lineage":["https://openalex.org/I4210103140"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Guofeng Wang","raw_affiliation_strings":["China Highway Engineering Consulting Corporation, Beijing, China"],"affiliations":[{"raw_affiliation_string":"China Highway Engineering Consulting Corporation, Beijing, China","institution_ids":["https://openalex.org/I4210103140"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5113861493","display_name":"Jiye Wang","orcid":null},"institutions":[{"id":"https://openalex.org/I17442442","display_name":"State Grid Corporation of China (China)","ror":"https://ror.org/05twwhs70","country_code":"CN","type":"company","lineage":["https://openalex.org/I17442442"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Jiye Wang","raw_affiliation_strings":["Department of Information and Communication, State Grid Corporation of China, Beijing, China"],"affiliations":[{"raw_affiliation_string":"Department of Information and Communication, State Grid Corporation of China, Beijing, China","institution_ids":["https://openalex.org/I17442442"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5100762849","display_name":"Lingkui Meng","orcid":"https://orcid.org/0000-0001-7224-677X"},"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":"Lingkui Meng","raw_affiliation_strings":["School of Remote Sensing and Information Engineering, Wuhan University, Wuhan, China"],"affiliations":[{"raw_affiliation_string":"School of Remote Sensing and Information Engineering, Wuhan University, Wuhan, China","institution_ids":["https://openalex.org/I37461747"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5004896771"],"corresponding_institution_ids":["https://openalex.org/I14243506","https://openalex.org/I37461747"],"apc_list":null,"apc_paid":null,"fwci":0.1866,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.44830405,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"31","issue":"11","first_page":"2216","last_page":"2233"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9991000294685364,"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.9991000294685364,"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/T10698","display_name":"Transportation Planning and Optimization","score":0.9914000034332275,"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/T13282","display_name":"Automated Road and Building Extraction","score":0.9815999865531921,"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/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.9474261403083801},{"id":"https://openalex.org/keywords/voronoi-diagram","display_name":"Voronoi diagram","score":0.6668566465377808},{"id":"https://openalex.org/keywords/pathfinding","display_name":"Pathfinding","score":0.6006962656974792},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5658172965049744},{"id":"https://openalex.org/keywords/hierarchy","display_name":"Hierarchy","score":0.553439736366272},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.49545252323150635},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.4452442526817322},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4212646484375},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.4012189507484436},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.27618885040283203},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.18798324465751648},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.16786614060401917}],"concepts":[{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.9474261403083801},{"id":"https://openalex.org/C24881265","wikidata":"https://www.wikidata.org/wiki/Q757267","display_name":"Voronoi diagram","level":2,"score":0.6668566465377808},{"id":"https://openalex.org/C25321074","wikidata":"https://www.wikidata.org/wiki/Q1969601","display_name":"Pathfinding","level":4,"score":0.6006962656974792},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5658172965049744},{"id":"https://openalex.org/C31170391","wikidata":"https://www.wikidata.org/wiki/Q188619","display_name":"Hierarchy","level":2,"score":0.553439736366272},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.49545252323150635},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.4452442526817322},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4212646484375},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.4012189507484436},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.27618885040283203},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.18798324465751648},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.16786614060401917},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"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/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C34447519","wikidata":"https://www.wikidata.org/wiki/Q179522","display_name":"Market economy","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1080/13658816.2017.1356460","is_oa":false,"landing_page_url":"https://doi.org/10.1080/13658816.2017.1356460","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"},{"id":"pmh:oai:ira.lib.polyu.edu.hk:10397/76504","is_oa":false,"landing_page_url":"http://hdl.handle.net/10397/76504","pdf_url":null,"source":{"id":"https://openalex.org/S4306400205","display_name":"PolyU Institutional Research Archive (Hong Kong Polytechnic University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I14243506","host_organization_name":"Hong Kong Polytechnic University","host_organization_lineage":["https://openalex.org/I14243506"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Journal/Magazine Article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.7099999785423279,"display_name":"Sustainable cities and communities","id":"https://metadata.un.org/sdg/11"}],"awards":[{"id":"https://openalex.org/G4206280202","display_name":null,"funder_award_id":"41331175","funder_id":"https://openalex.org/F4320321001","funder_display_name":"National Natural Science Foundation of China"},{"id":"https://openalex.org/G5354096046","display_name":null,"funder_award_id":"07-Y30B10-9001-14/16","funder_id":"https://openalex.org/F4320321001","funder_display_name":"National Natural Science Foundation of China"},{"id":"https://openalex.org/G7476578150","display_name":null,"funder_award_id":"41401453","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"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":25,"referenced_works":["https://openalex.org/W1498925937","https://openalex.org/W1510343741","https://openalex.org/W1540853027","https://openalex.org/W1581197818","https://openalex.org/W1873394894","https://openalex.org/W1873454805","https://openalex.org/W1971536878","https://openalex.org/W1973619036","https://openalex.org/W1979006363","https://openalex.org/W2010342401","https://openalex.org/W2012161547","https://openalex.org/W2016227107","https://openalex.org/W2018463837","https://openalex.org/W2061069829","https://openalex.org/W2097210248","https://openalex.org/W2103359390","https://openalex.org/W2115913201","https://openalex.org/W2142356756","https://openalex.org/W2143083884","https://openalex.org/W2159317293","https://openalex.org/W2160904540","https://openalex.org/W2168796642","https://openalex.org/W2234724639","https://openalex.org/W2400041435","https://openalex.org/W2588219273"],"related_works":["https://openalex.org/W4285687848","https://openalex.org/W223921116","https://openalex.org/W2982088850","https://openalex.org/W78690942","https://openalex.org/W4221129498","https://openalex.org/W2887026015","https://openalex.org/W2361442013","https://openalex.org/W2886722595","https://openalex.org/W2394042577","https://openalex.org/W2368688974"],"abstract_inverted_index":{"This":[0],"paper":[1],"introduces":[2],"a":[3,15,70,84,91],"robust":[4],"method":[5,180,230],"for":[6,38],"computing":[7],"the":[8,48,56,62,76,97,133,143,160,170,188,192,209,220,232,238,242,254],"optimal":[9,63],"route":[10,64,77],"with":[11,23,65],"hierarchy.":[12],"We":[13],"convert":[14],"planar":[16],"road":[17,198],"network":[18,52,87],"into":[19],"its":[20],"Voronoi-based":[21],"counterpart":[22],"multiple":[24],"levels":[25],"of":[26,41,50,101,112,185,249],"detail":[27],"(LoDs),":[28],"which":[29],"is":[30,67,78,181,205,236],"subsequently":[31],"assigned":[32],"travel":[33,122,149],"times":[34,40,150],"that":[35,120,178,202],"are":[36,124,151],"estimated":[37],"different":[39],"day":[42],"using":[43,108],"taxicab":[44],"trajectory":[45],"data.":[46],"On":[47],"basis":[49],"this":[51],"structure,":[53],"we":[54,176],"model":[55],"path-finding":[57],"process":[58],"in":[59,69,83,90,114,183,247,259],"travel,":[60],"as":[61,241],"hierarchy":[66],"computed":[68,131,141,158,168],"\u2018coarse-to-fine\u2019":[71],"manner.":[72],"In":[73],"other":[74],"words,":[75],"iteratively":[79],"constructed":[80],"from":[81],"roads":[82,89,217],"low":[85],"LoD":[86,93],"to":[88,208,256],"high":[92],"network.":[94],"To":[95],"confirm":[96,201],"efficiency":[98],"and":[99,136,163,191,218],"effectiveness":[100],"our":[102,121,179,203,229],"method,":[103],"comparative":[104],"experiments":[105],"were":[106],"conducted":[107],"randomly":[109],"selected":[110],"pairs":[111],"origins/destinations":[113],"Wuhan,":[115],"China.":[116],"The":[117],"results":[118],"indicate":[119],"lengths":[123],"on":[125,152,237],"average":[126,153],"12%":[127],"longer":[128,155],"than":[129,139,156,166],"those":[130,140,157,167],"by":[132,142,159,169,214,223],"Dijkstra":[134,161,189,221,233],"algorithm":[135,145,162,172,190,194,204,211,222,234,244],"15%":[137],"shorter":[138,165],"hierarchical":[144,171,193,210,243],"(in":[146,173,195,212,245],"ArcGIS).":[147,174,196],"Our":[148],"29%":[154],"31%":[164],"Hence,":[175],"argue":[177],"situated":[182],"terms":[184,248],"performance":[186],"between":[187],"Moreover,":[197],"usage":[199],"patterns":[200],"cognitively":[206],"equivalent":[207],"ArcGIS)":[213,246],"favoring":[215],"high-class":[216],"outperforms":[219,231],"avoiding":[224],"choosing":[225],"low-class":[226],"roads.":[227],"Computationally,":[228],"but":[235],"same":[239],"level":[240],"efficiency.":[250],"Therefore,":[251],"it":[252],"has":[253],"potential":[255],"be":[257],"used":[258],"real-time":[260],"routing":[261],"applications":[262],"or":[263],"services.":[264]},"counts_by_year":[{"year":2024,"cited_by_count":2},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1}],"updated_date":"2026-04-16T08:26:57.006410","created_date":"2025-10-10T00:00:00"}