{"id":"https://openalex.org/W4388645991","doi":"https://doi.org/10.1007/s40747-023-01260-8","title":"Ripple spreading algorithm: a new method for solving multi-objective shortest path problems with mixed time windows","display_name":"Ripple spreading algorithm: a new method for solving multi-objective shortest path problems with mixed time windows","publication_year":2023,"publication_date":"2023-11-14","ids":{"openalex":"https://openalex.org/W4388645991","doi":"https://doi.org/10.1007/s40747-023-01260-8"},"language":"en","primary_location":{"id":"doi:10.1007/s40747-023-01260-8","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s40747-023-01260-8","pdf_url":"https://link.springer.com/content/pdf/10.1007/s40747-023-01260-8.pdf","source":{"id":"https://openalex.org/S3035462843","display_name":"Complex & Intelligent Systems","issn_l":"2198-6053","issn":["2198-6053","2199-4536"],"is_oa":true,"is_in_doaj":true,"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":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Complex &amp; Intelligent Systems","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://link.springer.com/content/pdf/10.1007/s40747-023-01260-8.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5103000607","display_name":"Shilin Yu","orcid":"https://orcid.org/0000-0003-1284-8773"},"institutions":[{"id":"https://openalex.org/I4210165038","display_name":"University of Chinese Academy of Sciences","ror":"https://ror.org/05qbk4x57","country_code":"CN","type":"education","lineage":["https://openalex.org/I19820366","https://openalex.org/I4210165038"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Shilin Yu","raw_affiliation_strings":["School of Emergency Management Science and Engineering, University of Chinese Academy of Sciences, Beijing, 100049, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Emergency Management Science and Engineering, University of Chinese Academy of Sciences, Beijing, 100049, China","institution_ids":["https://openalex.org/I4210165038"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5074081147","display_name":"Yuantao Song","orcid":null},"institutions":[{"id":"https://openalex.org/I4210165038","display_name":"University of Chinese Academy of Sciences","ror":"https://ror.org/05qbk4x57","country_code":"CN","type":"education","lineage":["https://openalex.org/I19820366","https://openalex.org/I4210165038"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Yuantao Song","raw_affiliation_strings":["School of Emergency Management Science and Engineering, University of Chinese Academy of Sciences, Beijing, 100049, China"],"raw_orcid":"https://orcid.org/0000-0003-1172-3872","affiliations":[{"raw_affiliation_string":"School of Emergency Management Science and Engineering, University of Chinese Academy of Sciences, Beijing, 100049, China","institution_ids":["https://openalex.org/I4210165038"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5103000607"],"corresponding_institution_ids":["https://openalex.org/I4210165038"],"apc_list":{"value":1320,"currency":"GBP","value_usd":1619},"apc_paid":{"value":1320,"currency":"GBP","value_usd":1619},"fwci":1.736,"has_fulltext":true,"cited_by_count":9,"citation_normalized_percentile":{"value":0.83575685,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":97,"max":98},"biblio":{"volume":"10","issue":"2","first_page":"2299","last_page":"2325"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11500","display_name":"Evacuation and Crowd Dynamics","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/2212","display_name":"Ocean 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/T11500","display_name":"Evacuation and Crowd Dynamics","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/2212","display_name":"Ocean 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/T11502","display_name":"Facility Location and Emergency Management","score":0.9986000061035156,"subfield":{"id":"https://openalex.org/subfields/1407","display_name":"Organizational Behavior and Human Resource Management"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.989799976348877,"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.6468474268913269},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6434542536735535},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.590898871421814},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5109823942184448},{"id":"https://openalex.org/keywords/longest-path-problem","display_name":"Longest path problem","score":0.47383981943130493},{"id":"https://openalex.org/keywords/pareto-principle","display_name":"Pareto principle","score":0.46399661898612976},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4623405337333679},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.4521588683128357},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.44572460651397705},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.4166865348815918},{"id":"https://openalex.org/keywords/solution-set","display_name":"Solution set","score":0.4129272699356079},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.24175554513931274},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.20904487371444702},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.08168640732765198}],"concepts":[{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.6468474268913269},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6434542536735535},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.590898871421814},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5109823942184448},{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.47383981943130493},{"id":"https://openalex.org/C137635306","wikidata":"https://www.wikidata.org/wiki/Q182667","display_name":"Pareto principle","level":2,"score":0.46399661898612976},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4623405337333679},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.4521588683128357},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.44572460651397705},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.4166865348815918},{"id":"https://openalex.org/C60033838","wikidata":"https://www.wikidata.org/wiki/Q1751685","display_name":"Solution set","level":3,"score":0.4129272699356079},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.24175554513931274},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.20904487371444702},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.08168640732765198},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/s40747-023-01260-8","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s40747-023-01260-8","pdf_url":"https://link.springer.com/content/pdf/10.1007/s40747-023-01260-8.pdf","source":{"id":"https://openalex.org/S3035462843","display_name":"Complex & Intelligent Systems","issn_l":"2198-6053","issn":["2198-6053","2199-4536"],"is_oa":true,"is_in_doaj":true,"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":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Complex &amp; Intelligent Systems","raw_type":"journal-article"},{"id":"pmh:oai:doaj.org/article:751b087fe41f44f68b59e74458ca1f7b","is_oa":true,"landing_page_url":"https://doaj.org/article/751b087fe41f44f68b59e74458ca1f7b","pdf_url":null,"source":{"id":"https://openalex.org/S112646816","display_name":"SHILAP Revista de lepidopterolog\u00eda","issn_l":"0300-5267","issn":["0300-5267","2340-4078"],"is_oa":true,"is_in_doaj":true,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Complex & Intelligent Systems, Vol 10, Iss 2, Pp 2299-2325 (2023)","raw_type":"article"}],"best_oa_location":{"id":"doi:10.1007/s40747-023-01260-8","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s40747-023-01260-8","pdf_url":"https://link.springer.com/content/pdf/10.1007/s40747-023-01260-8.pdf","source":{"id":"https://openalex.org/S3035462843","display_name":"Complex & Intelligent Systems","issn_l":"2198-6053","issn":["2198-6053","2199-4536"],"is_oa":true,"is_in_doaj":true,"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":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Complex &amp; Intelligent Systems","raw_type":"journal-article"},"sustainable_development_goals":[{"display_name":"Climate action","score":0.7699999809265137,"id":"https://metadata.un.org/sdg/13"}],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":false},"content_urls":{"pdf":"https://content.openalex.org/works/W4388645991.pdf"},"referenced_works_count":58,"referenced_works":["https://openalex.org/W119169328","https://openalex.org/W145270132","https://openalex.org/W909896239","https://openalex.org/W1561435851","https://openalex.org/W1928381443","https://openalex.org/W1966110800","https://openalex.org/W1969982063","https://openalex.org/W1986697600","https://openalex.org/W1996261487","https://openalex.org/W1998062665","https://openalex.org/W1998259641","https://openalex.org/W2001308858","https://openalex.org/W2003846304","https://openalex.org/W2006819808","https://openalex.org/W2013525683","https://openalex.org/W2017598274","https://openalex.org/W2017694061","https://openalex.org/W2025640489","https://openalex.org/W2032394864","https://openalex.org/W2038927623","https://openalex.org/W2039591135","https://openalex.org/W2053900989","https://openalex.org/W2058725370","https://openalex.org/W2060882019","https://openalex.org/W2060912974","https://openalex.org/W2066426639","https://openalex.org/W2071852134","https://openalex.org/W2085041447","https://openalex.org/W2089939193","https://openalex.org/W2126105956","https://openalex.org/W2129997629","https://openalex.org/W2143381319","https://openalex.org/W2146189710","https://openalex.org/W2150046657","https://openalex.org/W2160019827","https://openalex.org/W2167159964","https://openalex.org/W2169528473","https://openalex.org/W2408262133","https://openalex.org/W2461541081","https://openalex.org/W2461759988","https://openalex.org/W2572760112","https://openalex.org/W2594045304","https://openalex.org/W2604854125","https://openalex.org/W2608239929","https://openalex.org/W2981896566","https://openalex.org/W2998786991","https://openalex.org/W3042166865","https://openalex.org/W3086651301","https://openalex.org/W3119684667","https://openalex.org/W3148921802","https://openalex.org/W3169870616","https://openalex.org/W4210316299","https://openalex.org/W4210773084","https://openalex.org/W4229964315","https://openalex.org/W4281708316","https://openalex.org/W4294811478","https://openalex.org/W4312720137","https://openalex.org/W4318433524"],"related_works":["https://openalex.org/W4382866750","https://openalex.org/W4293167680","https://openalex.org/W2776102956","https://openalex.org/W4387185483","https://openalex.org/W616034966","https://openalex.org/W2022506245","https://openalex.org/W2040572217","https://openalex.org/W2388410942","https://openalex.org/W4385965963","https://openalex.org/W2600678155"],"abstract_inverted_index":{"Abstract":[0],"In":[1,59],"emergency":[2,8,56,66,80,205],"management,":[3],"the":[4,17,36,45,72,79,87,92,97,111,123,152,158,195,212],"transportation":[5],"scheduling":[6],"of":[7,125,163,169,182,197,214],"supplies":[9,73],"and":[10,33,48,74,90,140,143,160,165,185,209,217],"relief":[11,207],"personnel":[12],"can":[13,210],"be":[14,147],"regarded":[15],"as":[16,82,84],"multi-objective":[18],"shortest":[19,88],"path":[20,57,128],"problem":[21],"with":[22,174],"mixed":[23],"time":[24,89,161],"window":[25],"(MOSPPMTW),":[26],"which":[27,51,69,109],"has":[28],"high":[29],"requirements":[30,213],"for":[31,55],"timeliness":[32],"effectiveness,":[34],"but":[35],"current":[37],"solution":[38,46,139,153,186],"algorithms":[39],"cannot":[40],"simultaneously":[41,70],"take":[42],"into":[43],"account":[44],"accuracy":[47],"computational":[49,183],"speed,":[50],"is":[52,190,201],"very":[53],"unfavorable":[54],"decision-making.":[58],"this":[60],"paper,":[61],"we":[62,102,156],"establish":[63],"MOSPPMTW":[64],"matching":[65],"rescue":[67],"scenarios,":[68],"enables":[71],"rescuers":[75],"to":[76,121,146,150,203],"arrive":[77],"at":[78,91],"scene":[81],"soon":[83],"possible":[85],"in":[86,180,194],"smallest":[93],"cost.":[94],"To":[95],"solve":[96],"complete":[98,112],"Pareto":[99,113,126],"optimal":[100,127],"surface,":[101],"present":[103],"a":[104,117],"ripple":[105,118],"spreading":[106],"algorithm":[107,133],"(RSA),":[108],"determines":[110],"frontier":[114],"by":[115],"performing":[116],"relay":[119],"race":[120],"obtain":[122,151],"set":[124],"solutions.":[129],"The":[130,188],"proposed":[131],"RSA":[132,164,177],"does":[134],"not":[135],"require":[136],"an":[137],"initial":[138],"iterative":[141],"iterations":[142],"only":[144],"needs":[145],"run":[148],"once":[149],"set.":[154],"Furthermore,":[155],"prove":[157],"optimality":[159],"complexity":[162],"conduct":[166],"multiple":[167],"sets":[168],"example":[170],"simulation":[171],"experiments.":[172],"Compared":[173],"other":[175],"algorithms,":[176],"performs":[178],"better":[179],"terms":[181],"speed":[184],"quality.":[187],"advantage":[189],"especially":[191],"more":[192],"obvious":[193],"computation":[196],"large-scale":[198],"problems.":[199],"It":[200],"applicable":[202],"various":[204],"disaster":[206],"scenarios":[208],"meet":[211],"fast":[215],"response":[216],"timeliness.":[218]},"counts_by_year":[{"year":2025,"cited_by_count":5},{"year":2024,"cited_by_count":4}],"updated_date":"2026-01-22T23:29:09.771500","created_date":"2025-10-10T00:00:00"}
