{"id":"https://openalex.org/W2093065591","doi":"https://doi.org/10.1109/coginf.2007.4341919","title":"Research on the Algorithm for K-Shortest Paths Problem based on A* in Complicated Network","display_name":"Research on the Algorithm for K-Shortest Paths Problem based on A* in Complicated Network","publication_year":2007,"publication_date":"2007-08-01","ids":{"openalex":"https://openalex.org/W2093065591","doi":"https://doi.org/10.1109/coginf.2007.4341919","mag":"2093065591"},"language":"en","primary_location":{"id":"doi:10.1109/coginf.2007.4341919","is_oa":false,"landing_page_url":"https://doi.org/10.1109/coginf.2007.4341919","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"6th IEEE International Conference on Cognitive Informatics","raw_type":"proceedings-article"},"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/A5084797400","display_name":"Lichao Chen","orcid":"https://orcid.org/0000-0001-7111-2630"},"institutions":[{"id":"https://openalex.org/I46305995","display_name":"Taiyuan University of Science and Technology","ror":"https://ror.org/01wcbdc92","country_code":"CN","type":"education","lineage":["https://openalex.org/I46305995"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Lichao Chen","raw_affiliation_strings":["Institute of Computer Science and Technology, Taiyuan University of Science and Technology, Taiyuan, Shanxi, China","Taiyuan University of Science and Technology, Taiyuan#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute of Computer Science and Technology, Taiyuan University of Science and Technology, Taiyuan, Shanxi, China","institution_ids":["https://openalex.org/I46305995"]},{"raw_affiliation_string":"Taiyuan University of Science and Technology, Taiyuan#TAB#","institution_ids":["https://openalex.org/I46305995"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5079510458","display_name":"Jia Liu","orcid":"https://orcid.org/0000-0003-2363-8798"},"institutions":[{"id":"https://openalex.org/I46305995","display_name":"Taiyuan University of Science and Technology","ror":"https://ror.org/01wcbdc92","country_code":"CN","type":"education","lineage":["https://openalex.org/I46305995"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Jia Liu","raw_affiliation_strings":["Institute of Computer Science and Technology, Taiyuan University of Science and Technology, Taiyuan, Shanxi, China","Taiyuan University of Science and Technology, Taiyuan#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute of Computer Science and Technology, Taiyuan University of Science and Technology, Taiyuan, Shanxi, China","institution_ids":["https://openalex.org/I46305995"]},{"raw_affiliation_string":"Taiyuan University of Science and Technology, Taiyuan#TAB#","institution_ids":["https://openalex.org/I46305995"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5078952133","display_name":"Yingjun Zhang","orcid":"https://orcid.org/0000-0003-4279-2715"},"institutions":[{"id":"https://openalex.org/I46305995","display_name":"Taiyuan University of Science and Technology","ror":"https://ror.org/01wcbdc92","country_code":"CN","type":"education","lineage":["https://openalex.org/I46305995"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Yingjun Zhang","raw_affiliation_strings":["Institute of Computer Science and Technology, Taiyuan University of Science and Technology, Taiyuan, Shanxi, China","Taiyuan University of Science and Technology, Taiyuan#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute of Computer Science and Technology, Taiyuan University of Science and Technology, Taiyuan, Shanxi, China","institution_ids":["https://openalex.org/I46305995"]},{"raw_affiliation_string":"Taiyuan University of Science and Technology, Taiyuan#TAB#","institution_ids":["https://openalex.org/I46305995"]}]},{"author_position":"last","author":{"id":null,"display_name":"Binhong Xie","orcid":null},"institutions":[{"id":"https://openalex.org/I46305995","display_name":"Taiyuan University of Science and Technology","ror":"https://ror.org/01wcbdc92","country_code":"CN","type":"education","lineage":["https://openalex.org/I46305995"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Binhong Xie","raw_affiliation_strings":["Institute of Computer Science and Technology, Taiyuan University of Science and Technology, Taiyuan, Shanxi, China","Taiyuan University of Science and Technology, Taiyuan#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute of Computer Science and Technology, Taiyuan University of Science and Technology, Taiyuan, Shanxi, China","institution_ids":["https://openalex.org/I46305995"]},{"raw_affiliation_string":"Taiyuan University of Science and Technology, Taiyuan#TAB#","institution_ids":["https://openalex.org/I46305995"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I46305995"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"419","last_page":"423"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9995999932289124,"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.9995999932289124,"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/T12292","display_name":"Graph Theory and Algorithms","score":0.9968000054359436,"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/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/floyd\u2013warshall-algorithm","display_name":"Floyd\u2013Warshall algorithm","score":0.6733487844467163},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6695002913475037},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5863215923309326},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.576336145401001},{"id":"https://openalex.org/keywords/shortest-path-faster-algorithm","display_name":"Shortest Path Faster Algorithm","score":0.5621393918991089},{"id":"https://openalex.org/keywords/yens-algorithm","display_name":"Yen's algorithm","score":0.4945063292980194},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.4808986186981201},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4618458151817322},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4599228799343109},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.45223328471183777},{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.36085036396980286},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.23394626379013062},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.23317238688468933}],"concepts":[{"id":"https://openalex.org/C186065694","wikidata":"https://www.wikidata.org/wiki/Q1047576","display_name":"Floyd\u2013Warshall algorithm","level":5,"score":0.6733487844467163},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6695002913475037},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5863215923309326},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.576336145401001},{"id":"https://openalex.org/C168451585","wikidata":"https://www.wikidata.org/wiki/Q7502159","display_name":"Shortest Path Faster Algorithm","level":5,"score":0.5621393918991089},{"id":"https://openalex.org/C119971455","wikidata":"https://www.wikidata.org/wiki/Q8052172","display_name":"Yen's algorithm","level":5,"score":0.4945063292980194},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.4808986186981201},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4618458151817322},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4599228799343109},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.45223328471183777},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.36085036396980286},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.23394626379013062},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.23317238688468933},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/coginf.2007.4341919","is_oa":false,"landing_page_url":"https://doi.org/10.1109/coginf.2007.4341919","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"6th IEEE International Conference on Cognitive Informatics","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W1573274190","https://openalex.org/W1773616669","https://openalex.org/W1871367359","https://openalex.org/W1964948588","https://openalex.org/W2009862698","https://openalex.org/W2014317399","https://openalex.org/W2016241286","https://openalex.org/W2023766747","https://openalex.org/W2066999271","https://openalex.org/W2087989168","https://openalex.org/W2099123195","https://openalex.org/W2146015339","https://openalex.org/W2369235478","https://openalex.org/W3137299218"],"related_works":["https://openalex.org/W2381419702","https://openalex.org/W2810620529","https://openalex.org/W2136320479","https://openalex.org/W4253588386","https://openalex.org/W2372677512","https://openalex.org/W2170980056","https://openalex.org/W2348177054","https://openalex.org/W1508906807","https://openalex.org/W2147862592","https://openalex.org/W2387829241"],"abstract_inverted_index":{"Focusing":[0],"on":[1,24,57],"the":[2,16,29,38,41,50,68],"optimization":[3],"problems":[4,71],"about":[5],"complicated":[6,21],"network,":[7],"this":[8],"paper":[9],"presents":[10],"an":[11,54],"algorithm":[12],"KSPA":[13,52],"to":[14,66],"solve":[15,67],"K-shortest":[17,69],"paths":[18,70],"problem":[19],"in":[20,27,72],"network":[22],"based":[23],"A*":[25],"algorithm,":[26],"which":[28],"time":[30],"cost":[31],"is":[32,45],"taken":[33],"as":[34],"target":[35,42],"function":[36,43],"and":[37],"establishment":[39],"of":[40],"model":[44],"given.":[46],"Experimental":[47],"results":[48],"show":[49],"proposed":[51],"maintains":[53],"excellent":[55],"efficiency":[56],"certain":[58],"public":[59],"traffic":[60],"data.":[61],"It":[62],"can":[63],"be":[64],"used":[65],"multi-graph.":[73]},"counts_by_year":[{"year":2017,"cited_by_count":1}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}