{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,28]],"date-time":"2026-03-28T07:57:46Z","timestamp":1774684666740,"version":"3.50.1"},"reference-count":47,"publisher":"Springer Science and Business Media LLC","issue":"2-3","license":[{"start":{"date-parts":[[2023,5,8]],"date-time":"2023-05-08T00:00:00Z","timestamp":1683504000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,5,8]],"date-time":"2023-05-08T00:00:00Z","timestamp":1683504000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Heuristics"],"published-print":{"date-parts":[[2023,6]]},"DOI":"10.1007\/s10732-023-09510-1","type":"journal-article","created":{"date-parts":[[2023,5,8]],"date-time":"2023-05-08T11:01:57Z","timestamp":1683543717000},"page":"269-311","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["A hybrid heuristic algorithm for urban distribution with simultaneous pickup-delivery and time window"],"prefix":"10.1007","volume":"29","author":[{"given":"Fagui","family":"Liu","sequence":"first","affiliation":[]},{"given":"Lvshengbiao","family":"Wang","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3031-4134","authenticated-orcid":false,"given":"Mengke","family":"Gui","sequence":"additional","affiliation":[]},{"given":"Yang","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Yulin","family":"Lan","sequence":"additional","affiliation":[]},{"given":"Chengqi","family":"Lai","sequence":"additional","affiliation":[]},{"given":"Boyuan","family":"Zhu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,5,8]]},"reference":[{"issue":"3","key":"9510_CR1","doi-asserted-by":"publisher","first-page":"386","DOI":"10.1016\/j.ejor.2012.11.040","volume":"226","author":"S Almoustafa","year":"2013","unstructured":"Almoustafa, S., Hanafi, S., Mladenovi\u0107, N.: New exact method for large asymmetric distance-constrained vehicle routing problem. Eur. J. Oper. Res. 226(3), 386\u2013394 (2013). https:\/\/doi.org\/10.1016\/j.ejor.2012.11.040","journal-title":"Eur. J. Oper. Res."},{"issue":"4","key":"9510_CR2","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1093\/comjnl\/3.4.237","volume":"3","author":"JS Appleby","year":"1961","unstructured":"Appleby, J.S., Blake, D.V., Newman, E.A.: Techniques for producing school timetables on a computer and their application to other scheduling problems. Comput. J. 3(4), 237\u2013245 (1961). https:\/\/doi.org\/10.1093\/comjnl\/3.4.237","journal-title":"Comput. J."},{"key":"9510_CR3","doi-asserted-by":"publisher","unstructured":"Auer, P.: Finite-time analysis of the multiarmed bandit problem. Mach. Learn. 47 (2002). https:\/\/doi.org\/10.1023\/A:1013689704352","DOI":"10.1023\/A:1013689704352"},{"key":"9510_CR4","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1016\/j.cie.2015.02.002","volume":"83","author":"M Avci","year":"2015","unstructured":"Avci, M., Topaloglu, S.: An adaptive local search algorithm for vehicle routing problem with simultaneous and mixed pickups and deliveries. Comput. Ind. Eng. 83, 15\u201329 (2015). https:\/\/doi.org\/10.1016\/j.cie.2015.02.002","journal-title":"Comput. Ind. Eng."},{"key":"9510_CR5","doi-asserted-by":"publisher","unstructured":"Avci, M., Topaloglu, S.: A hybrid metaheuristic algorithm for heterogeneous vehicle routing problem with simultaneous pickup and delivery. Expert Syst. Appl. (2016). https:\/\/doi.org\/10.1016\/j.eswa.2016.01.038","DOI":"10.1016\/j.eswa.2016.01.038"},{"issue":"3","key":"9510_CR6","doi-asserted-by":"publisher","first-page":"756","DOI":"10.1016\/j.ejor.2009.06.034","volume":"202","author":"N Azi","year":"2007","unstructured":"Azi, N., Gendreau, M., Potvin, J.Y.: An exact algorithm for a vehicle routing problem with time windows and multiple use of vehicles. Eur. J. Oper. Res. 202(3), 756\u2013763 (2007). https:\/\/doi.org\/10.1016\/j.ejor.2009.06.034","journal-title":"Eur. J. Oper. Res."},{"key":"9510_CR7","doi-asserted-by":"publisher","unstructured":"Battarra, M., Erdo\u011fan, G., Vigo, D.: Exact algorithms for the clustered vehicle routing problem. Oper. Res. (2014). https:\/\/doi.org\/10.1287\/opre.2013.1227","DOI":"10.1287\/opre.2013.1227"},{"key":"9510_CR8","doi-asserted-by":"publisher","unstructured":"Boubahri, L., Addouche, S.A., El\u00a0Mhamedi, A., et\u00a0al.: Multi-ant colonies algorithms for the vrpspdtw. In: 2011 International Conference on Communications, Computing and Control Applications, CCCA (2011) https:\/\/doi.org\/10.1109\/CCCA.2011.6031488","DOI":"10.1109\/CCCA.2011.6031488"},{"key":"9510_CR9","doi-asserted-by":"publisher","unstructured":"Braekers, K., Ramaekers, K., Nieuwenhuyse, I.V.: The vehicle routing problem: state of the art classification and review. Comput. Ind. Eng. 99(Sep.):300\u2013313. https:\/\/doi.org\/10.1016\/j.cie.2015.12.007 (2016)","DOI":"10.1016\/j.cie.2015.12.007"},{"key":"9510_CR10","unstructured":"Burke, E., Bykov, Y.: The late acceptance hillclimbing heuristic. In: Computing Science and Mathematics (2012)"},{"key":"9510_CR11","unstructured":"Burke, E.K., Bykov, Y.: A late acceptance strategy in hill-climbing for examination timetabling problems. In: Proceedings of the Conference on the Practice and Theory of Automated Timetabling (PATAT 2008) (2008)"},{"issue":"1","key":"9510_CR12","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1016\/j.ejor.2016.07.012","volume":"258","author":"EK Burke","year":"2017","unstructured":"Burke, E.K., Bykov, Y.: The late acceptance hill-climbing heuristic. Eur. J. Oper. Res. 258(1), 70\u201378 (2017). https:\/\/doi.org\/10.1016\/j.ejor.2016.07.012","journal-title":"Eur. J. Oper. Res."},{"issue":"4","key":"9510_CR13","doi-asserted-by":"publisher","first-page":"581","DOI":"10.1007\/s10732-018-9369-x","volume":"24","author":"OR Castro","year":"2018","unstructured":"Castro, O.R., et al.: Evaluating selection methods on hyper-heuristic multi-objective particle swarm optimization. J. Heuristics 24(4), 581\u2013616 (2018). https:\/\/doi.org\/10.1007\/s10732-018-9369-x","journal-title":"J. Heuristics"},{"issue":"11","key":"9510_CR14","doi-asserted-by":"publisher","first-page":"1296","DOI":"10.1057\/palgrave.jors.2601935","volume":"56","author":"J Crispim","year":"2005","unstructured":"Crispim, J., Brand\u00e3o, J.: Metaheuristics applied to mixed and simultaneous extensions of vehicle routing problems with backhauls. J. Oper. Res. Soc. 56(11), 1296\u20131302 (2005). https:\/\/doi.org\/10.1057\/palgrave.jors.2601935","journal-title":"J. Oper. Res. Soc."},{"issue":"1","key":"9510_CR15","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/PL00013346","volume":"23","author":"J Dethloff","year":"2001","unstructured":"Dethloff, J.: Vehicle routing and reverse logistics: the vehicle routing problem with simultaneous delivery and pick-up. OR-Spektrum 23(1), 79\u201396 (2001)","journal-title":"OR-Spektrum"},{"issue":"1","key":"9510_CR16","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1006\/jcph.1993.1010","volume":"104","author":"G Dueck","year":"1993","unstructured":"Dueck, G.: New optimization heuristics: the great deluge algorithm and the record-to-record travel. J. Comput. Phys. 104(1), 86\u201392 (1993). https:\/\/doi.org\/10.1006\/jcph.1993.1010","journal-title":"J. Comput. Phys."},{"issue":"1","key":"9510_CR17","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1016\/0021-9991(90)90201-B","volume":"90","author":"G Dueck","year":"1990","unstructured":"Dueck, G., Scheuer, T.: Threshold accepting: a general purpose optimization algorithm appearing superior to simulated annealing. J. Comput. Phys. 90(1), 161\u2013175 (1990). https:\/\/doi.org\/10.1016\/0021-9991(90)90201-B","journal-title":"J. Comput. Phys."},{"key":"9510_CR18","doi-asserted-by":"publisher","unstructured":"Ferreira, A., Gon\u00e7alves, R., Pozo, A.: A multi-armed bandit selection strategy for hyper-heuristics. In: 2017 IEEE Congress on Evolutionary Computation (CEC), pp. 525\u2013532. https:\/\/doi.org\/10.1109\/CEC.2017.7969356 (2017)","DOI":"10.1109\/CEC.2017.7969356"},{"key":"9510_CR19","doi-asserted-by":"publisher","unstructured":"Gillett, B.E., Miller, L.R.: A heuristic algorithm for the vehicle dispatching problem. Oper. Res. 22(2). https:\/\/doi.org\/10.1287\/opre.22.2.340(1974)","DOI":"10.1287\/opre.22.2.340"},{"key":"9510_CR20","doi-asserted-by":"publisher","unstructured":"Glover, F.: New ejection chain and alternating path methods for traveling salesman problems. In: Balci, O., Sharda, R., Zenios, S.A. (eds) Computer Science and Operations Research. Pergamon, Amsterdam, pp. 491\u2013509. https:\/\/doi.org\/10.1016\/B978-0-08-040806-4.50037-X (1992)","DOI":"10.1016\/B978-0-08-040806-4.50037-X"},{"issue":"1","key":"9510_CR21","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/0377-2217(89)90057-X","volume":"42","author":"M Goetschalckx","year":"1989","unstructured":"Goetschalckx, M., Jacobs-Blecha, C.: The vehicle routing problem with backhauls. Eur. J. Oper. Res. 42(1), 39\u201351 (1989). https:\/\/doi.org\/10.1016\/0377-2217(89)90057-X","journal-title":"Eur. J. Oper. Res."},{"key":"9510_CR22","doi-asserted-by":"publisher","unstructured":"Gong, W., Fialho, \u00c1., Cai, Z,.Li, H.: Adaptive strategy selection in differential evolution for numerical optimization: an empirical study. Inf. Sci. 181(24), 5364\u20135386 (2011). https:\/\/doi.org\/10.1016\/j.ins.2011.07.049","DOI":"10.1016\/j.ins.2011.07.049"},{"issue":"3","key":"9510_CR23","doi-asserted-by":"publisher","first-page":"603","DOI":"10.1016\/j.ejor.2014.07.012","volume":"240","author":"K Govindan","year":"2015","unstructured":"Govindan, K., Soleimani, H., Kannan, D.: Reverse logistics and closed-loop supply chain: a comprehensive review to explore the future. Eur. J. Oper. Res. 240(3), 603\u2013626 (2015). https:\/\/doi.org\/10.1016\/j.ejor.2014.07.012","journal-title":"Eur. J. Oper. Res."},{"key":"9510_CR24","doi-asserted-by":"publisher","unstructured":"Hof, J., Schneider, M.: An adaptive large neighborhood search with path relinking for a class of vehicle-routing problems with simultaneous pickup and delivery. Networks (2019). https:\/\/doi.org\/10.1002\/net.21879","DOI":"10.1002\/net.21879"},{"key":"9510_CR25","doi-asserted-by":"crossref","unstructured":"Homberger, J., Gehring, H.: Two evolutionary metaheuristics for the vehicle routing problem with time windows. INFOR: Inf. Syst. Oper. Res. 37(3) 297\u2013318 (1999). https:\/\/doi.org\/10.1080\/03155986.1999.11732386","DOI":"10.1080\/03155986.1999.11732386"},{"issue":"5","key":"9510_CR26","doi-asserted-by":"publisher","first-page":"5641","DOI":"10.1016\/j.eswa.2011.11.053","volume":"39","author":"Y Jun","year":"2012","unstructured":"Jun, Y., Kim, B.I.: New best solutions to VRPSPD benchmark problems by a perturbation based algorithm. Expert Syst. Appl. 39(5), 5641\u20135648 (2012). https:\/\/doi.org\/10.1016\/j.eswa.2011.11.053","journal-title":"Expert Syst. Appl."},{"key":"9510_CR27","doi-asserted-by":"publisher","unstructured":"Kalayci, C.B., Kaya, C.: An ant colony system empowered variable neighborhood search algorithm for the vehicle routing problem with simultaneous pickup and delivery. Expert Syst. Appl. 66(Dec):163\u2013175. https:\/\/doi.org\/10.1016\/j.eswa.2016.09.017 (2016)","DOI":"10.1016\/j.eswa.2016.09.017"},{"issue":"4598","key":"9510_CR28","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"S Kirkpatrick","year":"1983","unstructured":"Kirkpatrick, S., Gelatt, C.D., Vecchi, M.P.: Optimization by simulated annealing. Science 220(4598), 671\u2013680 (1983). https:\/\/doi.org\/10.1126\/science.220.4598.671","journal-title":"Science"},{"issue":"2","key":"9510_CR29","doi-asserted-by":"publisher","first-page":"469","DOI":"10.3934\/jimo.2012.8.469","volume":"8","author":"M Lai","year":"2017","unstructured":"Lai, M., Tong, X.: A metaheuristic method for vehicle routing problem based on improved ant colony optimization and tabu search. J. Ind. Manag. Optim. 8(2), 469\u2013484 (2017)","journal-title":"J. Ind. Manag. Optim."},{"key":"9510_CR30","doi-asserted-by":"publisher","unstructured":"Liu, F., Gui, M., Yi, C., et\u00a0al.: A fast decomposition and reconstruction framework for the pickup and delivery problem with time windows and lifo loading. IEEE Access PP(99):1\u20131. https:\/\/doi.org\/10.1109\/ACCESS.2019.2920444 (2019)","DOI":"10.1109\/ACCESS.2019.2920444"},{"key":"9510_CR31","doi-asserted-by":"publisher","first-page":"282","DOI":"10.1016\/j.jclepro.2018.08.310","volume":"204","author":"J Liu","year":"2018","unstructured":"Liu, J., Yuan, C., Hafeez, M., et al.: The relationship between environment and logistics performance: evidence from Asian countries. J. Clean. Prod. 204, 282\u2013291 (2018). https:\/\/doi.org\/10.1016\/j.jclepro.2018.08.310","journal-title":"J. Clean. Prod."},{"issue":"3","key":"9510_CR32","doi-asserted-by":"publisher","first-page":"475","DOI":"10.1016\/j.ejor.2013.04.044","volume":"230","author":"R Liu","year":"2013","unstructured":"Liu, R., Xie, X., Augusto, V., et al.: Heuristic algorithms for a vehicle routing problem with simultaneous delivery and pickup and time windows in home health care. Eur. J. Oper. Res. 230(3), 475\u2013486 (2013). https:\/\/doi.org\/10.1016\/j.ejor.2013.04.044","journal-title":"Eur. J. Oper. Res."},{"issue":"9","key":"9510_CR33","doi-asserted-by":"publisher","first-page":"4475","DOI":"10.1016\/j.eswa.2013.12.050","volume":"41","author":"M Maashi","year":"2014","unstructured":"Maashi, M., \u00d6zcan, E., Kendall, G.: A multi-objective hyper-heuristic based on choice function. Expert Syst. Appl. 41(9), 4475\u20134493 (2014). https:\/\/doi.org\/10.1016\/j.eswa.2013.12.050","journal-title":"Expert Syst. Appl."},{"issue":"2","key":"9510_CR34","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1016\/j.engappai.2009.09.001","volume":"23","author":"L Mingyong","year":"2010","unstructured":"Mingyong, L., Erbao, C.: An improved differential evolution algorithm for vehicle routing problem with simultaneous pickups and deliveries and time windows. Eng. Appl. Artif. Intell. 23(2), 188\u2013195 (2010). https:\/\/doi.org\/10.1016\/j.engappai.2009.09.001","journal-title":"Eng. Appl. Artif. Intell."},{"issue":"1","key":"9510_CR35","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1016\/j.ejor.2002.11.003","volume":"162","author":"G Nagy","year":"2005","unstructured":"Nagy, G., Salhi, S.: Heuristic algorithms for single and multiple depot vehicle routing problems with pickups and deliveries. Eur. J. Oper. Res. 162(1), 126\u2013141 (2005). https:\/\/doi.org\/10.1016\/j.ejor.2002.11.003","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"9510_CR36","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1016\/j.ejor.2014.10.010","volume":"242","author":"O Polat","year":"2015","unstructured":"Polat, O., Kalayci, C.B., Kulak, O., et al.: A perturbation based variable neighborhood search heuristic for solving the vehicle routing problem with simultaneous pickup and delivery with time limit. Eur. J. Oper. Res. 242(2), 369\u2013382 (2015). https:\/\/doi.org\/10.1016\/j.ejor.2014.10.010","journal-title":"Eur. J. Oper. Res."},{"key":"9510_CR37","doi-asserted-by":"crossref","unstructured":"Robbins, H.: Some aspects of the sequential design of experiments. Bull. Am. Math. Soc. 58(5):527\u2013535 (1985)","DOI":"10.1090\/S0002-9904-1952-09620-8"},{"issue":"2","key":"9510_CR38","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1109\/TCYB.2014.2323936","volume":"45","author":"NR Sabar","year":"2015","unstructured":"Sabar, N.R., Ayob, M., Kendall, G., et al.: A dynamic multiarmed bandit-gene expression programming hyper-heuristic for combinatorial optimization problems. IEEE Trans. Cybern. 45(2), 217\u2013228 (2015). https:\/\/doi.org\/10.1109\/TCYB.2014.2323936","journal-title":"IEEE Trans. Cybern."},{"issue":"103","key":"9510_CR39","doi-asserted-by":"publisher","first-page":"901","DOI":"10.1016\/j.engappai.2020.103901","volume":"95","author":"Y Shi","year":"2020","unstructured":"Shi, Y., Zhou, Y., Boudouh, T., et al.: A lexicographic-based two-stage algorithm for vehicle routing problem with simultaneous pickup-delivery and time window. Eng. Appl. Artif. Intell. 95(103), 901 (2020). https:\/\/doi.org\/10.1016\/j.engappai.2020.103901","journal-title":"Eng. Appl. Artif. Intell."},{"issue":"2","key":"9510_CR40","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1287\/opre.35.2.254","volume":"35","author":"MM Solomon","year":"1987","unstructured":"Solomon, M.M.: Algorithms for the vehicle routing and scheduling problems with time window constraints. Oper. Res. 35(2), 254\u2013265 (1987). https:\/\/doi.org\/10.1287\/opre.35.2.254","journal-title":"Oper. Res."},{"key":"9510_CR41","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-13193-6_24","volume-title":"New Lower Bounds for the Vehicle Routing Problem with Simultaneous Pickup and Delivery","author":"A Subramanian","year":"2010","unstructured":"Subramanian, A., Uchoa, E., Ochi, L.S.: New Lower Bounds for the Vehicle Routing Problem with Simultaneous Pickup and Delivery. Springer, Berlin (2010)"},{"issue":"5","key":"9510_CR42","doi-asserted-by":"publisher","first-page":"338","DOI":"10.1016\/j.orl.2011.06.012","volume":"39","author":"A Subramanian","year":"2011","unstructured":"Subramanian, A., Uchoa, E., Pessoa, A.A., et al.: Branch-and-cut with lazy separation for the vehicle routing problem with simultaneous pickup and delivery. Oper. Res. Lett. 39(5), 338\u2013341 (2011). https:\/\/doi.org\/10.1016\/j.orl.2011.06.012","journal-title":"Oper. Res. Lett."},{"issue":"7","key":"9510_CR43","doi-asserted-by":"publisher","first-page":"1569","DOI":"10.1007\/s11590-012-0570-9","volume":"7","author":"A Subramanian","year":"2013","unstructured":"Subramanian, A., Uchoa, E., Pessoa, A.A.: Branch-cut-and-price for the vehicle routing problem with simultaneous pickup and delivery. Optim. Lett. 7(7), 1569\u20131581 (2013)","journal-title":"Optim. Lett."},{"issue":"may","key":"9510_CR44","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1016\/j.cie.2015.02.005","volume":"83","author":"C Wang","year":"2015","unstructured":"Wang, C., Mu, D., Zhao, F., et al.: A parallel simulated annealing method for the vehicle routing problem with simultaneous pickup-delivery and time windows. Comput. Ind. Eng. 83(may), 111\u2013122 (2015). https:\/\/doi.org\/10.1016\/j.cie.2015.02.005","journal-title":"Comput. Ind. Eng."},{"issue":"1","key":"9510_CR45","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1016\/j.cie.2011.08.018","volume":"62","author":"HF Wang","year":"2012","unstructured":"Wang, H.F., Chen, Y.Y.: A genetic algorithm for the simultaneous delivery and pickup problems with time window. Comput. Ind. Eng. 62(1), 84\u201395 (2012). https:\/\/doi.org\/10.1016\/j.cie.2011.08.018","journal-title":"Comput. Ind. Eng."},{"issue":"1","key":"9510_CR46","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1057\/palgrave.jors.2601957","volume":"57","author":"NA Wassan","year":"2006","unstructured":"Wassan, N.A.: A reactive tabu search for the vehicle routing problem. J. Oper. Res. Soc. 57(1), 111\u2013116 (2006)","journal-title":"J. Oper. Res. Soc."},{"issue":"2","key":"9510_CR47","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1080\/21681015.2014.893928","volume":"31","author":"M Yousefikhoshbakht","year":"2014","unstructured":"Yousefikhoshbakht, M., Didehvar, F., Rahmati, F.: A combination of modified tabu search and elite ant system to solve the vehicle routing problem with simultaneous pickup and delivery. J. Chin. Inst. Ind. Eng. 31(2), 65\u201375 (2014). https:\/\/doi.org\/10.1080\/21681015.2014.893928","journal-title":"J. Chin. Inst. Ind. Eng."}],"container-title":["Journal of Heuristics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-023-09510-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10732-023-09510-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-023-09510-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,12]],"date-time":"2023-06-12T11:32:30Z","timestamp":1686569550000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10732-023-09510-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,5,8]]},"references-count":47,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[2023,6]]}},"alternative-id":["9510"],"URL":"https:\/\/doi.org\/10.1007\/s10732-023-09510-1","relation":{},"ISSN":["1381-1231","1572-9397"],"issn-type":[{"value":"1381-1231","type":"print"},{"value":"1572-9397","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,5,8]]},"assertion":[{"value":"28 January 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 November 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 March 2023","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 May 2023","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"The authors declare that there are no conflict of interests, we do not have any potential conflicts of interest.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}