{"id":"https://openalex.org/W171717501","doi":"https://doi.org/10.1007/978-3-642-16336-4_37","title":"Test and Implement of a Parallel Shortest Path Calculation System for Traffic Network","display_name":"Test and Implement of a Parallel Shortest Path Calculation System for Traffic Network","publication_year":2010,"publication_date":"2010-01-01","ids":{"openalex":"https://openalex.org/W171717501","doi":"https://doi.org/10.1007/978-3-642-16336-4_37","mag":"171717501"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-642-16336-4_37","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-16336-4_37","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":"book-chapter","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/A5013925708","display_name":"Lin Zhang","orcid":"https://orcid.org/0000-0001-9544-0399"},"institutions":[{"id":"https://openalex.org/I4210120584","display_name":"Polytechnic University","ror":"https://ror.org/02f0psx94","country_code":"JP","type":"education","lineage":["https://openalex.org/I4210120584"]}],"countries":["JP"],"is_corresponding":true,"raw_author_name":"Lin Zhang","raw_affiliation_strings":["Hebei Polytechnic University, Tangshan, 063009, Hebei Province, China","HeBei Polytechnic University)"],"affiliations":[{"raw_affiliation_string":"Hebei Polytechnic University, Tangshan, 063009, Hebei Province, China","institution_ids":[]},{"raw_affiliation_string":"HeBei Polytechnic University)","institution_ids":["https://openalex.org/I4210120584"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5077707700","display_name":"Zhaosheng Yang","orcid":null},"institutions":[{"id":"https://openalex.org/I4210136497","display_name":"Jilin Medical University","ror":"https://ror.org/03mzw7781","country_code":"CN","type":"education","lineage":["https://openalex.org/I4210136497"]},{"id":"https://openalex.org/I194450716","display_name":"Jilin University","ror":"https://ror.org/00js3aw79","country_code":"CN","type":"education","lineage":["https://openalex.org/I194450716"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Zhaosheng Yang","raw_affiliation_strings":["Jilin University, No. 5988 Renmin Street, Changchun, Jilin Province, China","jilin University"],"affiliations":[{"raw_affiliation_string":"Jilin University, No. 5988 Renmin Street, Changchun, Jilin Province, China","institution_ids":["https://openalex.org/I194450716"]},{"raw_affiliation_string":"jilin University","institution_ids":["https://openalex.org/I4210136497"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5079627298","display_name":"Hongmei Jia","orcid":"https://orcid.org/0000-0002-1412-8158"},"institutions":[{"id":"https://openalex.org/I4210120584","display_name":"Polytechnic University","ror":"https://ror.org/02f0psx94","country_code":"JP","type":"education","lineage":["https://openalex.org/I4210120584"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Hongmei Jia","raw_affiliation_strings":["Hebei Polytechnic University, Tangshan, 063009, Hebei Province, China","HeBei Polytechnic University)"],"affiliations":[{"raw_affiliation_string":"Hebei Polytechnic University, Tangshan, 063009, Hebei Province, China","institution_ids":[]},{"raw_affiliation_string":"HeBei Polytechnic University)","institution_ids":["https://openalex.org/I4210120584"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5018251349","display_name":"Bin Wang","orcid":"https://orcid.org/0000-0002-5386-4975"},"institutions":[{"id":"https://openalex.org/I4210120584","display_name":"Polytechnic University","ror":"https://ror.org/02f0psx94","country_code":"JP","type":"education","lineage":["https://openalex.org/I4210120584"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Bin Wang","raw_affiliation_strings":["Hebei Polytechnic University, Tangshan, 063009, Hebei Province, China","HeBei Polytechnic University)"],"affiliations":[{"raw_affiliation_string":"Hebei Polytechnic University, Tangshan, 063009, Hebei Province, China","institution_ids":[]},{"raw_affiliation_string":"HeBei Polytechnic University)","institution_ids":["https://openalex.org/I4210120584"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5100323035","display_name":"Guang Chen","orcid":"https://orcid.org/0000-0002-5964-6530"},"institutions":[{"id":"https://openalex.org/I4210120584","display_name":"Polytechnic University","ror":"https://ror.org/02f0psx94","country_code":"JP","type":"education","lineage":["https://openalex.org/I4210120584"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Guang Chen","raw_affiliation_strings":["Hebei Polytechnic University, Tangshan, 063009, Hebei Province, China","HeBei Polytechnic University)"],"affiliations":[{"raw_affiliation_string":"Hebei Polytechnic University, Tangshan, 063009, Hebei Province, China","institution_ids":[]},{"raw_affiliation_string":"HeBei Polytechnic University)","institution_ids":["https://openalex.org/I4210120584"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5013925708"],"corresponding_institution_ids":["https://openalex.org/I4210120584"],"apc_list":null,"apc_paid":null,"fwci":3.2356,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.92714777,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"282","last_page":"288"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10698","display_name":"Transportation Planning and Optimization","score":0.9986000061035156,"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.9986000061035156,"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/T11344","display_name":"Traffic Prediction and Management Techniques","score":0.9979000091552734,"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/T10138","display_name":"Network Traffic and Congestion Control","score":0.9969000220298767,"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/constrained-shortest-path-first","display_name":"Constrained Shortest Path First","score":0.8137146234512329},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.810495913028717},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7031912803649902},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.6073889136314392},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.5422282218933105},{"id":"https://openalex.org/keywords/queue","display_name":"Queue","score":0.5069072842597961},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5065606832504272},{"id":"https://openalex.org/keywords/bisection","display_name":"Bisection","score":0.49782419204711914},{"id":"https://openalex.org/keywords/decomposition","display_name":"Decomposition","score":0.44106048345565796},{"id":"https://openalex.org/keywords/yens-algorithm","display_name":"Yen's algorithm","score":0.43751275539398193},{"id":"https://openalex.org/keywords/bisection-method","display_name":"Bisection method","score":0.4249069094657898},{"id":"https://openalex.org/keywords/priority-queue","display_name":"Priority queue","score":0.41638824343681335},{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.41561973094940186},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.38014620542526245},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.2740200161933899},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.22452935576438904},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.17816612124443054},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.13771909475326538}],"concepts":[{"id":"https://openalex.org/C178067994","wikidata":"https://www.wikidata.org/wiki/Q1128278","display_name":"Constrained Shortest Path First","level":5,"score":0.8137146234512329},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.810495913028717},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7031912803649902},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.6073889136314392},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.5422282218933105},{"id":"https://openalex.org/C160403385","wikidata":"https://www.wikidata.org/wiki/Q220543","display_name":"Queue","level":2,"score":0.5069072842597961},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5065606832504272},{"id":"https://openalex.org/C31599958","wikidata":"https://www.wikidata.org/wiki/Q3128632","display_name":"Bisection","level":2,"score":0.49782419204711914},{"id":"https://openalex.org/C124681953","wikidata":"https://www.wikidata.org/wiki/Q339062","display_name":"Decomposition","level":2,"score":0.44106048345565796},{"id":"https://openalex.org/C119971455","wikidata":"https://www.wikidata.org/wiki/Q8052172","display_name":"Yen's algorithm","level":5,"score":0.43751275539398193},{"id":"https://openalex.org/C157544257","wikidata":"https://www.wikidata.org/wiki/Q866300","display_name":"Bisection method","level":2,"score":0.4249069094657898},{"id":"https://openalex.org/C26951474","wikidata":"https://www.wikidata.org/wiki/Q629283","display_name":"Priority queue","level":3,"score":0.41638824343681335},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.41561973094940186},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.38014620542526245},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2740200161933899},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.22452935576438904},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.17816612124443054},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.13771909475326538},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C18903297","wikidata":"https://www.wikidata.org/wiki/Q7150","display_name":"Ecology","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/978-3-642-16336-4_37","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-16336-4_37","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":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W1504337120","https://openalex.org/W1528970839","https://openalex.org/W1976029741","https://openalex.org/W1993229082","https://openalex.org/W2059586807","https://openalex.org/W2073890622","https://openalex.org/W2081873092","https://openalex.org/W2107940287","https://openalex.org/W2118237238","https://openalex.org/W2131717600","https://openalex.org/W2170403650","https://openalex.org/W2800536540","https://openalex.org/W4251656402"],"related_works":["https://openalex.org/W3183360588","https://openalex.org/W2368964068","https://openalex.org/W2810620529","https://openalex.org/W2353519994","https://openalex.org/W2384965074","https://openalex.org/W4321491762","https://openalex.org/W2381419702","https://openalex.org/W2371954259","https://openalex.org/W2395868876","https://openalex.org/W2378193903"],"abstract_inverted_index":null,"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2013,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}