{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,16]],"date-time":"2026-03-16T22:12:02Z","timestamp":1773699122667,"version":"3.50.1"},"reference-count":67,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2023,11,14]],"date-time":"2023-11-14T00:00:00Z","timestamp":1699920000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2023,11,14]],"date-time":"2023-11-14T00:00:00Z","timestamp":1699920000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Complex Intell. Syst."],"published-print":{"date-parts":[[2024,4]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>In emergency management, the transportation scheduling of emergency supplies and relief personnel can be regarded as the multi-objective shortest path problem with mixed time window (MOSPPMTW), which has high requirements for timeliness and effectiveness, but the current solution algorithms cannot simultaneously take into account the solution accuracy and computational speed, which is very unfavorable for emergency path decision-making. In this paper, we establish MOSPPMTW matching emergency rescue scenarios, which simultaneously enables the supplies and rescuers to arrive at the emergency scene as soon as possible in the shortest time and at the smallest cost. To solve the complete Pareto optimal surface, we present a ripple spreading algorithm (RSA), which determines the complete Pareto frontier by performing a ripple relay race to obtain the set of Pareto optimal path solutions. The proposed RSA algorithm does not require an initial solution and iterative iterations and only needs to be run once to obtain the solution set. Furthermore, we prove the optimality and time complexity of RSA and conduct multiple sets of example simulation experiments. Compared with other algorithms, RSA performs better in terms of computational speed and solution quality. The advantage is especially more obvious in the computation of large-scale problems. It is applicable to various emergency disaster relief scenarios and can meet the requirements of fast response and timeliness.<\/jats:p>","DOI":"10.1007\/s40747-023-01260-8","type":"journal-article","created":{"date-parts":[[2023,11,14]],"date-time":"2023-11-14T02:01:39Z","timestamp":1699927299000},"page":"2299-2325","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Ripple spreading algorithm: a new method for solving multi-objective shortest path problems with mixed time windows"],"prefix":"10.1007","volume":"10","author":[{"given":"Shilin","family":"Yu","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1172-3872","authenticated-orcid":false,"given":"Yuantao","family":"Song","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,11,14]]},"reference":[{"key":"1260_CR1","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"EW Dijkstra","year":"1959","unstructured":"Dijkstra EW (1959) A note on two problems in connexion with graphs. Numer Math 1:269\u2013271","journal-title":"Numer Math"},{"issue":"3","key":"1260_CR2","first-page":"193","volume":"31","author":"I Ioachim","year":"1998","unstructured":"Ioachim I, Gelinas S, Soumis F et al (1998) A dynamic programming algorithm for the shortest path problem with time windows and linear node costs. Networks Int J 31(3):193\u2013204","journal-title":"Networks Int J"},{"key":"1260_CR3","doi-asserted-by":"crossref","unstructured":"Powell W B, Chen Z L. A generalized threshold algorithm for the shortest path problem with time windows[C]\/\/Network Design: Connectivity and Facilities Location. 1997: 303\u2013318.","DOI":"10.1090\/dimacs\/040\/18"},{"issue":"3","key":"1260_CR4","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1080\/03155986.1988.11732063","volume":"26","author":"M Desrochers","year":"1988","unstructured":"Desrochers M, Soumis F (1988) A generalized permanent labelling algorithm for the shortest path problem with time windows. Inform Syst Operat Res 26(3):191\u2013212","journal-title":"Inform Syst Operat Res"},{"issue":"1","key":"1260_CR5","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.ejor.2020.07.005","volume":"290","author":"S Zajac","year":"2021","unstructured":"Zajac S, Huber S (2021) Objectives and methods in multi-objective routing problems: a survey and classification scheme. Eur J Oper Res 290(1):1\u201325","journal-title":"Eur J Oper Res"},{"key":"1260_CR6","series-title":"Lecture Notes in Economics and Mathematical Systems","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1007\/978-3-642-48782-8_9","volume-title":"Multiple criteria decision making theory and application","author":"P Hansen","year":"1980","unstructured":"Hansen P (1980) Bi-criterion path problems G. In: Fandel, Gal T (eds) Multiple criteria decision making theory and application, vol 177. Lecture Notes in Economics and Mathematical Systems. Springer, Berlin, pp 109\u2013127"},{"issue":"1","key":"1260_CR7","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/s10479-006-0072-1","volume":"147","author":"M M\u00fcller-Hannemann","year":"2006","unstructured":"M\u00fcller-Hannemann M, Weihe K (2006) On the cardinality of the Pareto set in bicriteria shortest path problems. Ann Oper Res 147(1):269\u2013286","journal-title":"Ann Oper Res"},{"key":"1260_CR8","doi-asserted-by":"crossref","unstructured":"Serafini P (1987) Some considerations about computational complexity for multi objective combinatorial problems. Recent advances and historical development of vector optimization: Proceedings of an International Conference on Vector Optimization Held at the Technical University of Darmstadt, FRG, August 4\u20137, 1986. Springer Berlin Heidelberg, Berlin, pp 222\u2013232","DOI":"10.1007\/978-3-642-46618-2_15"},{"issue":"1","key":"1260_CR9","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1016\/0377-2217(91)90094-C","volume":"53","author":"J Mote","year":"1991","unstructured":"Mote J, Murthy I, Olson DL (1991) A parametric approach to solving bicriterion shortest path problems. Eur J Oper Res 53(1):81\u201392","journal-title":"Eur J Oper Res"},{"key":"1260_CR10","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1016\/j.cor.2014.11.010","volume":"57","author":"A Sedeno-Noda","year":"2015","unstructured":"Sedeno-Noda A, Raith A (2015) A Dijkstra-like method computing all extreme supported non-dominated solutions of the biobjective shortest path problem. Comput Oper Res 57:83\u201394","journal-title":"Comput Oper Res"},{"key":"1260_CR11","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1006\/jcss.2001.1766","volume":"63","author":"K Mulmuley","year":"2001","unstructured":"Mulmuley K, Shah P (2001) A lower bound for the shortest path problem. J Comput Syst Sci 63:253\u2013267","journal-title":"J Comput Syst Sci"},{"key":"1260_CR12","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1006\/jmaa.1993.1067","volume":"173","author":"MM Kostreva","year":"1993","unstructured":"Kostreva MM, Wiecek MM (1993) Time dependency in multiple objective dynamic programming. J Math Anal Appl 173:289\u2013289","journal-title":"J Math Anal Appl"},{"key":"1260_CR13","doi-asserted-by":"crossref","unstructured":"Papadimitriou CH, Yannakakis M. On the approximability of trade-offs and optimal access of web sources. In: Proceedings 41st annual symposium on foundations of computer science. IEEE, 2000: 86\u201392.","DOI":"10.1109\/SFCS.2000.892068"},{"issue":"1","key":"1260_CR14","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1007\/s10288-005-0074-x","volume":"4","author":"X Gandibleux","year":"2006","unstructured":"Gandibleux X, Beugnies F, Randriamasy S (2006) Martins\u2019 algorithm revisited for multi-objective shortest path problems with a MaxMin cost function. 4OR 4(1):47\u201359","journal-title":"4OR"},{"key":"1260_CR15","doi-asserted-by":"crossref","first-page":"553","DOI":"10.1016\/j.sbspro.2013.05.030","volume":"80","author":"PW Chen","year":"2013","unstructured":"Chen PW, Nie YM (2013) Bicriterion shortest path problem with a general nonadditive cost. Proc Soc Behav Sci 80:553\u2013575","journal-title":"Proc Soc Behav Sci"},{"key":"1260_CR16","doi-asserted-by":"crossref","first-page":"44","DOI":"10.1016\/j.cor.2016.06.022","volume":"78","author":"T Breugem","year":"2017","unstructured":"Breugem T, Dollevoet T, van den Heuvel W (2017) Analysis of FPTASes for the multi-objective shortest path problem. Comput Oper Res 78:44\u201358","journal-title":"Comput Oper Res"},{"issue":"6","key":"1260_CR17","doi-asserted-by":"publisher","first-page":"3461","DOI":"10.1109\/TSMC.2022.3225381","volume":"53","author":"Z Zhuang","year":"2022","unstructured":"Zhuang Z, Tao H, Chen Y et al (2022) An optimal iterative learning control approach for linear systems with nonuniform trial lengths under input constraints. IEEE Transact Syst Man Cybern Syst 53(6):3461\u20133473. https:\/\/doi.org\/10.1109\/TSMC.2022.3225381","journal-title":"IEEE Transact Syst Man Cybern Syst"},{"key":"1260_CR18","doi-asserted-by":"crossref","first-page":"1085","DOI":"10.1007\/s00170-014-5735-5","volume":"72","author":"N Nedic","year":"2014","unstructured":"Nedic N, Prsic D, Dubonjic L et al (2014) Optimal cascade hydraulic control for a parallel robot platform by PSO. Int J Adv Manuf Technol 72:1085\u20131098","journal-title":"Int J Adv Manuf Technol"},{"key":"1260_CR19","doi-asserted-by":"crossref","first-page":"1457","DOI":"10.1007\/s11071-015-2252-5","volume":"82","author":"N Nedic","year":"2015","unstructured":"Nedic N, Stojanovic V, Djordjevic V (2015) Optimal control of hydraulically driven parallel robot platform based on firefly algorithm. Nonlinear Dyn 82:1457\u20131473","journal-title":"Nonlinear Dyn"},{"key":"1260_CR20","doi-asserted-by":"crossref","first-page":"653","DOI":"10.1016\/j.asoc.2013.09.008","volume":"14","author":"UF Siddiqi","year":"2014","unstructured":"Siddiqi UF, Shiraishi Y, Dahb M et al (2014) A memory efficient stochastic evolution based algorithm for the multi-objective shortest path problem. Appl Soft Comput 14:653\u2013662","journal-title":"Appl Soft Comput"},{"issue":"2","key":"1260_CR21","first-page":"199","volume":"17","author":"AJV Skriver","year":"2000","unstructured":"Skriver AJV (2000) A classification of bicriterion shortest path (BSP) algorithms. Asia Pac J Operat Res 17(2):199\u2013212","journal-title":"Asia Pac J Operat Res"},{"issue":"1","key":"1260_CR22","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1016\/j.ejor.2014.05.008","volume":"239","author":"FJ Pulido","year":"2014","unstructured":"Pulido FJ, Mandow L, de la Cruz JLP (2014) Multiobjective shortest path problems with lexicographic goal-based preferences. Eur J Oper Res 239(1):89\u2013101","journal-title":"Eur J Oper Res"},{"key":"1260_CR23","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1016\/j.tre.2017.02.002","volume":"101","author":"N Shi","year":"2017","unstructured":"Shi N, Zhou S, Wang F et al (2017) The multi-criteria constrained shortest path problem. Transport Res Part E: Logistics Transport Rev 101:13\u201329","journal-title":"Transport Res Part E: Logistics Transport Rev"},{"key":"1260_CR24","unstructured":"Mandow L, De la Cruz J L P (2005) A new approach to multiobjective A* Search. In: Proceedings of the 19th international joint conference on Artificial intelligence (IJCAI'05). Morgan Kaufmann Publishers Inc., San Francisco, CA, USA, pp 218\u2013223"},{"issue":"3","key":"1260_CR25","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1109\/TEVC.2007.904345","volume":"12","author":"KI Smith","year":"2008","unstructured":"Smith KI, Everson RM, Fieldsend JE et al (2008) Dominance-based multiobjective simulated annealing. IEEE Trans Evol Comput 12(3):323\u2013342","journal-title":"IEEE Trans Evol Comput"},{"key":"1260_CR26","doi-asserted-by":"crossref","unstructured":"Coello Coello Coello C A, Toscano Pulido G (2001) A micro-genetic algorithm for multiobjective optimization. In: International conference on evolutionary multi-criterion optimization. Springer Berlin Heidelberg, Berlin, Heidelberg, pp 126\u2013140","DOI":"10.1007\/3-540-44719-9_9"},{"issue":"2","key":"1260_CR27","doi-asserted-by":"crossref","first-page":"182","DOI":"10.1109\/4235.996017","volume":"6","author":"K Deb","year":"2002","unstructured":"Deb K, Pratap A, Agarwal S et al (2002) A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Trans Evol Comput 6(2):182\u2013197","journal-title":"IEEE Trans Evol Comput"},{"issue":"2","key":"1260_CR28","doi-asserted-by":"crossref","first-page":"767","DOI":"10.1109\/TMAG.2011.2177076","volume":"48","author":"TC Bora","year":"2012","unstructured":"Bora TC, Lebensztajn L, Coelho LDS (2012) Non-dominated sorting genetic algorithm based on reinforcement learning to optimization of broad-band reflector antennas satellite. IEEE Trans Magn 48(2):767\u2013770","journal-title":"IEEE Trans Magn"},{"issue":"1","key":"1260_CR29","doi-asserted-by":"crossref","first-page":"162","DOI":"10.1007\/s00224-007-9096-4","volume":"45","author":"G Tsaggouris","year":"2009","unstructured":"Tsaggouris G, Zaroliagis C (2009) Multiobjective optimization: improved FPTAS for shortest paths and non-linear objectives with applications. Theory Comput Syst 45(1):162\u2013186","journal-title":"Theory Comput Syst"},{"issue":"3","key":"1260_CR30","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1162\/EVCO_a_00014","volume":"18","author":"C Horoba","year":"2010","unstructured":"Horoba C (2010) Exploring the runtime of an evolutionary algorithm for the multi-objective shortest path problem. Evol Comput 18(3):357\u2013381","journal-title":"Evol Comput"},{"issue":"2","key":"1260_CR31","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1162\/106365600568167","volume":"8","author":"JD Knowles","year":"2000","unstructured":"Knowles JD, Corne DW (2000) Approximating the nondominated front using the Pareto archived evolution strategy. Evol Comput 8(2):149\u2013172","journal-title":"Evol Comput"},{"key":"1260_CR32","unstructured":"Martins EQV, Santos JLE (1999) The labelling algorithm for the multiobjective shortest path problem. Departamento de Matematica, Universidade de Coimbra, Portugal, Tech. Rep. TR-99\/005"},{"issue":"11","key":"1260_CR33","doi-asserted-by":"crossref","first-page":"3324","DOI":"10.1016\/j.cor.2005.03.027","volume":"33","author":"L Fu","year":"2006","unstructured":"Fu L, Sun D, Rilett LR (2006) Heuristic shortest path algorithms for transportation applications: State of the art. Comput Oper Res 33(11):3324\u20133343","journal-title":"Comput Oper Res"},{"issue":"1","key":"1260_CR34","doi-asserted-by":"crossref","first-page":"44","DOI":"10.1016\/j.ejor.2011.08.030","volume":"217","author":"E Machuca","year":"2012","unstructured":"Machuca E, Mandow L, De La Cruz JLP et al (2012) A comparison of heuristic best-first algorithms for bicriterion shortest path problems. Eur J Oper Res 217(1):44\u201353","journal-title":"Eur J Oper Res"},{"key":"1260_CR35","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1016\/j.tre.2017.03.001","volume":"101","author":"M Rahimi","year":"2017","unstructured":"Rahimi M, Baboli A, Rekik Y (2017) Multi-objective inventory routing problem: a stochastic model to consider profit, service level and green criteria. Transport Res Part E: Logistics Transport Rev 101:59\u201383","journal-title":"Transport Res Part E: Logistics Transport Rev"},{"issue":"1","key":"1260_CR36","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1016\/0377-2217(93)90140-I","volume":"65","author":"J Current","year":"1993","unstructured":"Current J, Marsh M (1993) Multiobjective transportation network design and routing problems: taxonomy and annotation. Eur J Oper Res 65(1):4\u201319","journal-title":"Eur J Oper Res"},{"issue":"2","key":"1260_CR37","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1016\/0305-0548(90)90042-6","volume":"17","author":"JR Current","year":"1990","unstructured":"Current JR, Revelle CS, Cohon JL (1990) An interactive approach to identify the best compromise solution for two objective shortest path problems. Comput Oper Res 17(2):187\u2013198","journal-title":"Comput Oper Res"},{"issue":"8","key":"1260_CR38","doi-asserted-by":"crossref","first-page":"789","DOI":"10.1016\/S0305-0548(98)00094-X","volume":"26","author":"JM Coutinho-Rodrigues","year":"1999","unstructured":"Coutinho-Rodrigues JM, Cl\u0131maco JCN, Current JR (1999) An interactive bi-objective shortest path approach: searching for unsupported nondominated solutions. Comput Oper Res 26(8):789\u2013798","journal-title":"Comput Oper Res"},{"issue":"4","key":"1260_CR39","doi-asserted-by":"crossref","first-page":"399","DOI":"10.1016\/0377-2217(82)90205-3","volume":"11","author":"JCN Climaco","year":"1982","unstructured":"Climaco JCN, Martins EQV (1982) A bicriterion shortest path algorithm. Eur J Oper Res 11(4):399\u2013404","journal-title":"Eur J Oper Res"},{"key":"1260_CR40","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1007\/s001860100169","volume":"54","author":"K Wakuta","year":"2001","unstructured":"Wakuta K (2001) A multi-objective shortest path problem. Math Methods Oper Res 54:445\u2013454","journal-title":"Math Methods Oper Res"},{"key":"1260_CR41","doi-asserted-by":"crossref","first-page":"8975","DOI":"10.1007\/s00500-019-04423-3","volume":"24","author":"S Majumder","year":"2020","unstructured":"Majumder S, Kar MB, Kar S et al (2020) Uncertain programming models for multi-objective shortest path problem with uncertain parameters. Soft Comput 24:8975\u20138996","journal-title":"Soft Comput"},{"key":"1260_CR42","doi-asserted-by":"crossref","first-page":"725","DOI":"10.1007\/s40747-020-00234-4","volume":"7","author":"M Bagheri","year":"2021","unstructured":"Bagheri M, Ebrahimnejad A, Razavyan S et al (2021) Solving fuzzy multi-objective shortest path problem based on data envelopment analysis approach. Complex Intell Syst 7:725\u2013740","journal-title":"Complex Intell Syst"},{"key":"1260_CR43","doi-asserted-by":"crossref","unstructured":"da Silva JM, Ramos GO, Barbosa JLV (2022) The multi-objective dynamic shortest path problem. In: 2022 IEEE Congress on Evolutionary Computation (CEC). IEEE, pp 1\u20138","DOI":"10.1109\/CEC55065.2022.9870278"},{"key":"1260_CR44","volume":"169","author":"X Yao","year":"2022","unstructured":"Yao X, Li W, Pan X et al (2022) Multimodal multi-objective evolutionary algorithm for multiple path planning. Comput Ind Eng 169:108145","journal-title":"Comput Ind Eng"},{"key":"1260_CR45","doi-asserted-by":"crossref","DOI":"10.1016\/j.asoc.2020.106076","volume":"89","author":"FH Ajeil","year":"2020","unstructured":"Ajeil FH, Ibraheem IK, Sahib MA et al (2020) Multi-objective path planning of an autonomous mobile robot using mixed PSO-MFB optimization algorithm. Appl Soft Comput 89:106076","journal-title":"Appl Soft Comput"},{"key":"1260_CR46","doi-asserted-by":"crossref","first-page":"7873","DOI":"10.1007\/s12652-020-02514-w","volume":"12","author":"F Gul","year":"2021","unstructured":"Gul F, Rahiman W, Alhady S, Aladi N et al (2021) Meta-heuristic approach for solving multi-objective path planning for autonomous guided robot using PSO-GWO optimization algorithm with evolutionary programming. J Ambient Intell Hum Comput 12:7873\u20137890","journal-title":"J Ambient Intell Hum Comput"},{"issue":"2","key":"1260_CR47","doi-asserted-by":"crossref","first-page":"3318","DOI":"10.1109\/LRA.2022.3146918","volume":"7","author":"Z Ren","year":"2022","unstructured":"Ren Z, Rathinam S, Likhachev M et al (2022) Multi-objective path-based D* lite. IEEE Robotics Automat Lett 7(2):3318\u20133325","journal-title":"IEEE Robotics Automat Lett"},{"key":"1260_CR48","doi-asserted-by":"crossref","DOI":"10.1016\/j.cie.2021.107478","volume":"159","author":"W Ongcunaruk","year":"2021","unstructured":"Ongcunaruk W, Ongkunaruk P, Janssens GK (2021) Genetic algorithm for a delivery problem with mixed time windows. Comput Ind Eng 159:107478","journal-title":"Comput Ind Eng"},{"issue":"10","key":"1260_CR49","doi-asserted-by":"crossref","first-page":"7325","DOI":"10.1007\/s00521-022-06967-2","volume":"34","author":"B Zhou","year":"2022","unstructured":"Zhou B, Zhao Z (2022) Multi-objective optimization of electric vehicle routing problem with battery swap and mixed time windows. Neural Comput Appl 34(10):7325\u20137348","journal-title":"Neural Comput Appl"},{"key":"1260_CR50","doi-asserted-by":"publisher","DOI":"10.1007\/s10479-022-04747-8","author":"N Li","year":"2022","unstructured":"Li N, Li G (2022) Mixed partheno-genetic algorithm for multi-depot perishable food delivery problem with mixed time windows. Ann Operat Res. https:\/\/doi.org\/10.1007\/s10479-022-04747-8","journal-title":"Ann Operat Res"},{"issue":"3","key":"1260_CR51","first-page":"321","volume":"13","author":"XP Wang","year":"2018","unstructured":"Wang XP, Wang M, Ruan JH et al (2018) Multi-objective optimization for delivering perishable products with mixed time windows. Adv Prod Eng Manag 13(3):321\u2013332","journal-title":"Adv Prod Eng Manag"},{"issue":"23","key":"1260_CR52","first-page":"81","volume":"57","author":"H Xiaobing","year":"2021","unstructured":"Xiaobing H, Shunian C, Yingfei Z, Shenghao G (2021) A new ripple-spreading algorithm for multi-objective path optimization. Comput Eng Appl 57(23):81\u201390","journal-title":"Comput Eng Appl"},{"issue":"7","key":"1260_CR53","first-page":"1387","volume":"48","author":"R Guo","year":"2020","unstructured":"Guo R, Hu X (2020) An effective method to find the k shortest paths in a generalized time-window network. ACTA Electonica Sinica 48(7):1387","journal-title":"ACTA Electonica Sinica"},{"issue":"3","key":"1260_CR54","doi-asserted-by":"crossref","first-page":"1088","DOI":"10.1109\/TSMCB.2012.2223756","volume":"43","author":"XB Hu","year":"2013","unstructured":"Hu XB, Wang M, Di Paolo E (2013) Calculating complete and exact pareto front for multi-objective optimization: a new deterministic approach for discrete problems. IEEE Transact Cybern 43(3):1088\u20131101","journal-title":"IEEE Transact Cybern"},{"key":"1260_CR55","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1016\/j.neucom.2014.02.058","volume":"142","author":"XB Hu","year":"2014","unstructured":"Hu XB, Wang M, Ye Q et al (2014) Multi-objective new product development by complete Pareto front and ripple-spreading algorithm. Neurocomputing 142:4\u201315","journal-title":"Neurocomputing"},{"key":"1260_CR56","doi-asserted-by":"crossref","first-page":"138","DOI":"10.1007\/s13753-016-0089-2","volume":"7","author":"XB Hu","year":"2016","unstructured":"Hu XB, Wang M, Ye T et al (2016) A new method for resource allocation optimization in disaster reduction and risk governance. Int J Disaster Risk Sci 7:138\u2013150","journal-title":"Int J Disaster Risk Sci"},{"key":"1260_CR57","volume":"64","author":"XB Hu","year":"2021","unstructured":"Hu XB, Gu SH, Zhang C et al (2021) Finding all Pareto optimal paths by simulating ripple relay race in multi-objective networks. Swarm Evol Comput 64:100908","journal-title":"Swarm Evol Comput"},{"key":"1260_CR58","doi-asserted-by":"crossref","unstructured":"Ma Y, Hu X, Zhou H (2023) Determining All Pareto-Optimal Paths for Multi-category Multi-objective Path Optimization Problems. Advances in Natural Computation, Fuzzy Systems and Knowledge Discovery: Proceedings of the ICNC-FSKD 2022. Springer International Publishing, Cham, pp 327\u2013335","DOI":"10.1007\/978-3-031-20738-9_37"},{"key":"1260_CR59","doi-asserted-by":"crossref","first-page":"57757","DOI":"10.1109\/ACCESS.2021.3070634","volume":"9","author":"S Verma","year":"2021","unstructured":"Verma S, Pant M, Snasel V (2021) A comprehensive review on NSGA-II for multi-objective combinatorial optimization problems. Ieee Access 9:57757\u201357791","journal-title":"Ieee Access"},{"key":"1260_CR60","doi-asserted-by":"crossref","unstructured":"Deb K, Agrawal S, Pratap A, et al (2000) A fast elitist non-dominated sorting genetic algorithm for multi-objective optimization: NSGA-II[C]\/\/Parallel Problem Solving from Nature PPSN VI: 6th International Conference Paris, France, September 18\u201320. In: Proceedings 6. Springer Berlin Heidelberg, 2000: 849\u2013858.","DOI":"10.1007\/3-540-45356-3_83"},{"issue":"6","key":"1260_CR61","doi-asserted-by":"crossref","first-page":"712","DOI":"10.1109\/TEVC.2007.892759","volume":"11","author":"Q Zhang","year":"2007","unstructured":"Zhang Q, Li H (2007) MOEA\/D: a multiobjective evolutionary algorithm based on decomposition. IEEE Trans Evol Comput 11(6):712\u2013731","journal-title":"IEEE Trans Evol Comput"},{"issue":"2","key":"1260_CR62","doi-asserted-by":"crossref","first-page":"284","DOI":"10.1109\/TEVC.2008.925798","volume":"13","author":"H Li","year":"2008","unstructured":"Li H, Zhang Q (2008) Multiobjective optimization problems with complicated Pareto sets, MOEA\/D and NSGA-II. IEEE Trans Evol Comput 13(2):284\u2013302","journal-title":"IEEE Trans Evol Comput"},{"key":"1260_CR63","doi-asserted-by":"crossref","unstructured":"Paix\u00e3o JM, Santos JL (2013) Labeling methods for the general case of the multi-objective shortest path problem\u2014a computational study. In: Computational Intelligence and Decision Making: Trends and Applications. Springer Netherlands, pp 489-502","DOI":"10.1007\/978-94-007-4722-7_46"},{"key":"1260_CR64","doi-asserted-by":"crossref","first-page":"348","DOI":"10.1007\/s10489-014-0523-3","volume":"41","author":"MA Mohiuddin","year":"2014","unstructured":"Mohiuddin MA, Khan SA, Engelbrecht AP (2014) Simulated evolution and simulated annealing algorithms for solving multi-objective open shortest path first weight setting problem. Appl Intell 41:348\u2013365","journal-title":"Appl Intell"},{"issue":"2","key":"1260_CR65","doi-asserted-by":"crossref","first-page":"272","DOI":"10.1080\/0305215X.2015.1005081","volume":"48","author":"L Wang","year":"2016","unstructured":"Wang L, Gao Z, Yang L (2016) A priori least expected time paths in fuzzy, time-variant transportation networks. Eng Optim 48(2):272\u2013298","journal-title":"Eng Optim"},{"key":"1260_CR66","unstructured":"http:\/\/www.diag.uniroma1.it\/challenge9\/download.shtml. Accessed 23 Mar 2023"},{"issue":"2","key":"1260_CR67","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1162\/EVCO_a_00156","volume":"24","author":"H Xiao-Bing","year":"2016","unstructured":"Xiao-Bing H et al (2016) Deterministic agent-based path optimization by mimicking the spreading of ripples. Evolut Comput 24(2):319\u2013346","journal-title":"Evolut Comput"}],"container-title":["Complex &amp; Intelligent Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40747-023-01260-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s40747-023-01260-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40747-023-01260-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,1]],"date-time":"2024-11-01T23:15:58Z","timestamp":1730502958000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s40747-023-01260-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,11,14]]},"references-count":67,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2024,4]]}},"alternative-id":["1260"],"URL":"https:\/\/doi.org\/10.1007\/s40747-023-01260-8","relation":{},"ISSN":["2199-4536","2198-6053"],"issn-type":[{"value":"2199-4536","type":"print"},{"value":"2198-6053","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,11,14]]},"assertion":[{"value":"8 May 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 September 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 November 2023","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have no conflict of interest regarding this paper.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"Not applicable.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval and consent to participate"}},{"value":"Not applicable.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent for publication"}}]}}