{"id":"https://openalex.org/W7153055303","doi":"https://doi.org/10.1016/j.tcs.2026.115962","title":"The ripple-spreading algorithm for shortest path tour problems","display_name":"The ripple-spreading algorithm for shortest path tour problems","publication_year":2026,"publication_date":"2026-04-10","ids":{"openalex":"https://openalex.org/W7153055303","doi":"https://doi.org/10.1016/j.tcs.2026.115962"},"language":"en","primary_location":{"id":"doi:10.1016/j.tcs.2026.115962","is_oa":false,"landing_page_url":"https://doi.org/10.1016/j.tcs.2026.115962","pdf_url":null,"source":{"id":"https://openalex.org/S90727058","display_name":"Theoretical Computer Science","issn_l":"0304-3975","issn":["0304-3975","1879-2294"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theoretical Computer Science","raw_type":"journal-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/A5133379389","display_name":"Yiming Ma","orcid":null},"institutions":[{"id":"https://openalex.org/I82880672","display_name":"Beihang University","ror":"https://ror.org/00wk2mp56","country_code":"CN","type":"education","lineage":["https://openalex.org/I82880672"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Yiming Ma","raw_affiliation_strings":["School of Economics and Management, Beihang University, Beijing, 100191, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Economics and Management, Beihang University, Beijing, 100191, China","institution_ids":["https://openalex.org/I82880672"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5079907239","display_name":"Xiao\u2010Bing Hu","orcid":"https://orcid.org/0000-0002-1555-0684"},"institutions":[{"id":"https://openalex.org/I114234892","display_name":"Beijing Union University","ror":"https://ror.org/01hg31662","country_code":"CN","type":"education","lineage":["https://openalex.org/I114234892"]},{"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"]},{"id":"https://openalex.org/I39555362","display_name":"University of Warwick","ror":"https://ror.org/01a77tt86","country_code":"GB","type":"education","lineage":["https://openalex.org/I39555362"]}],"countries":["CN","GB"],"is_corresponding":true,"raw_author_name":"Xiao-Bing Hu","raw_affiliation_strings":["Collaborative Innovation Center of eTourism, Beijing Union University, Beijing,100101, China","College of Safety Science and Engineering, Civil Aviation University of China, Tianjin, 300300, China","School of Engineering, University of Warwick, Coventry,CV4 7AL, UK"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Collaborative Innovation Center of eTourism, Beijing Union University, Beijing,100101, China","institution_ids":["https://openalex.org/I114234892"]},{"raw_affiliation_string":"College of Safety Science and Engineering, Civil Aviation University of China, Tianjin, 300300, China","institution_ids":["https://openalex.org/I28813325"]},{"raw_affiliation_string":"School of Engineering, University of Warwick, Coventry,CV4 7AL, UK","institution_ids":["https://openalex.org/I39555362"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5133369906","display_name":"Hang Zhou","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":false,"raw_author_name":"Hang Zhou","raw_affiliation_strings":["Sino-European Institute of Aviation Engineering, Civil Aviation University of China, Tianjin,300300, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Sino-European Institute of Aviation Engineering, Civil Aviation University of China, Tianjin,300300, China","institution_ids":["https://openalex.org/I28813325"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5133326756","display_name":"Ying-Fei Zhang","orcid":null},"institutions":[{"id":"https://openalex.org/I192868223","display_name":"Zhengzhou University of Aeronautics","ror":"https://ror.org/01qjyzh50","country_code":"CN","type":"education","lineage":["https://openalex.org/I192868223"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Ying-Fei Zhang","raw_affiliation_strings":["School of Civil Aviation, Zhengzhou University of Aeronautics, Henan,450046, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Civil Aviation, Zhengzhou University of Aeronautics, Henan,450046, China","institution_ids":["https://openalex.org/I192868223"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5017991749","display_name":"Daqing Li","orcid":"https://orcid.org/0000-0003-3143-7750"},"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":"Da-Qing Li","raw_affiliation_strings":["College of Safety Science and Engineering, Civil Aviation University of China, Tianjin, 300300, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"College of Safety Science and Engineering, Civil Aviation University of China, Tianjin, 300300, China","institution_ids":["https://openalex.org/I28813325"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5029886326","display_name":"Gongpeng Zhang","orcid":"https://orcid.org/0000-0003-4836-2249"},"institutions":[{"id":"https://openalex.org/I114234892","display_name":"Beijing Union University","ror":"https://ror.org/01hg31662","country_code":"CN","type":"education","lineage":["https://openalex.org/I114234892"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Gong-Peng Zhang","raw_affiliation_strings":["Collaborative Innovation Center of eTourism, Beijing Union University, Beijing,100101, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Collaborative Innovation Center of eTourism, Beijing Union University, Beijing,100101, China","institution_ids":["https://openalex.org/I114234892"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5008902090","display_name":"Ezequiel A. Di Paolo","orcid":"https://orcid.org/0000-0002-3296-5021"},"institutions":[{"id":"https://openalex.org/I110594554","display_name":"Ikerbasque","ror":"https://ror.org/01cc3fy72","country_code":"ES","type":"other","lineage":["https://openalex.org/I110594554"]}],"countries":["ES"],"is_corresponding":false,"raw_author_name":"Ezequiel A Di Paolo","raw_affiliation_strings":["Ikerbasque, Basque Science Foundation, Centre for Research on Life, Mind and Society, University of the Basque Country, San Sebastian,20080, Spain"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Ikerbasque, Basque Science Foundation, Centre for Research on Life, Mind and Society, University of the Basque Country, San Sebastian,20080, Spain","institution_ids":["https://openalex.org/I110594554"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5056656974","display_name":"Mark S. Leeson","orcid":"https://orcid.org/0000-0003-0367-6228"},"institutions":[{"id":"https://openalex.org/I39555362","display_name":"University of Warwick","ror":"https://ror.org/01a77tt86","country_code":"GB","type":"education","lineage":["https://openalex.org/I39555362"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Mark S. Leeson","raw_affiliation_strings":["School of Engineering, University of Warwick, Coventry,CV4 7AL, UK"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Engineering, University of Warwick, Coventry,CV4 7AL, UK","institution_ids":["https://openalex.org/I39555362"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":8,"corresponding_author_ids":["https://openalex.org/A5079907239"],"corresponding_institution_ids":["https://openalex.org/I114234892","https://openalex.org/I28813325","https://openalex.org/I39555362"],"apc_list":{"value":2690,"currency":"USD","value_usd":2690},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.50698856,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"1075","issue":null,"first_page":"115962","last_page":"115962"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.15279999375343323,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.15279999375343323,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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/T11106","display_name":"Data Management and Algorithms","score":0.1428000032901764,"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/T12288","display_name":"Optimization and Search Problems","score":0.1225999966263771,"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/yens-algorithm","display_name":"Yen's algorithm","score":0.5771999955177307},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.5720000267028809},{"id":"https://openalex.org/keywords/shortest-path-faster-algorithm","display_name":"Shortest Path Faster Algorithm","score":0.5626999735832214},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.5440000295639038},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.45879998803138733},{"id":"https://openalex.org/keywords/euclidean-shortest-path","display_name":"Euclidean shortest path","score":0.3822000026702881},{"id":"https://openalex.org/keywords/constrained-shortest-path-first","display_name":"Constrained Shortest Path First","score":0.3736000061035156}],"concepts":[{"id":"https://openalex.org/C119971455","wikidata":"https://www.wikidata.org/wiki/Q8052172","display_name":"Yen's algorithm","level":5,"score":0.5771999955177307},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.5720000267028809},{"id":"https://openalex.org/C168451585","wikidata":"https://www.wikidata.org/wiki/Q7502159","display_name":"Shortest Path Faster Algorithm","level":5,"score":0.5626999735832214},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.5440000295639038},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5153999924659729},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5058000087738037},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.45879998803138733},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4180000126361847},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.39430001378059387},{"id":"https://openalex.org/C170836113","wikidata":"https://www.wikidata.org/wiki/Q5406126","display_name":"Euclidean shortest path","level":5,"score":0.3822000026702881},{"id":"https://openalex.org/C178067994","wikidata":"https://www.wikidata.org/wiki/Q1128278","display_name":"Constrained Shortest Path First","level":5,"score":0.3736000061035156},{"id":"https://openalex.org/C186065694","wikidata":"https://www.wikidata.org/wiki/Q1047576","display_name":"Floyd\u2013Warshall algorithm","level":5,"score":0.334199994802475},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.3133000135421753},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.30379998683929443},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.2833000123500824},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.28290000557899475},{"id":"https://openalex.org/C106516650","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm design","level":2,"score":0.2808000147342682},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.2768999934196472},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.2696000039577484},{"id":"https://openalex.org/C23394520","wikidata":"https://www.wikidata.org/wiki/Q4919350","display_name":"Shortest-path tree","level":3,"score":0.2587999999523163}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1016/j.tcs.2026.115962","is_oa":false,"landing_page_url":"https://doi.org/10.1016/j.tcs.2026.115962","pdf_url":null,"source":{"id":"https://openalex.org/S90727058","display_name":"Theoretical Computer Science","issn_l":"0304-3975","issn":["0304-3975","1879-2294"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theoretical Computer Science","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G8990299605","display_name":null,"funder_award_id":"2020KJ037","funder_id":"https://openalex.org/F4320326709","funder_display_name":"Tianjin Municipal Education Commission"}],"funders":[{"id":"https://openalex.org/F4320321001","display_name":"National Natural Science Foundation of China","ror":"https://ror.org/01h0zpd94"},{"id":"https://openalex.org/F4320326709","display_name":"Tianjin Municipal Education Commission","ror":null}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":31,"referenced_works":["https://openalex.org/W1969982063","https://openalex.org/W1992658674","https://openalex.org/W2007572995","https://openalex.org/W2011282943","https://openalex.org/W2017623265","https://openalex.org/W2058845836","https://openalex.org/W2073296515","https://openalex.org/W2089194229","https://openalex.org/W2122516422","https://openalex.org/W2159637648","https://openalex.org/W2160019827","https://openalex.org/W2169528473","https://openalex.org/W2203584209","https://openalex.org/W2260783129","https://openalex.org/W2336786694","https://openalex.org/W2638290217","https://openalex.org/W2886002802","https://openalex.org/W2909366371","https://openalex.org/W2945138318","https://openalex.org/W2971760385","https://openalex.org/W2976388213","https://openalex.org/W3112624924","https://openalex.org/W3137299218","https://openalex.org/W3165303568","https://openalex.org/W4224237592","https://openalex.org/W4289346132","https://openalex.org/W4292565479","https://openalex.org/W4319069705","https://openalex.org/W4362664520","https://openalex.org/W4391791260","https://openalex.org/W4406170727"],"related_works":[],"abstract_inverted_index":null,"counts_by_year":[],"updated_date":"2026-06-19T15:47:20.252518","created_date":"2026-04-11T00:00:00"}