{"id":"https://openalex.org/W4206961619","doi":"https://doi.org/10.1109/ssci50451.2021.9659891","title":"An Efficient Nature-Inspired Method to Solve the Shortest Path Tour Problem","display_name":"An Efficient Nature-Inspired Method to Solve the Shortest Path Tour Problem","publication_year":2021,"publication_date":"2021-12-05","ids":{"openalex":"https://openalex.org/W4206961619","doi":"https://doi.org/10.1109/ssci50451.2021.9659891"},"language":"en","primary_location":{"id":"doi:10.1109/ssci50451.2021.9659891","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ssci50451.2021.9659891","pdf_url":null,"source":{"id":"https://openalex.org/S4363604921","display_name":"2021 IEEE Symposium Series on Computational Intelligence (SSCI)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2021 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/A5101429471","display_name":"Yi-Ming Ma","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":"Yi-Ming Ma","raw_affiliation_strings":["Civil Aviation University of China,Sino-European Institute of Aviation Engineering,Tianjin,China","Sino-European Institute of Aviation Engineering, Civil Aviation University of China, Tianjin, China"],"affiliations":[{"raw_affiliation_string":"Civil Aviation University of China,Sino-European Institute of Aviation Engineering,Tianjin,China","institution_ids":["https://openalex.org/I28813325"]},{"raw_affiliation_string":"Sino-European Institute of Aviation Engineering, Civil Aviation University of China, Tianjin, China","institution_ids":["https://openalex.org/I28813325"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100649872","display_name":"Hang Zhou","orcid":"https://orcid.org/0000-0002-6879-1967"},"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 Zhou","raw_affiliation_strings":["Civil Aviation University of China,Sino-European Institute of Aviation Engineering,Tianjin,China","Sino-European Institute of Aviation Engineering, Civil Aviation University of China, Tianjin, China"],"affiliations":[{"raw_affiliation_string":"Civil Aviation University of China,Sino-European Institute of Aviation Engineering,Tianjin,China","institution_ids":["https://openalex.org/I28813325"]},{"raw_affiliation_string":"Sino-European Institute of Aviation Engineering, Civil Aviation University of China, Tianjin, China","institution_ids":["https://openalex.org/I28813325"]}]},{"author_position":"last","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":false,"raw_author_name":"Xiao-Bing Hu","raw_affiliation_strings":["Civil Aviation University of China,College of Safety Science and Engineering,Tianjin,China","College of Safety Science and Engineering, Civil Aviation University of China, Tianjin, China"],"affiliations":[{"raw_affiliation_string":"Civil Aviation University of China,College of Safety Science and Engineering,Tianjin,China","institution_ids":["https://openalex.org/I28813325"]},{"raw_affiliation_string":"College of Safety Science and Engineering, Civil Aviation University of China, Tianjin, China","institution_ids":["https://openalex.org/I28813325"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5101429471"],"corresponding_institution_ids":["https://openalex.org/I28813325"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.1950734,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"6","issue":null,"first_page":"1","last_page":"6"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10246","display_name":"Mobile Ad Hoc Networks","score":0.9957000017166138,"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"}},"topics":[{"id":"https://openalex.org/T10246","display_name":"Mobile Ad Hoc Networks","score":0.9957000017166138,"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"}},{"id":"https://openalex.org/T11133","display_name":"UAV Applications and Optimization","score":0.9919999837875366,"subfield":{"id":"https://openalex.org/subfields/2202","display_name":"Aerospace 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/T10761","display_name":"Vehicular Ad Hoc Networks (VANETs)","score":0.9901000261306763,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.7301144003868103},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.721616804599762},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.6957082152366638},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.5348623394966125},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.515540599822998},{"id":"https://openalex.org/keywords/redundancy","display_name":"Redundancy (engineering)","score":0.5043786764144897},{"id":"https://openalex.org/keywords/constrained-shortest-path-first","display_name":"Constrained Shortest Path First","score":0.5039824843406677},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.47566312551498413},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.45257821679115295},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.45106083154678345},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.41728144884109497},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.28308045864105225},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.22924643754959106},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.16936537623405457},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.1129906177520752}],"concepts":[{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.7301144003868103},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.721616804599762},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.6957082152366638},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.5348623394966125},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.515540599822998},{"id":"https://openalex.org/C152124472","wikidata":"https://www.wikidata.org/wiki/Q1204361","display_name":"Redundancy (engineering)","level":2,"score":0.5043786764144897},{"id":"https://openalex.org/C178067994","wikidata":"https://www.wikidata.org/wiki/Q1128278","display_name":"Constrained Shortest Path First","level":5,"score":0.5039824843406677},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.47566312551498413},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.45257821679115295},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.45106083154678345},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.41728144884109497},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.28308045864105225},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.22924643754959106},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.16936537623405457},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.1129906177520752},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","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},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.0},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.0},{"id":"https://openalex.org/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/ssci50451.2021.9659891","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ssci50451.2021.9659891","pdf_url":null,"source":{"id":"https://openalex.org/S4363604921","display_name":"2021 IEEE Symposium Series on Computational Intelligence (SSCI)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2021 IEEE Symposium Series on Computational Intelligence (SSCI)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Clean water and sanitation","id":"https://metadata.un.org/sdg/6","score":0.6299999952316284}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":16,"referenced_works":["https://openalex.org/W301824129","https://openalex.org/W1969483458","https://openalex.org/W2058845836","https://openalex.org/W2086778464","https://openalex.org/W2089194229","https://openalex.org/W2136285517","https://openalex.org/W2159637648","https://openalex.org/W2160019827","https://openalex.org/W2169528473","https://openalex.org/W2473012137","https://openalex.org/W2533221567","https://openalex.org/W2754446034","https://openalex.org/W2976388213","https://openalex.org/W3049676628","https://openalex.org/W4312512934","https://openalex.org/W6642555851"],"related_works":["https://openalex.org/W2198982833","https://openalex.org/W2767202586","https://openalex.org/W2523719706","https://openalex.org/W1990043277","https://openalex.org/W2375775343","https://openalex.org/W2171039275","https://openalex.org/W2388654557","https://openalex.org/W2018146256","https://openalex.org/W2388051136","https://openalex.org/W2364137215"],"abstract_inverted_index":{"The":[0,23,43,121,177],"shortest":[1,31,60,115],"path":[2,32],"tour":[3],"problem":[4],"(SPTP)":[5],"is":[6,27,46,55,85,124,131],"the":[7,30,47,59,74,114,156,162,173,200],"abstract":[8],"model":[9],"of":[10,25,50,65,175,180],"many":[11],"practical":[12],"applications,":[13],"such":[14],"as":[15],"network":[16],"function":[17],"virtualization":[18],"(NFV)":[19],"and":[20,67,102,150,207],"warehouse":[21],"management.":[22],"aim":[24],"SPTP":[26,89],"to":[28,87,112,117,126,154,171,198],"find":[29],"that":[33],"passes":[34],"multiple":[35],"disjoint":[36],"node":[37,127],"subsets":[38],"in":[39,69,90,108],"a":[40,81,109],"given":[41],"order.":[42],"challenging":[44],"part":[45],"computational":[48,178],"redundancy":[49],"existing":[51],"decomposition-based":[52],"algorithms,":[53],"which":[54],"caused":[56],"by":[57,73,97,160],"determining":[58],"paths":[61,116],"from":[62],"all":[63],"pairs":[64],"sources":[66],"destinations":[68],"each":[70,103],"subproblem.":[71],"Inspired":[72],"ripple":[75],"spreading":[76],"motions":[77],"on":[78,134,146,186],"water":[79],"surface,":[80],"ripple-spreading":[82],"algorithm":[83,159,195],"(RSA)":[84],"proposed":[86],"solve":[88],"this":[91],"paper.":[92],"RSA":[93,130,151,181],"outperforms":[94],"other":[95,184],"algorithms":[96,185],"forming":[98],"connections":[99,140],"among":[100],"subproblems,":[101],"subproblem":[104],"can":[105],"be":[106,155],"solved":[107],"single":[110],"run":[111],"determine":[113],"every":[118],"destination":[119],"node.":[120],"time":[122],"complexity":[123],"irrelevant":[125],"quantities,":[128],"so":[129],"more":[132],"efficient":[133],"large":[135],"scale":[136],"networks":[137],"with":[138,189,203],"sparse":[139],"theoretically.":[141],"Comparative":[142],"experiments":[143],"were":[144,169],"conducted":[145],"fully":[147],"random":[148],"networks,":[149],"was":[152],"validated":[153],"most":[157],"powerful":[158],"promoting":[161],"efficiency":[163,179,206],"several":[164],"times.":[165],"Additionally,":[166],"layered":[167,187],"graphs":[168,188],"designed":[170],"simulate":[172],"topology":[174],"NFV.":[176],"also":[182],"surpassed":[183],"various":[190],"parameters.":[191],"This":[192],"brand":[193],"new":[194],"should":[196],"help":[197],"endow":[199],"SPTP-related":[201],"problems":[202],"excellent":[204],"solving":[205],"scalability.":[208]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}