{"id":"https://openalex.org/W2315071030","doi":"https://doi.org/10.3724/sp.j.1087.2011.00651","title":"Shortest path search in road network with incomplete information","display_name":"Shortest path search in road network with incomplete information","publication_year":2011,"publication_date":"2011-05-18","ids":{"openalex":"https://openalex.org/W2315071030","doi":"https://doi.org/10.3724/sp.j.1087.2011.00651","mag":"2315071030"},"language":"en","primary_location":{"id":"doi:10.3724/sp.j.1087.2011.00651","doi":"https://doi.org/10.3724/sp.j.1087.2011.00651","is_oa":true,"landing_page_url":"https://doi.org/10.3724/sp.j.1087.2011.00651","pdf_url":"http://www.joca.cn/CN/article/downloadArticleFile.do?attachType=PDF&id=13808","source":{"id":"https://openalex.org/S107449649","display_name":"Journal of Computer Applications","issn_l":"1001-9081","issn":["1001-9081"],"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/P4310319982","host_organization_name":"Science Press","host_organization_lineage":["https://openalex.org/P4310319982"],"host_organization_lineage_names":["Science Press"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Computer Applications","raw_type":"journal-article"},"volume":null,"type":"article","is_traditional":true,"indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"http://www.joca.cn/CN/article/downloadArticleFile.do?attachType=PDF&id=13808","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5049594816","display_name":"Kejun Long","orcid":"https://orcid.org/0000-0001-5968-1865","observed_orcids":["https://orcid.org/0000-0001-5968-1865","https://orcid.org/0000-0002-3775-7758"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Ke-jun LONG","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5014633686","display_name":"Lee D. Han","orcid":"https://orcid.org/0000-0002-1381-1254","observed_orcids":["https://orcid.org/0000-0002-1381-1254"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Lee D HAN","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5071081757","display_name":"Wang Sai-zheng","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Sai-zheng WANG","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.3534,"has_fulltext":true,"cited_by_count":2,"citation_normalized_percentile":{"value":0.87972414,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":88,"max":93},"biblio":{"volume":"31","issue":"3","first_page":"651","last_page":"653"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10698","display_name":"Transportation Planning and Optimization","score":0.9164999723434448,"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.9164999723434448,"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.039900001138448715,"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"}},{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.013000000268220901,"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-finding","display_name":"shortest path search","score":0.9929999709129333},{"id":"https://openalex.org/keywords/road-network","display_name":"road network","score":0.9039999842643738},{"id":"https://openalex.org/keywords/incomplete-information","display_name":"incomplete information","score":0.9570000171661377},{"id":"https://openalex.org/keywords/dynamic-shortest-path","display_name":"dynamic shortest path","score":0.7730000019073486},{"id":"https://openalex.org/keywords/hybrid-planning","display_name":"hybrid planning","score":0.5950000286102295},{"id":"https://openalex.org/keywords/dynamic-route-guidance","display_name":"dynamic route guidance","score":0.597000002861023},{"id":"https://openalex.org/keywords/traffic-congestion-avoidance","display_name":"traffic congestion avoidance","score":0.7419999837875366},{"id":"https://openalex.org/keywords/dijkstra-s-algorithm","display_name":"Dijkstra's algorithm","score":0.6620000004768372},{"id":"https://openalex.org/keywords/road-network-structure","display_name":"road network structure","score":0.5879999995231628}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.667288064956665},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.5206167697906494},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5050447583198547},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.32531267404556274},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.26542264223098755},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.16049501299858093},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.05379512906074524}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.3724/sp.j.1087.2011.00651","doi":"https://doi.org/10.3724/sp.j.1087.2011.00651","is_oa":true,"landing_page_url":"https://doi.org/10.3724/sp.j.1087.2011.00651","pdf_url":"http://www.joca.cn/CN/article/downloadArticleFile.do?attachType=PDF&id=13808","source":{"id":"https://openalex.org/S107449649","display_name":"Journal of Computer Applications","issn_l":"1001-9081","issn":["1001-9081"],"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/P4310319982","host_organization_name":"Science Press","host_organization_lineage":["https://openalex.org/P4310319982"],"host_organization_lineage_names":["Science Press"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Computer Applications","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.3724/sp.j.1087.2011.00651","doi":"https://doi.org/10.3724/sp.j.1087.2011.00651","is_oa":true,"landing_page_url":"https://doi.org/10.3724/sp.j.1087.2011.00651","pdf_url":"http://www.joca.cn/CN/article/downloadArticleFile.do?attachType=PDF&id=13808","source":{"id":"https://openalex.org/S107449649","display_name":"Journal of Computer Applications","issn_l":"1001-9081","issn":["1001-9081"],"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/P4310319982","host_organization_name":"Science Press","host_organization_lineage":["https://openalex.org/P4310319982"],"host_organization_lineage_names":["Science Press"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Computer Applications","raw_type":"journal-article"},"sustainable_development_goals":[{"display_name":"Industry, innovation and infrastructure","score":0.8970999717712402,"id":"https://metadata.un.org/sdg/9"},{"display_name":"Sustainable cities and communities","score":0.7250000238418579,"id":"https://metadata.un.org/sdg/11"}],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2315071030.pdf","grobid_xml":"https://content.openalex.org/works/W2315071030.grobid-xml"},"referenced_works_count":2,"referenced_works":["https://openalex.org/W2059289850","https://openalex.org/W2101502731"],"related_works":["https://openalex.org/W2359507941","https://openalex.org/W2360661333","https://openalex.org/W3115682531","https://openalex.org/W2056974412","https://openalex.org/W7068674071","https://openalex.org/W7097494825","https://openalex.org/W6903764711","https://openalex.org/W2955338387","https://openalex.org/W2381279204","https://openalex.org/W2383190342"],"abstract_inverted_index":{"\u6458\u8981\uff1a":[0],"\u9488\u5bf9\u8def\u7f51\u4fe1\u606f\u4e0d\u5b8c\u5907\u6027\u3001\u8def\u7f51\u7ed3\u6784\u7279\u5f81\u548c\u9a7e\u9a76\u5458\u4e60\u60ef\u7b49\u56e0\u7d20\uff0c\u7814\u7a76\u6700\u77ed\u8def\u641c\u7d22\u95ee\u9898\u3002\u63d0\u51fa\u4ee5\u5168\u5c40\u89c4\u5212\u548c\u5c40\u90e8\u89c4\u5212\u76f8\u7ed3\u5408\u7684\u52a8\u6001\u6700\u77ed\u8def\u6df7\u5408\u89c4\u5212\u65b9\u6cd5\uff1a\u5168\u5c40\u89c4\u5212\u4e2d\uff0c\u57fa\u4e8e\u53c2\u6570d/l\uff08\u8d77\u7ec8\u70b9\u8ddd\u79bbd\u4e0e\u5e73\u5747\u8def\u6bb5\u957f\u5ea6l\u4e4b\u6bd4\uff09\uff0c\u786e\u5b9a\u8def\u5f84\u641c\u7d22\u533a\u57df\u7684\u692d\u5706\u65b9\u7a0b\uff0c\u8fd0\u7528Dijkstra\u7b97\u6cd5\u751f\u6210\u9759\u6001\u7684\u5168\u5c40\u6700\u77ed\u8def\u5f84\uff1b\u5c40\u90e8\u89c4\u5212\u4e2d\uff0c\u7ed3\u5408\u8def\u7f51\u7ed3\u6784\u7279\u5f81\u3001\u7a81\u53d1\u4e8b\u4ef6\u5f71\u54cd\u8303\u56f4\uff0c\u63d0\u51fa\u6539\u8fdbBug\u7b97\u6cd5\uff0c\u4ee5\u907f\u514d\u8f66\u8f86\u8fdb\u5165\u5168\u5c40\u6700\u77ed\u8def\u5f84\u4e0a\u53d1\u751f\u7684\u7d27\u6025\u4e8b\u4ef6\u6216\u4e25\u91cd\u5835\u585e\u533a\u57df\uff0c\u5b9e\u73b0\u52a8\u6001\u8bf1\u5bfc\u3002\u4eff\u771f\u5b9e\u9a8c\u7ed3\u679c\u8868\u660e\uff0c\u6df7\u5408\u89c4\u5212\u65b9\u6cd5\u80fd\u5728\u8def\u7f51\u4fe1\u606f\u4e0d\u5b8c\u5907\u6761\u4ef6\u4e0b\u5b9e\u73b0\u6700\u77ed\u8def\u5f84\u52a8\u6001\u8bf1\u5bfc\uff0c\u6709\u6548\u907f\u5f00\u62e5\u5835\u533a\u57df\u3002":[1]},"counts_by_year":[{"year":2014,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-09-26T08:19:03.415552","created_date":"2016-06-24T00:00:00"}