{"id":"https://openalex.org/W4313341210","doi":"https://doi.org/10.1007/978-3-031-23741-6_1","title":"A Fast Shortest Path Searching Method Based on A* and Simulated Annealing","display_name":"A Fast Shortest Path Searching Method Based on A* and Simulated Annealing","publication_year":2022,"publication_date":"2022-01-01","ids":{"openalex":"https://openalex.org/W4313341210","doi":"https://doi.org/10.1007/978-3-031-23741-6_1"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-031-23741-6_1","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-031-23741-6_1","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"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":"Lecture Notes in Computer 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/A5036789652","display_name":"Qiang Cui","orcid":"https://orcid.org/0000-0001-6214-5211"},"institutions":[{"id":"https://openalex.org/I4210138233","display_name":"Beijing Urban Systems Engineering Research Center","ror":"https://ror.org/03cxfcq46","country_code":"CN","type":"facility","lineage":["https://openalex.org/I4210138233"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Qiang Cui","raw_affiliation_strings":["Systems Engineering Research Institute, Beijing, China"],"affiliations":[{"raw_affiliation_string":"Systems Engineering Research Institute, Beijing, China","institution_ids":["https://openalex.org/I4210138233"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5043413161","display_name":"Sihua Gao","orcid":null},"institutions":[{"id":"https://openalex.org/I28813325","display_name":"Civil Aviation University of China","ror":"https://ror.org/03je71k37","country_code":"CN","type":"education","lineage":["https://openalex.org/I28813325"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Sihua Gao","raw_affiliation_strings":["School of Computer Science and Technology, Civil Aviation University of China, Tianjin, China"],"affiliations":[{"raw_affiliation_string":"School of Computer Science and Technology, Civil Aviation University of China, Tianjin, China","institution_ids":["https://openalex.org/I28813325"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5043413161"],"corresponding_institution_ids":["https://openalex.org/I28813325"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.39718163,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"3","last_page":"14"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9998000264167786,"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.9998000264167786,"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/T10757","display_name":"Geographic Information Systems Studies","score":0.9915000200271606,"subfield":{"id":"https://openalex.org/subfields/3305","display_name":"Geography, Planning and Development"},"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/T10317","display_name":"Advanced Database Systems and Queries","score":0.9868999719619751,"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.873969554901123},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.7601526975631714},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7539793252944946},{"id":"https://openalex.org/keywords/constrained-shortest-path-first","display_name":"Constrained Shortest Path First","score":0.737117350101471},{"id":"https://openalex.org/keywords/simulated-annealing","display_name":"Simulated annealing","score":0.6160323619842529},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6142089366912842},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5533699989318848},{"id":"https://openalex.org/keywords/yens-algorithm","display_name":"Yen's algorithm","score":0.5402881503105164},{"id":"https://openalex.org/keywords/average-path-length","display_name":"Average path length","score":0.5318484306335449},{"id":"https://openalex.org/keywords/shortest-path-faster-algorithm","display_name":"Shortest Path Faster Algorithm","score":0.5142269134521484},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.5135350227355957},{"id":"https://openalex.org/keywords/local-optimum","display_name":"Local optimum","score":0.4646448791027069},{"id":"https://openalex.org/keywords/longest-path-problem","display_name":"Longest path problem","score":0.4213595390319824},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.31397682428359985},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.2652460038661957},{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.22327053546905518},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1654125154018402},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.12269970774650574},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.10165143013000488}],"concepts":[{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.873969554901123},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.7601526975631714},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7539793252944946},{"id":"https://openalex.org/C178067994","wikidata":"https://www.wikidata.org/wiki/Q1128278","display_name":"Constrained Shortest Path First","level":5,"score":0.737117350101471},{"id":"https://openalex.org/C126980161","wikidata":"https://www.wikidata.org/wiki/Q863783","display_name":"Simulated annealing","level":2,"score":0.6160323619842529},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6142089366912842},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5533699989318848},{"id":"https://openalex.org/C119971455","wikidata":"https://www.wikidata.org/wiki/Q8052172","display_name":"Yen's algorithm","level":5,"score":0.5402881503105164},{"id":"https://openalex.org/C91886571","wikidata":"https://www.wikidata.org/wiki/Q432520","display_name":"Average path length","level":4,"score":0.5318484306335449},{"id":"https://openalex.org/C168451585","wikidata":"https://www.wikidata.org/wiki/Q7502159","display_name":"Shortest Path Faster Algorithm","level":5,"score":0.5142269134521484},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.5135350227355957},{"id":"https://openalex.org/C141934464","wikidata":"https://www.wikidata.org/wiki/Q3305386","display_name":"Local optimum","level":2,"score":0.4646448791027069},{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.4213595390319824},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.31397682428359985},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2652460038661957},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.22327053546905518},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1654125154018402},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.12269970774650574},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.10165143013000488},{"id":"https://openalex.org/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","level":1,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/978-3-031-23741-6_1","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-031-23741-6_1","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"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":"Lecture Notes in Computer Science","raw_type":"book-chapter"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.41999998688697815,"display_name":"Industry, innovation and infrastructure","id":"https://metadata.un.org/sdg/9"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":7,"referenced_works":["https://openalex.org/W64567977","https://openalex.org/W1969483458","https://openalex.org/W2024060531","https://openalex.org/W2061594663","https://openalex.org/W2155992093","https://openalex.org/W2168148394","https://openalex.org/W2342853870"],"related_works":["https://openalex.org/W2156431668","https://openalex.org/W2030169809","https://openalex.org/W2018146256","https://openalex.org/W2348601012","https://openalex.org/W2144050074","https://openalex.org/W2369379323","https://openalex.org/W1990957023","https://openalex.org/W2359382971","https://openalex.org/W2469035159","https://openalex.org/W2349797546"],"abstract_inverted_index":null,"counts_by_year":[],"updated_date":"2026-01-20T17:24:06.736184","created_date":"2025-10-10T00:00:00"}