{"id":"https://openalex.org/W2912657179","doi":"https://doi.org/10.1109/ssci.2018.8628928","title":"Finding the k Shortest Paths for Co-Evolutionary Path Optimization","display_name":"Finding the k Shortest Paths for Co-Evolutionary Path Optimization","publication_year":2018,"publication_date":"2018-11-01","ids":{"openalex":"https://openalex.org/W2912657179","doi":"https://doi.org/10.1109/ssci.2018.8628928","mag":"2912657179"},"language":"en","primary_location":{"id":"doi:10.1109/ssci.2018.8628928","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ssci.2018.8628928","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 IEEE Symposium Series on Computational Intelligence (SSCI)","raw_type":"proceedings-article"},"type":"article","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/A5101945716","display_name":"Xiaobing Hu","orcid":"https://orcid.org/0000-0003-2360-2090"},"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":"Xiao-Bing Hu","raw_affiliation_strings":["China-France Joint Research Center of Applied Mathematics for Air Traffic Management, Tianjin Key Laboratory for Advanced Signal Processing, College of Electronic Information and Automation, Civil Aviation University of China, Tianjin, China"],"affiliations":[{"raw_affiliation_string":"China-France Joint Research Center of Applied Mathematics for Air Traffic Management, Tianjin Key Laboratory for Advanced Signal Processing, College of Electronic Information and Automation, Civil Aviation University of China, Tianjin, China","institution_ids":["https://openalex.org/I28813325"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5104087104","display_name":"Jun Zhou","orcid":"https://orcid.org/0009-0002-4135-7869"},"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":false,"raw_author_name":"Jun Zhou","raw_affiliation_strings":["China-France Joint Research Center of Applied Mathematics for Air Traffic Management, Tianjin Key Laboratory for Advanced Signal Processing, College of Electronic Information and Automation, Civil Aviation University of China, Tianjin, China"],"affiliations":[{"raw_affiliation_string":"China-France Joint Research Center of Applied Mathematics for Air Traffic Management, Tianjin Key Laboratory for Advanced Signal Processing, College of Electronic Information and Automation, Civil Aviation University of China, Tianjin, China","institution_ids":["https://openalex.org/I28813325"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100455139","display_name":"Hang Li","orcid":"https://orcid.org/0000-0002-6221-6195"},"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":false,"raw_author_name":"Hang Li","raw_affiliation_strings":["China-France Joint Research Center of Applied Mathematics for Air Traffic Management, Tianjin Key Laboratory for Advanced Signal Processing, College of Electronic Information and Automation, Civil Aviation University of China, Tianjin, China"],"affiliations":[{"raw_affiliation_string":"China-France Joint Research Center of Applied Mathematics for Air Traffic Management, Tianjin Key Laboratory for Advanced Signal Processing, College of Electronic Information and Automation, Civil Aviation University of China, Tianjin, China","institution_ids":["https://openalex.org/I28813325"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5008097973","display_name":"Ming-Kong Zhang","orcid":null},"institutions":[{"id":"https://openalex.org/I25254941","display_name":"Beijing Normal University","ror":"https://ror.org/022k4wk35","country_code":"CN","type":"education","lineage":["https://openalex.org/I25254941"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Ming-Kong Zhang","raw_affiliation_strings":["Academy of Disaster Reduction and Emergence Management, Faculty of Geographic Science, Beijing, Jian-Qin Liao Chengdu MiidShare Technology Ltd Chengdu, Beijing Normal University, China"],"affiliations":[{"raw_affiliation_string":"Academy of Disaster Reduction and Emergence Management, Faculty of Geographic Science, Beijing, Jian-Qin Liao Chengdu MiidShare Technology Ltd Chengdu, Beijing Normal University, China","institution_ids":["https://openalex.org/I25254941"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5076523879","display_name":"Jian-Qin Liao","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Jian-Qin Liao","raw_affiliation_strings":["Chengdu MiidShare Technol. Ltd., Chengdu, China"],"affiliations":[{"raw_affiliation_string":"Chengdu MiidShare Technol. Ltd., Chengdu, China","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5101945716"],"corresponding_institution_ids":["https://openalex.org/I28813325"],"apc_list":null,"apc_paid":null,"fwci":0.1288,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.51952994,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"1","issue":null,"first_page":"1906","last_page":"1912"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10847","display_name":"Advanced Optical Network Technologies","score":0.9829000234603882,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10847","display_name":"Advanced Optical Network Technologies","score":0.9829000234603882,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic 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/T10698","display_name":"Transportation Planning and Optimization","score":0.9606999754905701,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9314000010490417,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing 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-problem","display_name":"Shortest path problem","score":0.8407959938049316},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.7710229158401489},{"id":"https://openalex.org/keywords/constrained-shortest-path-first","display_name":"Constrained Shortest Path First","score":0.7574900388717651},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6279728412628174},{"id":"https://openalex.org/keywords/relay","display_name":"Relay","score":0.6133116483688354},{"id":"https://openalex.org/keywords/private-network-to-network-interface","display_name":"Private Network-to-Network Interface","score":0.5779527425765991},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.5519428253173828},{"id":"https://openalex.org/keywords/equal-cost-multi-path-routing","display_name":"Equal-cost multi-path routing","score":0.5474739670753479},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5338056683540344},{"id":"https://openalex.org/keywords/yens-algorithm","display_name":"Yen's algorithm","score":0.5029615759849548},{"id":"https://openalex.org/keywords/shortest-path-faster-algorithm","display_name":"Shortest Path Faster Algorithm","score":0.48411664366722107},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.47752654552459717},{"id":"https://openalex.org/keywords/average-path-length","display_name":"Average path length","score":0.44755908846855164},{"id":"https://openalex.org/keywords/ripple","display_name":"Ripple","score":0.4433509409427643},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.36538881063461304},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.330893337726593},{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.3132203221321106},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2682875394821167},{"id":"https://openalex.org/keywords/link-state-routing-protocol","display_name":"Link-state routing protocol","score":0.24824774265289307},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.16932028532028198},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.15472114086151123},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.12664860486984253},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.06838804483413696}],"concepts":[{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.8407959938049316},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.7710229158401489},{"id":"https://openalex.org/C178067994","wikidata":"https://www.wikidata.org/wiki/Q1128278","display_name":"Constrained Shortest Path First","level":5,"score":0.7574900388717651},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6279728412628174},{"id":"https://openalex.org/C2778156585","wikidata":"https://www.wikidata.org/wiki/Q174053","display_name":"Relay","level":3,"score":0.6133116483688354},{"id":"https://openalex.org/C204348804","wikidata":"https://www.wikidata.org/wiki/Q3888133","display_name":"Private Network-to-Network Interface","level":5,"score":0.5779527425765991},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.5519428253173828},{"id":"https://openalex.org/C115443555","wikidata":"https://www.wikidata.org/wiki/Q5367790","display_name":"Equal-cost multi-path routing","level":5,"score":0.5474739670753479},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5338056683540344},{"id":"https://openalex.org/C119971455","wikidata":"https://www.wikidata.org/wiki/Q8052172","display_name":"Yen's algorithm","level":5,"score":0.5029615759849548},{"id":"https://openalex.org/C168451585","wikidata":"https://www.wikidata.org/wiki/Q7502159","display_name":"Shortest Path Faster Algorithm","level":5,"score":0.48411664366722107},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.47752654552459717},{"id":"https://openalex.org/C91886571","wikidata":"https://www.wikidata.org/wiki/Q432520","display_name":"Average path length","level":4,"score":0.44755908846855164},{"id":"https://openalex.org/C2779599953","wikidata":"https://www.wikidata.org/wiki/Q1776117","display_name":"Ripple","level":3,"score":0.4433509409427643},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.36538881063461304},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.330893337726593},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.3132203221321106},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2682875394821167},{"id":"https://openalex.org/C89305328","wikidata":"https://www.wikidata.org/wiki/Q1755411","display_name":"Link-state routing protocol","level":4,"score":0.24824774265289307},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.16932028532028198},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.15472114086151123},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.12664860486984253},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.06838804483413696},{"id":"https://openalex.org/C163258240","wikidata":"https://www.wikidata.org/wiki/Q25342","display_name":"Power (physics)","level":2,"score":0.0},{"id":"https://openalex.org/C165801399","wikidata":"https://www.wikidata.org/wiki/Q25428","display_name":"Voltage","level":2,"score":0.0},{"id":"https://openalex.org/C119599485","wikidata":"https://www.wikidata.org/wiki/Q43035","display_name":"Electrical engineering","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/ssci.2018.8628928","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ssci.2018.8628928","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 IEEE Symposium Series on Computational Intelligence (SSCI)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/15","score":0.4300000071525574,"display_name":"Life in Land"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":34,"referenced_works":["https://openalex.org/W1601277319","https://openalex.org/W1604909471","https://openalex.org/W1659842140","https://openalex.org/W1969982063","https://openalex.org/W1971965514","https://openalex.org/W1985327268","https://openalex.org/W1994569469","https://openalex.org/W2001707490","https://openalex.org/W2011282943","https://openalex.org/W2023766747","https://openalex.org/W2028953698","https://openalex.org/W2030169809","https://openalex.org/W2048699920","https://openalex.org/W2049354208","https://openalex.org/W2050560064","https://openalex.org/W2069035522","https://openalex.org/W2069752825","https://openalex.org/W2082298232","https://openalex.org/W2087989168","https://openalex.org/W2089338760","https://openalex.org/W2089845007","https://openalex.org/W2094004254","https://openalex.org/W2105217850","https://openalex.org/W2121101044","https://openalex.org/W2122410182","https://openalex.org/W2122516422","https://openalex.org/W2131058166","https://openalex.org/W2134531349","https://openalex.org/W2160019827","https://openalex.org/W2170060541","https://openalex.org/W2507217121","https://openalex.org/W2638290217","https://openalex.org/W3123372836","https://openalex.org/W6646782349"],"related_works":["https://openalex.org/W2368964068","https://openalex.org/W2156431668","https://openalex.org/W2030169809","https://openalex.org/W2523719706","https://openalex.org/W2366342492","https://openalex.org/W2357391150","https://openalex.org/W2161960576","https://openalex.org/W2388051136","https://openalex.org/W2353596372","https://openalex.org/W2392001488"],"abstract_inverted_index":{"Co-evolutionary":[0],"path":[1,99],"optimization":[2],"(CEPO)":[3],"was":[4,21],"recently":[5],"proposed":[6],"to":[7,45,50,81,111],"calculate":[8,51],"optimal":[9],"actual":[10],"traveling":[11],"trajectory":[12],"in":[13,58,100],"a":[14,35,59,65,101,108,124],"given":[15,60,102],"dynamic":[16,61,103],"routing":[17,62,104],"environment,":[18,63],"and":[19],"it":[20],"originally":[22],"focused":[23],"on":[24,131],"the":[25,52,87,96,138,146,152],"1st":[26,97],"shortest":[27,54,75,98],"path.":[28],"This":[29,114],"paper,":[30],"by":[31,122],"taking":[32],"advantage":[33],"of":[34,68,118,127,140],"relatively":[36],"new":[37],"nature-inspired":[38],"method,":[39],"i.e.,":[40],"ripple-spreading":[41],"algorithm":[42,49],"(RSA),":[43],"attempts":[44],"develop":[46],"an":[47,132],"effective":[48],"k":[53,74,91],"paths":[55,76],"for":[56,72,90,95,154],"CEPO":[57],"with":[64],"theoretical":[66],"guarantee":[67,112],"optimality.":[69,113],"Existing":[70,93],"methods":[71,94],"static":[73],"problem":[77],"(k-SPP)":[78],"often":[79],"need":[80,107],"reconstruct":[82],"route":[83],"networks":[84],"or":[85],"sweep":[86],"original":[88],"network":[89],"times.":[92],"environment":[105],"usually":[106],"memory-expensive":[109],"hyper-graph":[110],"paper":[115],"needs":[116],"none":[117],"above":[119],"measures,":[120],"but":[121],"just":[123],"single":[125],"run":[126],"ripple":[128],"relay":[129],"race":[130],"original-sized":[133],"network,":[134],"can":[135,149],"well":[136],"resolve":[137],"k-SPP":[139,153],"CEPO.":[141,155],"Experimental":[142],"results":[143],"demonstrate":[144],"that":[145],"reported":[147],"RSA":[148],"effectively":[150],"address":[151]},"counts_by_year":[{"year":2023,"cited_by_count":2},{"year":2021,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}