{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,16]],"date-time":"2026-03-16T11:02:07Z","timestamp":1773658927510,"version":"3.50.1"},"reference-count":52,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2025,12,6]],"date-time":"2025-12-06T00:00:00Z","timestamp":1764979200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,12,6]],"date-time":"2025-12-06T00:00:00Z","timestamp":1764979200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"the National Key R&D Program of China: Key technical equipment for disaster monitoring, warning, and in-formation acquisition based on communication big data","award":["2023YFC3010700"],"award-info":[{"award-number":["2023YFC3010700"]}]},{"DOI":"10.13039\/501100001809","name":"the National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["72472147"],"award-info":[{"award-number":["72472147"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Evol. Intel."],"published-print":{"date-parts":[[2026,2]]},"DOI":"10.1007\/s12065-025-01120-z","type":"journal-article","created":{"date-parts":[[2025,12,6]],"date-time":"2025-12-06T07:57:28Z","timestamp":1765007848000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Reactivable ripple spreading algorithm for solving post-flood disaster inspection routing problem"],"prefix":"10.1007","volume":"19","author":[{"given":"Shilin","family":"Yu","sequence":"first","affiliation":[]},{"given":"Zihan","family":"Li","sequence":"additional","affiliation":[]},{"given":"Songtao","family":"Hu","sequence":"additional","affiliation":[]},{"given":"Yuantao","family":"Song","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,12,6]]},"reference":[{"issue":"8","key":"1120_CR1","doi-asserted-by":"publisher","first-page":"086006","DOI":"10.1088\/1361-6501\/adf871","volume":"36","author":"MT Dang","year":"2025","unstructured":"Dang MT (2025) A comprehensive overview on UAV-based applications for flood management. Meas Sci Technol 36(8):086006","journal-title":"Meas Sci Technol"},{"issue":"1","key":"1120_CR2","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/s12065-021-00670-2","volume":"17","author":"L Zhang","year":"2024","unstructured":"Zhang L, Zheng M, Zhong H et al (2024) Research on uncertain bi-objective UAV mission allocation problem. Evol Intel 17(1):229\u2013237","journal-title":"Evol Intel"},{"key":"1120_CR3","doi-asserted-by":"publisher","first-page":"105764","DOI":"10.1016\/j.autcon.2024.105764","volume":"168","author":"Y Zhao","year":"2024","unstructured":"Zhao Y, Lu B, Alipour M (2024) Optimized structural inspection path planning for automated unmanned aerial systems. Autom Constr 168:105764","journal-title":"Autom Constr"},{"issue":"15","key":"1120_CR4","doi-asserted-by":"publisher","first-page":"13498","DOI":"10.1109\/JIOT.2022.3142764","volume":"9","author":"M Li","year":"2022","unstructured":"Li M, He S, Li H (2022) Minimizing mission completion time of UAVs by jointly optimizing the flight and data collection trajectory in UAV-enabled WSNs. IEEE Internet Things J 9(15):13498\u201313510","journal-title":"IEEE Internet Things J"},{"key":"1120_CR5","doi-asserted-by":"crossref","unstructured":"Chentsov AG, Grigoryev AM, Chentsov AA (2018) Solving a routing problem with the aid of an independent computations scheme. \u0412\u0435\u0441\u0442\u043d\u0438\u043a \u042e\u0436\u043d\u043e-\u0423\u0440\u0430\u043b\u044c\u0441\u043a\u043e\u0433\u043e \u0433\u043e\u0441\u0443\u0434\u0430\u0440\u0441\u0442\u0432\u0435\u043d\u043d\u043e\u0433\u043e \u0443\u043d\u0438\u0432\u0435\u0440\u0441\u0438\u0442\u0435\u0442\u0430. \u0421\u0435\u0440\u0438\u044f: \u041c\u0430\u0442\u0435\u043c\u0430\u0442\u0438\u0447\u0435\u0441\u043a\u043e\u0435 \u043c\u043e\u0434\u0435\u043b\u0438\u0440\u043e\u0432\u0430\u043d\u0438\u0435 \u0438 \u043f\u0440\u043e\u0433\u0440\u0430\u043c\u043c\u0438\u0440\u043e\u0432\u0430\u043d\u0438\u0435. 11(1):60\u201374","DOI":"10.14529\/mmp180106"},{"issue":"02","key":"1120_CR6","doi-asserted-by":"publisher","first-page":"2050050","DOI":"10.1142\/S0217595920500505","volume":"38","author":"W Shao","year":"2021","unstructured":"Shao W, Liu X, Chen J et al (2021) A study of multi-constraints emergency transportation problem in disaster response. Asia-Pac J Oper Res 38(02):2050050","journal-title":"Asia-Pac J Oper Res"},{"key":"1120_CR7","doi-asserted-by":"publisher","first-page":"101237","DOI":"10.1016\/j.aei.2020.101237","volume":"47","author":"CH Chen","year":"2021","unstructured":"Chen CH, Lee YC, Chen AY (2021) A Building information model enabled multiple traveling salesman problem for Building interior patrols. Adv Eng Inform 47:101237","journal-title":"Adv Eng Inform"},{"key":"1120_CR8","doi-asserted-by":"crossref","unstructured":"Liu X, Zhao Y, Qiao C (2019) Autonomous vehicle dispatching for person evacuation. 2019 IEEE Global Communications Conference (GLOBECOM). IEEE, 1\u20136","DOI":"10.1109\/GLOBECOM38437.2019.9014065"},{"key":"1120_CR9","doi-asserted-by":"crossref","unstructured":"Wu T, He L, Yu H (2020) Online traveling salesman problem with time cost and non-zealous server. J Comb Optim 1\u201324","DOI":"10.1007\/s10878-020-00585-1"},{"issue":"10","key":"1120_CR10","first-page":"2676","volume":"39","author":"J Yang","year":"2019","unstructured":"Yang J, Shi JG, Wei TJ (2019) Optimization of Tram timetable considering the negative impact of intersections. Syst Eng Theory Pract 39(10):2676\u20132688","journal-title":"Syst Eng Theory Pract"},{"issue":"12","key":"1120_CR11","first-page":"3111","volume":"39","author":"SW Pei","year":"2019","unstructured":"Pei SW, Shen TM, Ning Z, Xie YM (2019) KMG: research on UAV path planning strategy considering reverse logistics. Syst Eng-Theory Pract 39(12):3111\u20133119","journal-title":"Syst Engineering-Theory Pract"},{"key":"1120_CR12","doi-asserted-by":"crossref","unstructured":"Jiao D, Liu C, Li Z, Wang D (2021) An improved ant colony algorithm for TSP application. J Phs: Conf Ser 1802(3):032067","DOI":"10.1088\/1742-6596\/1802\/3\/032067"},{"key":"1120_CR13","doi-asserted-by":"crossref","unstructured":"Tao S (2021) An improved genetic algorithm for solving TSP. J Phs: Conf Ser 1952(4):042067","DOI":"10.1088\/1742-6596\/1952\/4\/042067"},{"issue":"06","key":"1120_CR14","first-page":"1","volume":"08","author":"M Rahman","year":"2021","unstructured":"Rahman M, Parvez H (2021) Repetitive nearest neighbor based simulated annealing search optimization algorithm for traveling salesman problem. Open Access Libr J 08(06):1\u201317","journal-title":"Open Access Libr J"},{"key":"1120_CR15","doi-asserted-by":"crossref","unstructured":"Bostamam JM, Othman Z (2016) Hybrid water flow-like algorithm with Tabu search for traveling salesman problem, AIP Conference Proceedings. AIP Publishing LLC 1761(1):020058","DOI":"10.1063\/1.4960898"},{"key":"1120_CR16","doi-asserted-by":"crossref","unstructured":"Biswas A, Tripathy SP, Pal T (2022) On multi-objective covering salesman problem. Neural Comput Appl 1\u201314","DOI":"10.1007\/s00521-022-07683-7"},{"key":"1120_CR17","first-page":"259","volume-title":"Epidemic-logistics modeling: A new perspective on operations research","author":"M Liu","year":"2019","unstructured":"Liu M, Cao J, Liang J et al (2019) Epidemic-logistics network considering time windows and service level. Epidemic-logistics modeling: A new perspective on operations research. Springer Singapore, Singapore, pp 259\u2013280"},{"issue":"4","key":"1120_CR18","doi-asserted-by":"publisher","first-page":"2301","DOI":"10.3390\/su14042301","volume":"14","author":"R Yin","year":"2022","unstructured":"Yin R, Lu P (2022) A cluster-first route-second constructive heuristic method for emergency logistics scheduling in urban transport networks. Sustainability 14(4):2301","journal-title":"Sustainability"},{"issue":"14","key":"1120_CR19","doi-asserted-by":"publisher","first-page":"e4429","DOI":"10.1002\/cpe.4429","volume":"30","author":"Z Wang","year":"2018","unstructured":"Wang Z, Zhao Y, Liu Y et al (2018) A speculative parallel simulated annealing algorithm based on Apache spark. Concurrency Computation: Pract Exp 30(14):e4429","journal-title":"Concurrency Computation: Pract Experience"},{"issue":"1","key":"1120_CR20","doi-asserted-by":"publisher","first-page":"95","DOI":"10.7494\/csci.2024.25.1.5330","volume":"25","author":"JT Sta\u0144czak","year":"2024","unstructured":"Sta\u0144czak JT (2024) Efficient selection methods in evolutionary algorithms. Comput Sci 25(1):95\u2013122","journal-title":"Comput Sci"},{"key":"1120_CR21","doi-asserted-by":"publisher","first-page":"112867","DOI":"10.1016\/j.eswa.2019.112867","volume":"139","author":"C Jiang","year":"2020","unstructured":"Jiang C, Wan Z, Peng Z (2020) A new efficient hybrid algorithm for large scale multiple traveling salesman problems. Expert Syst Appl 139:112867","journal-title":"Expert Syst Appl"},{"key":"1120_CR22","doi-asserted-by":"publisher","first-page":"1227","DOI":"10.1016\/j.neucom.2014.01.078","volume":"151","author":"Y Zhou","year":"2015","unstructured":"Zhou Y, Luo Q, Chen H et al (2015) A discrete invasive weed optimization algorithm for solving traveling salesman problem. Neurocomputing 151:1227\u20131236","journal-title":"Neurocomputing"},{"issue":"1","key":"1120_CR23","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1007\/s11831-022-09804-w","volume":"30","author":"FS Gharehchopogh","year":"2023","unstructured":"Gharehchopogh FS, Namazi M, Ebrahimi L et al (2023) Advances in sparrow search algorithm: a comprehensive survey. Arch Comput Methods Eng 30(1):427\u2013455","journal-title":"Arch Comput Methods Eng"},{"key":"1120_CR24","unstructured":"Nilsson C (2003) Heuristics for the traveling salesman problem. Linkoping Univ, 38(00085-9):26"},{"key":"1120_CR25","first-page":"20","volume-title":"Operations research forum","author":"N Christofides","year":"2022","unstructured":"Christofides N (2022) Worst-case analysis of a new heuristic for the travelling salesman problem. Operations research forum, vol 3. Springer International Publishing: Cham, p 20"},{"issue":"2","key":"1120_CR26","doi-asserted-by":"publisher","first-page":"498","DOI":"10.1287\/opre.21.2.498","volume":"21","author":"S Lin","year":"1973","unstructured":"Lin S, Kernighan BW (1973) An effective heuristic algorithm for the traveling-salesman problem. Oper Res 21(2):498\u2013516","journal-title":"Oper Res"},{"key":"1120_CR27","doi-asserted-by":"crossref","unstructured":"Ismail AH (2019) Domino algorithm: A novel constructive heuristics for traveling salesman problem. IOP Conference Series: Materials Science and Engineering. IOP Publishing 528(1):012043","DOI":"10.1088\/1757-899X\/528\/1\/012043"},{"key":"1120_CR28","doi-asserted-by":"publisher","first-page":"114639","DOI":"10.1016\/j.eswa.2021.114639","volume":"172","author":"Y Saji","year":"2021","unstructured":"Saji Y, Barkatou M (2021) A discrete Bat algorithm based on L\u00e9vy flights for Euclidean traveling salesman problem. Expert Syst Appl 172:114639","journal-title":"Expert Syst Appl"},{"issue":"1","key":"1120_CR29","doi-asserted-by":"publisher","first-page":"48","DOI":"10.3390\/sym13010048","volume":"13","author":"J Zhang","year":"2020","unstructured":"Zhang J, Hong L, Liu Q (2020) An improved Whale optimization algorithm for the traveling salesman problem. Symmetry 13(1):48","journal-title":"Symmetry"},{"issue":"2021","key":"1120_CR30","first-page":"1","volume":"IEEE","author":"S O Azarkasb","year":"2021","unstructured":"O Azarkasb S, H Khasteh S, S Kashi S (2021) Solving TSP problem in cloud computing using improved cultural algorithm. 26th Int Comput Conf Comput Soc Iran (CSICC) IEEE(2021):1\u20137","journal-title":"26th Int Comput Conf Comput Soc Iran (CSICC)"},{"key":"1120_CR31","doi-asserted-by":"publisher","first-page":"100712","DOI":"10.1016\/j.swevo.2020.100712","volume":"57","author":"D Trachanatzi","year":"2020","unstructured":"Trachanatzi D, Rigakis M, Marinaki M et al (2020) A firefly algorithm for the environmental prize-collecting vehicle routing problem. Swarm Evol Comput 57:100712","journal-title":"Swarm Evol Comput"},{"issue":"10","key":"1120_CR32","doi-asserted-by":"publisher","first-page":"1525","DOI":"10.1631\/FITEE.1601364","volume":"18","author":"L Huang","year":"2017","unstructured":"Huang L, Wang G, Bai T et al (2017) An improved fruit fly optimization algorithm for solving traveling salesman problem. Front Inform Technol Electron Eng 18(10):1525\u20131533","journal-title":"Front Inform Technol Electron Eng"},{"key":"1120_CR33","doi-asserted-by":"publisher","first-page":"107298","DOI":"10.1016\/j.asoc.2021.107298","volume":"105","author":"K Panwar","year":"2021","unstructured":"Panwar K, Deep K (2021) Discrete grey Wolf optimizer for symmetric travelling salesman problem. Appl Soft Comput 105:107298","journal-title":"Appl Soft Comput"},{"key":"1120_CR34","unstructured":"Bello I, Pham H, Le QV (2017) Neural combinatorial optimization with reinforcement learning. Proceedings of the 5th International Conference on Learning Representations (ICLR 2017). Toulon: ICLR"},{"key":"1120_CR35","unstructured":"Khalil E, Dai H, Zhang Y et al (2017) Learning combinatorial optimization algorithms over graphs. Adv Neural Inf Process Syst 30"},{"key":"1120_CR36","unstructured":"Nazari M, Oroojlooy A, Snyder L et al (2018) Reinforcement learning for solving the vehicle routing problem. Adv Neural Inf Process Syst 31"},{"key":"1120_CR37","doi-asserted-by":"crossref","unstructured":"Deudon M, Cournut P, Lacoste A et al (2018) Learning heuristics for the tsp by policy gradient. Integration of Constraint Programming, Artificial Intelligence, and Operations Research: 15th International Conference, CPAIOR 2018, Delft, The Netherlands, June 26\u201329, Proceedings 15. Springer International Publishing, 2018:170\u2013181","DOI":"10.1007\/978-3-319-93031-2_12"},{"key":"1120_CR38","unstructured":"Kool W, Van HH, Welling M (2019) Attention, learn to solve routing problems. Proceedings of the 7th International Conference on Learning Representations (ICLR 2019). New Orleans: ICLR"},{"issue":"3","key":"1120_CR39","doi-asserted-by":"publisher","first-page":"6995","DOI":"10.1016\/j.eswa.2008.08.026","volume":"36","author":"F Liu","year":"2009","unstructured":"Liu F, Zeng G (2009) Study of genetic algorithm with reinforcement learning to solve the TSP. Expert Syst Appl 36(3):6995\u20137001","journal-title":"Expert Syst Appl"},{"issue":"5","key":"1120_CR40","first-page":"3677","volume":"35","author":"Q Cappart","year":"2021","unstructured":"Cappart Q, Moisan T, M Rousseau L et al (2021) Combining reinforcement learning and constraint programming for combinatorial optimization. Proc AAAI Conf Artif Intell 35(5):3677\u20133687","journal-title":"Proc AAAI Conf Artif Intell"},{"key":"1120_CR41","doi-asserted-by":"crossref","unstructured":"Drori I, Kharkar A, Sickinger WR et al (2020) Learning to solve combinatorial optimization problems on real-world graphs in linear time. 2020 19th IEEE International Conference on Machine Learning and Applications (ICMLA). IEEE, 19\u201324","DOI":"10.1109\/ICMLA51294.2020.00013"},{"issue":"10","key":"1120_CR42","doi-asserted-by":"publisher","first-page":"11107","DOI":"10.1109\/TCYB.2021.3089179","volume":"52","author":"Y Xu","year":"2021","unstructured":"Xu Y, Fang M, Chen L et al (2021) Reinforcement learning with multiple relational attention for solving vehicle routing problems. IEEE Trans Cybernetics 52(10):11107\u201311120","journal-title":"IEEE Trans Cybernetics"},{"key":"1120_CR43","doi-asserted-by":"crossref","unstructured":"Zhang R, Prokhorchuk A, Dauwels J (2020) Deep reinforcement learning for traveling salesman problem with time windows and rejections. 2020 International Joint Conference on Neural Networks 1\u20138","DOI":"10.1109\/IJCNN48605.2020.9207026"},{"issue":"4","key":"1120_CR44","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1017\/S0956792512000071","volume":"23","author":"R Manzo","year":"2012","unstructured":"Manzo R, Piccoli B, Rarita L (2012) Optimal distribution of traffic flows in emergency cases. Eur J Appl Math 23(4):515\u2013535","journal-title":"Eur J Appl Math"},{"key":"1120_CR45","doi-asserted-by":"crossref","unstructured":"Rarit\u00e0 L (2020) Optimization approaches to manage congestions for the phenomenon Luci D\u2019Artista in Salerno. Proceedings of 32nd European Modeling and Simulation Symposium, EMSS 2020:319\u2013324","DOI":"10.46354\/i3m.2020.emss.046"},{"key":"1120_CR46","unstructured":"Tomasiello S, Rarit\u00e0 L (2022) An approximation technique and a possible application for a class of delay differential equations. Proceedings of the 34th European Modeling & Simulation Symposium, EMSS 2022:45"},{"key":"1120_CR47","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1016\/j.trb.2017.06.007","volume":"106","author":"XB Hu","year":"2017","unstructured":"Hu XB, Zhang MK, Zhang Q, Liao JQ (2017) Co-evolutionary path optimization by ripple-spreading algorithm. Transp Res Part B 106:411\u2013432","journal-title":"Transp Res Part B"},{"issue":"2","key":"1120_CR48","doi-asserted-by":"publisher","first-page":"2299","DOI":"10.1007\/s40747-023-01260-8","volume":"10","author":"S Yu","year":"2024","unstructured":"Yu S, Song Y (2024) Ripple spreading algorithm: a new method for solving multi-objective shortest path problems with mixed time windows. Complex Intell Syst 10(2):2299\u20132325","journal-title":"Complex Intell Syst"},{"issue":"3","key":"1120_CR49","doi-asserted-by":"publisher","first-page":"4293","DOI":"10.1007\/s40747-024-01351-0","volume":"10","author":"S Yu","year":"2024","unstructured":"Yu S, Song Y (2024) SRNN-RSA: a new method to solving time-dependent shortest path problems based on structural recurrent neural network and ripple spreading algorithm. Complex Intell Syst 10(3):4293\u20134309","journal-title":"Complex Intell Syst"},{"key":"1120_CR50","unstructured":"TSPLIB[EB\/OL] http:\/\/comopt.ifi.uni-heidelberg.de\/software\/TSPLIB95\/tsp\/"},{"key":"1120_CR51","doi-asserted-by":"publisher","first-page":"104366","DOI":"10.1016\/j.tre.2025.104366","volume":"203","author":"K Yang","year":"2025","unstructured":"Yang K, Zhang Z, Zhao J et al (2025) A neighborhood-based matheuristic for the vehicle routing problem with delivery options. Transp Res E 203:104366","journal-title":"Transp Res E"},{"issue":"15","key":"1120_CR52","doi-asserted-by":"publisher","first-page":"982","DOI":"10.1007\/s10586-025-05595-4","volume":"28","author":"S Yu","year":"2025","unstructured":"Yu S, Song Y (2025) Multi-category multi-objective ripple spreading algorithm for solving emergency facility location-routing problem with failure risk. Cluster Comput 28(15):982","journal-title":"Cluster Comput"}],"container-title":["Evolutionary Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12065-025-01120-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12065-025-01120-z","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12065-025-01120-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,16]],"date-time":"2026-03-16T10:08:29Z","timestamp":1773655709000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12065-025-01120-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,12,6]]},"references-count":52,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2026,2]]}},"alternative-id":["1120"],"URL":"https:\/\/doi.org\/10.1007\/s12065-025-01120-z","relation":{},"ISSN":["1864-5909","1864-5917"],"issn-type":[{"value":"1864-5909","type":"print"},{"value":"1864-5917","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,12,6]]},"assertion":[{"value":"15 August 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 November 2025","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 November 2025","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 December 2025","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"5"}}