{"id":"https://openalex.org/W12958437","doi":"https://doi.org/10.1007/978-3-642-53703-5_36","title":"Regional Road Network Shortest Path Algorithm in Vehicle Navigation Systems","display_name":"Regional Road Network Shortest Path Algorithm in Vehicle Navigation Systems","publication_year":2013,"publication_date":"2013-01-01","ids":{"openalex":"https://openalex.org/W12958437","doi":"https://doi.org/10.1007/978-3-642-53703-5_36","mag":"12958437"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-642-53703-5_36","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-53703-5_36","pdf_url":null,"source":{"id":"https://openalex.org/S2764900261","display_name":"Communications in computer and information science","issn_l":"1865-0929","issn":["1865-0929","1865-0937"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Communications in Computer and Information Science","raw_type":"book-chapter"},"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/A5100414362","display_name":"Ying Li","orcid":"https://orcid.org/0000-0002-9604-2664"},"institutions":[{"id":"https://openalex.org/I155673605","display_name":"Union University","ror":"https://ror.org/02c561939","country_code":"US","type":"education","lineage":["https://openalex.org/I155673605"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Ying Li","raw_affiliation_strings":["College of Sciences, Hebei\u00a0Union University, Tang\u2019shan, China","Hebei Union University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"College of Sciences, Hebei\u00a0Union University, Tang\u2019shan, China","institution_ids":[]},{"raw_affiliation_string":"Hebei Union University","institution_ids":["https://openalex.org/I155673605"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5062957615","display_name":"Aimin Yang","orcid":"https://orcid.org/0000-0001-7671-6150"},"institutions":[{"id":"https://openalex.org/I155673605","display_name":"Union University","ror":"https://ror.org/02c561939","country_code":"US","type":"education","lineage":["https://openalex.org/I155673605"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Aimin Yang","raw_affiliation_strings":["College of Sciences, Hebei\u00a0Union University, Tang\u2019shan, China","Hebei Union University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"College of Sciences, Hebei\u00a0Union University, Tang\u2019shan, China","institution_ids":[]},{"raw_affiliation_string":"Hebei Union University","institution_ids":["https://openalex.org/I155673605"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5100336699","display_name":"Donghui Li","orcid":"https://orcid.org/0000-0003-1287-7179"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Donghui Li","raw_affiliation_strings":["Tianjin supply section, Beijing Railway Bureau, Tang\u2019shan, China","Beijing Railway Bureau"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Tianjin supply section, Beijing Railway Bureau, Tang\u2019shan, China","institution_ids":[]},{"raw_affiliation_string":"Beijing Railway Bureau","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"343","last_page":"353"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9965000152587891,"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.9965000152587891,"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/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9879999756813049,"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"}},{"id":"https://openalex.org/T12203","display_name":"Mobile Agent-Based Network Management","score":0.9818999767303467,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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-problem","display_name":"Shortest path problem","score":0.798602819442749},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6160104274749756},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5188892483711243},{"id":"https://openalex.org/keywords/realization","display_name":"Realization (probability)","score":0.4935373067855835},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.47721415758132935},{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.4685578942298889},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.46790561079978943},{"id":"https://openalex.org/keywords/transport-engineering","display_name":"Transport engineering","score":0.36348336935043335},{"id":"https://openalex.org/keywords/geography","display_name":"Geography","score":0.3566969633102417},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.20505699515342712},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.18507972359657288},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.17354053258895874},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.1699412763118744},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.16929584741592407},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.06363308429718018}],"concepts":[{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.798602819442749},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6160104274749756},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5188892483711243},{"id":"https://openalex.org/C2781089630","wikidata":"https://www.wikidata.org/wiki/Q21856745","display_name":"Realization (probability)","level":2,"score":0.4935373067855835},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.47721415758132935},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.4685578942298889},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.46790561079978943},{"id":"https://openalex.org/C22212356","wikidata":"https://www.wikidata.org/wiki/Q775325","display_name":"Transport engineering","level":1,"score":0.36348336935043335},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.3566969633102417},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.20505699515342712},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.18507972359657288},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.17354053258895874},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.1699412763118744},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.16929584741592407},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.06363308429718018}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/978-3-642-53703-5_36","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-53703-5_36","pdf_url":null,"source":{"id":"https://openalex.org/S2764900261","display_name":"Communications in computer and information science","issn_l":"1865-0929","issn":["1865-0929","1865-0937"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Communications in Computer and Information Science","raw_type":"book-chapter"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.41999998688697815,"id":"https://metadata.un.org/sdg/11","display_name":"Sustainable cities and communities"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":11,"referenced_works":["https://openalex.org/W2022573578","https://openalex.org/W2030998569","https://openalex.org/W2040227891","https://openalex.org/W2047399896","https://openalex.org/W2123757175","https://openalex.org/W2152053668","https://openalex.org/W2350880266","https://openalex.org/W2375724183","https://openalex.org/W2389395104","https://openalex.org/W2799004609","https://openalex.org/W4251609852"],"related_works":["https://openalex.org/W4223969905","https://openalex.org/W2363342665","https://openalex.org/W2170980056","https://openalex.org/W2990531685","https://openalex.org/W2886722595","https://openalex.org/W3088868185","https://openalex.org/W4310124294","https://openalex.org/W2379804627","https://openalex.org/W2359532380","https://openalex.org/W1820003665"],"abstract_inverted_index":null,"counts_by_year":[{"year":2020,"cited_by_count":2}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}