{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,25]],"date-time":"2026-01-25T03:48:48Z","timestamp":1769312928618,"version":"3.49.0"},"reference-count":69,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2024,3,5]],"date-time":"2024-03-05T00:00:00Z","timestamp":1709596800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2024,3,5]],"date-time":"2024-03-05T00:00:00Z","timestamp":1709596800000},"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,6]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Influenced by external factors, the speed of vehicles in the traffic network is changing all the time, which makes the traditional static shortest route unable to meet the real logistics distribution needs. Considering that the existing research on time-dependent shortest path problems (TDSPP) do not include the topological information of the traffic network, it is unable to reflect the spatial and temporal dynamic characteristics of the traffic network during the vehicle travelling process and is unable to update to the changes of the vehicle speed in real time, and poor scalability. Therefore, we used the structural RNN (SRNN) model containing topological information of the road network is used to predict time-varying speeds in the traffic road network. We proposed an SRNN-RSA framework for solving the TDSPP problem, which achieves a synergistic evolution between the real-time vehicle speed change process and the RSA solving process, and the scalability of the proposed SRNN-RSA is demonstrated and validated using different real data. Compared with other algorithms, the results show that SRNN-RSA has the lowest error with the actual situation, which can balance the solution accuracy and calculation speed and is more consistent with the real traffic road network, with better stability and expandability.<\/jats:p>","DOI":"10.1007\/s40747-024-01351-0","type":"journal-article","created":{"date-parts":[[2024,3,5]],"date-time":"2024-03-05T10:02:42Z","timestamp":1709632962000},"page":"4293-4309","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["SRNN-RSA: a new method to solving time-dependent shortest path problems based on structural recurrent neural network and ripple spreading algorithm"],"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":[[2024,3,5]]},"reference":[{"key":"1351_CR1","unstructured":"Sperb RC (2010) Solving time-dependent shortest path problems in a database context. University of Twente"},{"key":"1351_CR2","doi-asserted-by":"crossref","unstructured":"Hu L, Peng B, Jiang Y et al (2011) Model and algorithm for continuous time-varying shortest path problem. In: ICTE 2011, pp 271\u2013276","DOI":"10.1061\/41184(419)46"},{"key":"1351_CR3","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1016\/j.ins.2013.07.009","volume":"255","author":"J Kim","year":"2014","unstructured":"Kim J, Han WS, Oh J et al (2014) Processing time-dependent shortest path queries without pre-computed speed information on road networks. Inf Sci 255:135\u2013154","journal-title":"Inf Sci"},{"issue":"1","key":"1351_CR4","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1016\/S0377-2217(99)00035-1","volume":"121","author":"K Sung","year":"2000","unstructured":"Sung K, Bell MGH, Seong M et al (2000) Shortest paths in a network with time-dependent flow speeds. Eur J Oper Res 121(1):32\u201339","journal-title":"Eur J Oper Res"},{"issue":"6","key":"1351_CR5","doi-asserted-by":"publisher","first-page":"688","DOI":"10.1016\/j.orl.2008.07.002","volume":"36","author":"M Dell\u2019Amico","year":"2008","unstructured":"Dell\u2019Amico M, Iori M, Pretolani D (2008) Shortest paths in piecewise continuous time-dependent networks. Oper Res Lett 36(6):688\u2013691","journal-title":"Oper Res Lett"},{"issue":"2","key":"1351_CR6","doi-asserted-by":"publisher","first-page":"873","DOI":"10.1109\/TITS.2020.3016387","volume":"23","author":"UM Y\u0131ld\u0131r\u0131m","year":"2020","unstructured":"Y\u0131ld\u0131r\u0131m UM, \u00c7atay B (2020) An enhanced network-consistent travel speed generation scheme on time-dependent shortest path and routing problems. IEEE Trans Intell Transp Syst 23(2):873\u2013884","journal-title":"IEEE Trans Intell Transp Syst"},{"issue":"12","key":"1351_CR7","doi-asserted-by":"publisher","first-page":"538","DOI":"10.3390\/ijgi8120538","volume":"8","author":"F Kolovsk\u00fd","year":"2019","unstructured":"Kolovsk\u00fd F, Je\u017eek J, Kolingerov\u00e1 I (2019) The \u03b5-approximation of the time-dependent shortest path problem solution for all departure times. ISPRS Int J Geo Inf 8(12):538","journal-title":"ISPRS Int J Geo Inf"},{"key":"1351_CR8","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2021.115489","volume":"184","author":"H Rozas","year":"2021","unstructured":"Rozas H, Mu\u00f1oz-Carpintero D, Sa\u00e9z D et al (2021) Solving in real-time the dynamic and stochastic shortest path problem for electric vehicles by a prognostic decision making strategy. Expert Syst Appl 184:115489","journal-title":"Expert Syst Appl"},{"issue":"3","key":"1351_CR9","doi-asserted-by":"publisher","first-page":"915","DOI":"10.1016\/j.ejor.2013.10.044","volume":"236","author":"L Wen","year":"2014","unstructured":"Wen L, \u00c7atay B, Eglese R (2014) Finding a minimum cost path between a pair of nodes in a time-varying road network with a congestion charge. Eur J Oper Res 236(3):915\u2013923","journal-title":"Eur J Oper Res"},{"key":"1351_CR10","doi-asserted-by":"crossref","unstructured":"Zhang Z, Li M (2023) Finding paths with least expected time in stochastic time-varying networks considering uncertainty of prediction information. IEEE Trans Intell Transport Syst","DOI":"10.1109\/TITS.2023.3299277"},{"key":"1351_CR11","unstructured":"Zhao L, Ohshima T, Nagamochi H (2008) A* algorithm for the time-dependent shortest path problem. In: WAAC08: the 11th Japan\u2013Korea joint workshop on algorithms and computation, p 10"},{"key":"1351_CR12","doi-asserted-by":"crossref","unstructured":"Ohshima T, Eumthurapojn P, Zhao L et al (2011) An A* algorithm framework for the point-to-point time-dependent shortest path problem. In: Computational geometry, graphs and applications: 9th international conference, CGGA 2010, Dalian, China, November 3\u20136, 2010, revised selected papers. Springer, Berlin, pp 154\u2013163","DOI":"10.1007\/978-3-642-24983-9_16"},{"issue":"3","key":"1351_CR13","doi-asserted-by":"publisher","first-page":"709","DOI":"10.1287\/opre.2020.2089","volume":"69","author":"M Ru\u00df","year":"2021","unstructured":"Ru\u00df M, Gust G, Neumann D (2021) The constrained reliable shortest path problem in stochastic time-dependent networks. Oper Res 69(3):709\u2013726","journal-title":"Oper Res"},{"issue":"2","key":"1351_CR14","doi-asserted-by":"publisher","first-page":"1086","DOI":"10.1287\/ijoc.2021.1084","volume":"34","author":"EY He","year":"2022","unstructured":"He EY, Boland N, Nemhauser G et al (2022) Dynamic discretization discovery algorithms for time-dependent shortest path problems. INFORMS J Comput 34(2):1086\u20131114","journal-title":"INFORMS J Comput"},{"issue":"3","key":"1351_CR15","doi-asserted-by":"publisher","first-page":"968","DOI":"10.1016\/j.ejor.2018.04.030","volume":"270","author":"E Conde","year":"2018","unstructured":"Conde E, Leal M, Puerto J (2018) A minmax regret version of the time-dependent shortest path problem. Eur J Oper Res 270(3):968\u2013981","journal-title":"Eur J Oper Res"},{"key":"1351_CR16","first-page":"1","volume":"2021","author":"Z Xie","year":"2021","unstructured":"Xie Z, He YR, Jiang Y et al (2021) Improved and\/or tree search algorithm in analysis of stochastic and time-dependent shortest path problem. Sci Prog 2021:1\u201319","journal-title":"Sci Prog"},{"issue":"3","key":"1351_CR17","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1002\/net.21885","volume":"74","author":"J Omer","year":"2019","unstructured":"Omer J, Poss M (2019) Time-dependent shortest paths with discounted waits. Networks 74(3):287\u2013301","journal-title":"Networks"},{"key":"1351_CR18","doi-asserted-by":"crossref","unstructured":"Omran M, Sack JR (2014) Improved approximation for time-dependent shortest paths. In: International computing and combinatorics conference. Springer International Publishing, Cham, pp 453\u2013464","DOI":"10.1007\/978-3-319-08783-2_39"},{"key":"1351_CR19","doi-asserted-by":"crossref","unstructured":"Foschini L, Hershberger J, Suri S (2011) On the complexity of time-dependent shortest paths. In: Proceedings of the 22nd annual ACM-SIAM symposium on discrete algorithms, pp 327\u2013341","DOI":"10.1137\/1.9781611973082.27"},{"key":"1351_CR20","doi-asserted-by":"crossref","unstructured":"Foschini L, Hershberger J, Suri S (2012) On the complexity of time-dependent shortest paths. Algorithmica 1\u201323","DOI":"10.1137\/1.9781611973082.27"},{"key":"1351_CR21","doi-asserted-by":"crossref","unstructured":"Dehne F, Omran MT, Sack J-R (2009) Shortest paths in time-dependent FIFO networks using edge load forecasts. In: Proceedings of the 2nd international workshop on computational transportation science, pp 1\u20136","DOI":"10.1145\/1645373.1645374"},{"issue":"1\u20132","key":"1351_CR22","doi-asserted-by":"publisher","first-page":"416","DOI":"10.1007\/s00453-010-9461-6","volume":"62","author":"F Dehne","year":"2012","unstructured":"Dehne F, Omran MT, Sack J-R (2012) Shortest paths in time-dependent FIFO networks. Algorithmica 62(1\u20132):416\u2013435","journal-title":"Algorithmica"},{"key":"1351_CR23","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2020.113192","volume":"147","author":"P Chen","year":"2020","unstructured":"Chen P, Tong R, Yu B et al (2020) Reliable shortest path finding in stochastic time-dependent road network with spatial-temporal link correlations: a case study from Beijing. Expert Syst Appl 147:113192","journal-title":"Expert Syst Appl"},{"issue":"4","key":"1351_CR24","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1016\/S0191-2615(03)00026-2","volume":"38","author":"MH Poon","year":"2004","unstructured":"Poon MH, Wong SC, Tong CO (2004) A dynamic schedule-based model for congested transit networks. Transport Res Part B Methodol 38(4):343\u2013368","journal-title":"Transport Res Part B Methodol"},{"issue":"1","key":"1351_CR25","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1002\/net.21524","volume":"63","author":"J Qian","year":"2014","unstructured":"Qian J, Eglese R (2014) Finding least fuel emission paths in a network with time-varying speeds. Networks 63(1):96\u2013106","journal-title":"Networks"},{"issue":"2","key":"1351_CR26","doi-asserted-by":"publisher","DOI":"10.1002\/ett.3786","volume":"33","author":"Z Halim","year":"2022","unstructured":"Halim Z, Khan A, Sulaiman M et al (2022) On finding optimum commuting path in a road network: a computational approach for smart city traveling. Trans Emerg Telecommun Technol 33(2):e3786","journal-title":"Trans Emerg Telecommun Technol"},{"issue":"4","key":"1351_CR27","first-page":"592","volume":"59","author":"R Jaballah","year":"2021","unstructured":"Jaballah R, Veenstra M, Coelho LC et al (2021) The time-dependent shortest path and vehicle routing problem. Inf Syst Oper Res 59(4):592\u2013622","journal-title":"Inf Syst Oper Res"},{"issue":"1","key":"1351_CR28","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1016\/j.ejor.2020.05.041","volume":"288","author":"M Gmira","year":"2021","unstructured":"Gmira M, Gendreau M, Lodi A et al (2021) Tabu search for the time-dependent vehicle routing problem with time windows on a road network. Eur J Oper Res 288(1):129\u2013140","journal-title":"Eur J Oper Res"},{"key":"1351_CR29","doi-asserted-by":"crossref","unstructured":"Fa-mei HE, Yi-na XU, Xu-ren W et al (2019) An improved ant colony algorithm for solving time-dependent road network path planning problem. In: 2019 6th international conference on information science and control engineering (ICISCE). IEEE, 2019, pp 126\u2013130","DOI":"10.1109\/ICISCE48695.2019.00035"},{"key":"1351_CR30","doi-asserted-by":"publisher","first-page":"692","DOI":"10.1016\/j.procs.2017.05.379","volume":"109","author":"A Idri","year":"2017","unstructured":"Idri A, Oukarfi M, Boulmakoul A et al (2017) A new time-dependent shortest path algorithm for multimodal transportation network. Procedia Comput Sci 109:692\u2013697","journal-title":"Procedia Comput Sci"},{"key":"1351_CR31","doi-asserted-by":"crossref","unstructured":"Nannicini G (2010) Point-to-point shortest paths on dynamic time-dependent road networks. 4OR 8:327\u2013330","DOI":"10.1007\/s10288-010-0121-0"},{"issue":"11","key":"1351_CR32","doi-asserted-by":"publisher","first-page":"3194","DOI":"10.1109\/TITS.2016.2543262","volume":"17","author":"W Huang","year":"2016","unstructured":"Huang W, Wang J (2016) The shortest path problem on a time-dependent network with mixed uncertainty of randomness and fuzziness. IEEE Trans Intell Transp Syst 17(11):3194\u20133204","journal-title":"IEEE Trans Intell Transp Syst"},{"issue":"11","key":"1351_CR33","doi-asserted-by":"publisher","first-page":"3376","DOI":"10.1109\/TCOMM.2012.090512.100570","volume":"60","author":"W Huang","year":"2012","unstructured":"Huang W, Ding L (2012) The shortest path problem on a fuzzy time-dependent network. IEEE Trans Commun 60(11):3376\u20133385","journal-title":"IEEE Trans Commun"},{"key":"1351_CR34","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/j.neunet.2017.03.002","volume":"90","author":"W Huang","year":"2017","unstructured":"Huang W, Yan C, Wang J et al (2017) A time-delay neural network for solving time-dependent shortest path problem. Neural Netw 90:21\u201328","journal-title":"Neural Netw"},{"issue":"5","key":"1351_CR35","first-page":"714","volume":"43","author":"HE Hong","year":"2004","unstructured":"Hong HE, Daming ZHU, Shaohan MA (2004) A new algorithm for the shortest paths computation by neural networks on time-dependent networks. J Fudan (Nat Sci Ed) 43(5):714\u2013716","journal-title":"J Fudan (Nat Sci Ed)"},{"issue":"3","key":"1351_CR36","doi-asserted-by":"publisher","first-page":"2424","DOI":"10.1109\/TVT.2020.2964784","volume":"69","author":"Z Cao","year":"2020","unstructured":"Cao Z, Guo H, Song W et al (2020) Using reinforcement learning to minimize the probability of delay occurrence in transportation. IEEE Trans Veh Technol 69(3):2424\u20132436","journal-title":"IEEE Trans Veh Technol"},{"key":"1351_CR37","doi-asserted-by":"crossref","unstructured":"Huang W, Wang Y, Zhu L (2022) A time impulse neural network framework for solving the minimum path pair problems of the time-varying network. IEEE Trans Knowl Data Eng","DOI":"10.1109\/TKDE.2022.3217394"},{"key":"1351_CR38","doi-asserted-by":"crossref","unstructured":"Zhang K, Li M, Shan Y (2021) Reinforcement learning for shortest path problem on stochastic time-dependent road network. In: CICTP 2021. 2021, pp 410\u2013417","DOI":"10.1061\/9780784483565.040"},{"key":"1351_CR39","doi-asserted-by":"crossref","unstructured":"Jain A, Zamir A R, Savarese S et al (2016) Structural-rnn: Deep learning on spatio-temporal graphs. In: Proceedings of the ieee conference on computer vision and pattern recognition. 2016, pp 5308\u20135317","DOI":"10.1109\/CVPR.2016.573"},{"key":"1351_CR40","doi-asserted-by":"crossref","unstructured":"Brendel W, Todorovic S (2011) Learning spatiotemporal graphs of human activities. In: 2011 international conference on computer vision. IEEE, 2011, pp 778\u2013785","DOI":"10.1109\/ICCV.2011.6126316"},{"issue":"2","key":"1351_CR41","doi-asserted-by":"publisher","first-page":"498","DOI":"10.1109\/18.910572","volume":"47","author":"FR Kschischang","year":"2001","unstructured":"Kschischang FR, Frey BJ, Loeliger HA (2001) Factor graphs and the sum-product algorithm. IEEE Trans Inf Theory 47(2):498\u2013519","journal-title":"IEEE Trans Inf Theory"},{"key":"1351_CR42","doi-asserted-by":"crossref","unstructured":"Vemula A, Muelling K, Oh J (2018) Social attention: Modeling attention in human crowds. In: 2018 IEEE international conference on robotics and automation (ICRA). IEEE, 2018, pp 4601\u20134607","DOI":"10.1109\/ICRA.2018.8460504"},{"issue":"7","key":"1351_CR43","first-page":"1387","volume":"48","author":"Hu Guo Rongmei","year":"2020","unstructured":"Guo Rongmei Hu, Xiaobing. (2020) An effective method to find the k shortest paths in a generalized time-window network. Acta Electron Sin 48(7):1387","journal-title":"Acta Electron Sin"},{"issue":"06","key":"1351_CR44","first-page":"118","volume":"38","author":"LIU Cheng-yue","year":"2020","unstructured":"Cheng-yue LIU, Jia-ru LI, Xiao-bing HU (2020) A new method to calculate the k best solutions to the project time management problem. Syst Eng 38(06):118\u2013128","journal-title":"Syst Eng"},{"key":"1351_CR45","unstructured":"Zhang MK, Hu XB, Wang JA (2019) Research on evacuation route from high-rise building under real effect of fire spread. China Saf Sci J 29(03)"},{"issue":"09","key":"1351_CR46","first-page":"116","volume":"46","author":"H Liu","year":"2018","unstructured":"Liu H, Liu Q, Zhang L, Ding N (2018) A fast selection method of division node in large power grid. Power Syst Prot Control 46(09):116\u2013121","journal-title":"Power Syst Prot Control"},{"key":"1351_CR47","unstructured":"Zhang Y, Zhang G, Li H, Hu X (2022) Research on evacuation model of cellular automata based on ripple spreading algorithm. J Saf Environ 1\u201312"},{"key":"1351_CR48","unstructured":"Chen XL,Yang J, Luo C et al (2015) A high-speed searching method for power flow transferring paths in large power grid. Power Syst Technol 39(4):1045\u20131052"},{"issue":"03","key":"1351_CR49","volume":"40","author":"Hu Xiaobing","year":"2022","unstructured":"Xiaobing Hu, Xuemei Z, Hang Z, Yiming Ma (2022) A method for improved air luggage check-in service based on optimized urban mobile stations. J Transport Inf Saf 40(03):136145","journal-title":"J Transport Inf Saf"},{"key":"1351_CR50","doi-asserted-by":"crossref","unstructured":"Xu W, Li J (2020) A fissile ripple spreading algorithm to solve timedependent vehicle routing problem via coevolutionary path optimization. J Adv Transport 2020","DOI":"10.1155\/2020\/8815983"},{"issue":"21","key":"1351_CR51","doi-asserted-by":"publisher","first-page":"5961","DOI":"10.3390\/su11215961","volume":"11","author":"M Zhang","year":"2019","unstructured":"Zhang M, Hu X, Wang J (2019) A method to assess and reduce pollutant emissions of logistic transportation under adverse weather. Sustainability 11(21):5961","journal-title":"Sustainability"},{"key":"1351_CR52","doi-asserted-by":"crossref","unstructured":"Zhang MK, Hu XB, Liao JQ (2016) A new path optimization method in dynamic adverse weathers. In: 2016 12th international conference on natural computation, fuzzy systems and knowledge discovery (ICNCFSKD). IEEE, pp 370\u2013375","DOI":"10.1109\/FSKD.2016.7603202"},{"key":"1351_CR53","doi-asserted-by":"crossref","unstructured":"Hu XB, Leeson MS, Hines EL et al (2010) A review on ripple-spreading genetic algorithms for combinatorial optimization problems. In: 9th IEEE international conference on cognitive informatics (ICCI\u201910). IEEE, 2010, pp 441\u2013448","DOI":"10.1109\/COGINF.2010.5599700"},{"key":"1351_CR54","doi-asserted-by":"crossref","unstructured":"Zhou H, Hu XB (2020) A ripple spreading algorithm for free-flight route optimization in dynamical airspace. In: 2020 IEEE symposium series on computational intelligence (SSCI). IEEE, 2020, pp 281\u2013288","DOI":"10.1109\/SSCI47803.2020.9308357"},{"key":"1351_CR55","doi-asserted-by":"crossref","unstructured":"Liao JQ, Hu XB, Wang M et al (2012) A ripple-spreading network model for the study of infectious disease transmission. In: 2012 5th international conference IEEE, 2012, p 10041010","DOI":"10.1109\/BMEI.2012.6513120"},{"key":"1351_CR56","doi-asserted-by":"crossref","unstructured":"Yingfei Z, Gongpeng Z, Ruixin W et al (2020) A simulation method of personnel evacuation management based on mulit-agent models. In: 2020 IEEE symposium series on computational intelligence (SSCI). IEEE, 2020, pp 1634\u20131639","DOI":"10.1109\/SSCI47803.2020.9308274"},{"key":"1351_CR57","doi-asserted-by":"publisher","DOI":"10.1007\/s40747-023-01260-8","author":"S Yu","year":"2023","unstructured":"Yu S, Song Y (2023) Ripple spreading algorithm: a new method for solving multi-objective shortest path problems with mixed time windows. Complex Intell Syst. https:\/\/doi.org\/10.1007\/s40747-023-01260-8","journal-title":"Complex Intell Syst"},{"key":"1351_CR58","doi-asserted-by":"crossref","unstructured":"Ma Y, Hu X, Zhou H (2022) Efficient ripple-spreading algorithm for shortest path tour problem. Appl Res Comput 1\u20137","DOI":"10.1109\/SSCI51031.2022.10022124"},{"issue":"2","key":"1351_CR59","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1162\/EVCO_a_00156","volume":"24","author":"XB Hu","year":"2016","unstructured":"Hu XB, Wang M, Leeson MS et al (2016) Deterministic agent-based path optimization by mimicking the spreading of ripples. Evol Comput 24(2):319\u2013346","journal-title":"Evol Comput"},{"key":"1351_CR60","doi-asserted-by":"crossref","unstructured":"Ma YM, Hu XB, Zhou H (2022) A deterministic and nature-inspired algorithm for the fuzzy multi-objective path optimization problem. Complex Intell Syst 1\u201313","DOI":"10.1007\/s40747-022-00825-3"},{"key":"1351_CR61","doi-asserted-by":"crossref","unstructured":"Hu XB, Zhang MK, Liao JQ (2016) A ripple-spreading algorithm for network performance assessment. In: 2016 IEEE symposium series on computational intelligence (SSCI). IEEE, 2016, pp 1\u20138","DOI":"10.1109\/SSCI.2016.7850142"},{"key":"1351_CR62","doi-asserted-by":"crossref","unstructured":"Hu XB, Wang M, Sun Q et al (2013) A ripple-spreading algorithm for route optimization. In: 2013 IEEE symposium on foundations of computational intelligence (FOCI). IEEE, p 5259","DOI":"10.1109\/FOCI.2013.6602455"},{"issue":"08","key":"1351_CR63","first-page":"297","volume":"58","author":"XB Hu","year":"2022","unstructured":"Hu XB, Meng XZ (2022) Many-to-many path planning method for material distribution under dynamic disaster environment. Comput Eng Appl 58(08):297\u2013306","journal-title":"Comput Eng Appl"},{"key":"1351_CR64","unstructured":"SETA EU Project (2016) A ubiquitous data and service ecosystem for better metropolitan mobility, Horizon 2020 Programme. http:\/\/setamobility.weebly.com\/"},{"key":"1351_CR65","doi-asserted-by":"crossref","unstructured":"Kim Y, Wang P, Zhu Y et al (2018) A capsule network for traffic speed prediction in complex road networks. In: 2018 sensor data fusion: trends, solutions, applications (SDF). IEEE, pp 1\u20136","DOI":"10.1109\/SDF.2018.8547068"},{"key":"1351_CR66","unstructured":"OpenITS Org (2021) OpenData V12.0-large-scale traffic speed data set. https:\/\/www.openits.cn\/openData2\/792.jhtml. Accessed 3 Dec 2023"},{"key":"1351_CR67","unstructured":"Kingma DP, Ba J (2014) Adam: a method for stochastic optimization. arXiv:1412.6980"},{"issue":"4","key":"1351_CR68","doi-asserted-by":"publisher","first-page":"699","DOI":"10.1287\/opre.14.4.699","volume":"14","author":"EL Lawler","year":"1966","unstructured":"Lawler EL, Wood DE (1966) Branch-and-bound methods: a survey. Oper Res 14(4):699\u2013719","journal-title":"Oper Res"},{"key":"1351_CR69","doi-asserted-by":"publisher","first-page":"8091","DOI":"10.1007\/s11042-020-10139-6","volume":"80","author":"S Katoch","year":"2021","unstructured":"Katoch S, Chauhan SS, Kumar V (2021) A review on genetic algorithm: past, present, and future. Multim Tools Appl 80:8091\u20138126","journal-title":"Multim Tools Appl"}],"container-title":["Complex &amp; Intelligent Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40747-024-01351-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s40747-024-01351-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40747-024-01351-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,16]],"date-time":"2024-05-16T18:25:54Z","timestamp":1715883954000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s40747-024-01351-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,3,5]]},"references-count":69,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2024,6]]}},"alternative-id":["1351"],"URL":"https:\/\/doi.org\/10.1007\/s40747-024-01351-0","relation":{},"ISSN":["2199-4536","2198-6053"],"issn-type":[{"value":"2199-4536","type":"print"},{"value":"2198-6053","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,3,5]]},"assertion":[{"value":"8 September 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 January 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 March 2024","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":"Ethics approval and consent to participate"}}]}}