{"id":"https://openalex.org/W2124997593","doi":"https://doi.org/10.1109/itsc.2001.948786","title":"Finding a path in the hierarchical road networks","display_name":"Finding a path in the hierarchical road networks","publication_year":2002,"publication_date":"2002-11-13","ids":{"openalex":"https://openalex.org/W2124997593","doi":"https://doi.org/10.1109/itsc.2001.948786","mag":"2124997593"},"language":"en","primary_location":{"id":"doi:10.1109/itsc.2001.948786","doi":"https://doi.org/10.1109/itsc.2001.948786","is_oa":false,"landing_page_url":"https://doi.org/10.1109/itsc.2001.948786","pdf_url":null,"source":{"id":"https://openalex.org/S4363607737","display_name":"IEEE International Conference on Intelligent Transportation Systems (ITSC)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ITSC 2001. 2001 IEEE Intelligent Transportation Systems. Proceedings (Cat. No.01TH8585)","raw_type":"proceedings-article"},"volume":null,"type":"conference-paper","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/A5008999856","display_name":"Chan-Kyoo Park","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Chan-Kyoo Park","raw_affiliation_strings":["Department of Information Technology and Audits, National Computerization Agency, Yongin si, South Korea"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Information Technology and Audits, National Computerization Agency, Yongin si, South Korea","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5042100114","display_name":"Kiseok Sung","orcid":"https://orcid.org/0000-0002-4014-7475","observed_orcids":["https://orcid.org/0000-0002-4014-7475"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Kiseok Sung","raw_affiliation_strings":["Department of Industrial Engineering, Kangnung National University, Gangneung, South Korea"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Industrial Engineering, Kangnung National University, Gangneung, South Korea","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5062936784","display_name":"Seungyong Doh","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I139264467","display_name":"Seoul National University","ror":"https://ror.org/04h9pn542","country_code":"KR","type":"education","lineage":["https://openalex.org/I139264467"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"Seungyong Doh","raw_affiliation_strings":["Department of Industrial Engineering, Seoul National University, Seoul, South Korea"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Industrial Engineering, Seoul National University, Seoul, South Korea","institution_ids":["https://openalex.org/I139264467"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5011561093","display_name":"Soondal Park","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I139264467","display_name":"Seoul National University","ror":"https://ror.org/04h9pn542","country_code":"KR","type":"education","lineage":["https://openalex.org/I139264467"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"Soondal Park","raw_affiliation_strings":["Department of Industrial Engineering, Seoul National University, Seoul, South Korea"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Industrial Engineering, Seoul National University, Seoul, South Korea","institution_ids":["https://openalex.org/I139264467"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":8.0913,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.97551789,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":93},"biblio":{"volume":"27","issue":null,"first_page":"936","last_page":"942"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10698","display_name":"Transportation Planning and Optimization","score":0.5669000148773193,"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"}},"topics":[{"id":"https://openalex.org/T10698","display_name":"Transportation Planning and Optimization","score":0.5669000148773193,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.1776999980211258,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T12292","display_name":"Graph Theory and Algorithms","score":0.09529999643564224,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/shortest-path-finding","display_name":"shortest path search","score":0.6769999861717224},{"id":"https://openalex.org/keywords/node-reduction","display_name":"node reduction","score":0.5099999904632568},{"id":"https://openalex.org/keywords/speed-limits","display_name":"speed limits","score":0.4950000047683716},{"id":"https://openalex.org/keywords/number-of-lanes","display_name":"number of lanes","score":0.5899999737739563},{"id":"https://openalex.org/keywords/approximate-shortest-paths","display_name":"approximate shortest paths","score":0.5979999899864197}],"concepts":[{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.7724626064300537},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.7443637251853943},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7053513526916504},{"id":"https://openalex.org/C91886571","wikidata":"https://www.wikidata.org/wiki/Q432520","display_name":"Average path length","level":4,"score":0.7030280828475952},{"id":"https://openalex.org/C129045301","wikidata":"https://www.wikidata.org/wiki/Q7144654","display_name":"Path length","level":2,"score":0.5982083678245544},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.5346751809120178},{"id":"https://openalex.org/C151201525","wikidata":"https://www.wikidata.org/wiki/Q177239","display_name":"Limit (mathematics)","level":2,"score":0.5311012864112854},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5054936408996582},{"id":"https://openalex.org/C178067994","wikidata":"https://www.wikidata.org/wiki/Q1128278","display_name":"Constrained Shortest Path First","level":5,"score":0.4673728346824646},{"id":"https://openalex.org/C119971455","wikidata":"https://www.wikidata.org/wiki/Q8052172","display_name":"Yen's algorithm","level":5,"score":0.44556134939193726},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.32171469926834106},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.26140496134757996},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.2382436990737915},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.22909295558929443},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.18830999732017517},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","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.1109/itsc.2001.948786","doi":"https://doi.org/10.1109/itsc.2001.948786","is_oa":false,"landing_page_url":"https://doi.org/10.1109/itsc.2001.948786","pdf_url":null,"source":{"id":"https://openalex.org/S4363607737","display_name":"IEEE International Conference on Intelligent Transportation Systems (ITSC)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ITSC 2001. 2001 IEEE Intelligent Transportation Systems. Proceedings (Cat. No.01TH8585)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.8970999717712402,"id":"https://metadata.un.org/sdg/9","display_name":"Industry, innovation and infrastructure"},{"score":0.875,"id":"https://metadata.un.org/sdg/11","display_name":"Sustainable cities and communities"}],"sustainable_development_goals_aurora":[{"score":0.6200000047683716,"id":"https://metadata.un.org/sdg/11","display_name":"Sustainable cities and communities"}],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":7,"referenced_works":["https://openalex.org/W608922760","https://openalex.org/W1971470866","https://openalex.org/W1977545325","https://openalex.org/W1997413504","https://openalex.org/W2069934886","https://openalex.org/W2304688050","https://openalex.org/W6618847232"],"related_works":["https://openalex.org/W1508311868","https://openalex.org/W2065107044","https://openalex.org/W2363933991","https://openalex.org/W2115913201","https://openalex.org/W2092854824","https://openalex.org/W2291284068","https://openalex.org/W2047224504","https://openalex.org/W2031095783","https://openalex.org/W2137073837","https://openalex.org/W2358081485"],"abstract_inverted_index":{"In":[0,56],"a":[1,61,81],"hierarchical":[2,66],"road":[3,41,67],"network,":[4],"all":[5],"roads":[6],"can":[7,46,53],"be":[8,44,47,54,98],"classified":[9],"into":[10,32],"two":[11],"groups":[12],"according":[13],"to":[14,43,97,134],"their":[15,19],"attributes,":[16],"such":[17],"as":[18],"speed":[20],"limit":[21],"and":[22,34,49,69,83,113,117],"the":[23,29,37,40,65,93,103,106,110,120,124,136,139],"number":[24,94],"of":[25,39,95,105,119,123,138],"lanes.":[26],"By":[27],"splitting":[28],"whole":[30,125],"network":[31,42,68,126],"high-level":[33],"low-level":[35],"subnetworks,":[36],"size":[38],"searched":[45],"reduced,":[48],"more":[50],"human-oriented":[51],"paths":[52,107],"obtained.":[55],"this":[57],"paper,":[58],"we":[59],"define":[60],"convenient":[62,82],"path":[63,86,122],"in":[64],"propose":[70],"an":[71],"algorithm":[72,79,112],"for":[73],"finding":[74],"that":[75,118],"path.":[76],"The":[77,100],"proposed":[78,111,140],"produces":[80],"approximately":[84],"shortest":[85,121],"with":[87],"little":[88],"computational":[89],"effort":[90],"by":[91,109,114],"reducing":[92],"nodes":[96],"considered.":[99],"difference":[101],"between":[102],"length":[104],"produced":[108],"existing":[115],"algorithms":[116],"is":[127],"discussed.":[128],"Some":[129],"experimental":[130],"results":[131],"are":[132],"given":[133],"show":[135],"efficiency":[137],"algorithm.":[141]},"counts_by_year":[{"year":2022,"cited_by_count":1}],"updated_date":"2026-10-27T15:51:10.671819","created_date":"2016-06-24T00:00:00"}