{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,28]],"date-time":"2026-04-28T01:59:58Z","timestamp":1777341598340,"version":"3.51.4"},"reference-count":53,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2022,1,10]],"date-time":"2022-01-10T00:00:00Z","timestamp":1641772800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,10]],"date-time":"2022-01-10T00:00:00Z","timestamp":1641772800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Heuristics"],"published-print":{"date-parts":[[2022,2]]},"DOI":"10.1007\/s10732-021-09489-7","type":"journal-article","created":{"date-parts":[[2022,1,10]],"date-time":"2022-01-10T05:02:30Z","timestamp":1641790950000},"page":"23-59","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Using state-space shortest-path heuristics to solve the long-haul point-to-point vehicle routing and driver scheduling problem subject to hours-of-service regulatory constraints"],"prefix":"10.1007","volume":"28","author":[{"given":"Daiane Maria","family":"De Genaro Chiroli","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S\u00e9rgio Fernando","family":"Mayerle","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0490-9591","authenticated-orcid":false,"given":"Jo\u00e3o Neiva","family":"de Figueiredo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,1,10]]},"reference":[{"key":"9489_CR1","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1016\/j.tre.2019.08.004","volume":"129","author":"JJ Alcaraz","year":"2019","unstructured":"Alcaraz, J.J., Caballero-Arnaldos, L., Vales-Alonso, J.: Rich vehicle routing problem with last-mile outsourcing decisions. Transp. Res. Part E Logist. Transp. Rev. 129, 263\u2013286 (2019)","journal-title":"Transp. Res. Part E Logist. Transp. Rev."},{"issue":"4","key":"9489_CR2","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1287\/trsc.1090.0278","volume":"43","author":"C Archetti","year":"2009","unstructured":"Archetti, C., Savelsbergh, M.: The trip scheduling problem. Transp. Sci. 43(4), 417\u2013431 (2009)","journal-title":"Transp. Sci."},{"key":"9489_CR3","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1016\/j.measurement.2014.10.014","volume":"60","author":"MK Ardakani","year":"2015","unstructured":"Ardakani, M.K., Tavana, M.: A decremental approach with the $$a^*$$ algorithm for speeding-up the optimization process in dynamic shortest path problems. Measurement 60, 299\u2013307 (2015)","journal-title":"Measurement"},{"issue":"2","key":"9489_CR4","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1016\/S0377-2217(02)00262-X","volume":"142","author":"P Avella","year":"2002","unstructured":"Avella, P., Boccia, M., Sforza, A.: A penalty function heuristic for the resource constrained shortest path problem. Eur. J. Oper. Res. 142(2), 221\u2013230 (2002)","journal-title":"Eur. J. Oper. Res."},{"issue":"6","key":"9489_CR5","doi-asserted-by":"crossref","first-page":"1627","DOI":"10.1287\/trsc.2018.0889","volume":"53","author":"M Baum","year":"2019","unstructured":"Baum, M., Dibbelt, J., Gemsa, A., Wagner, D., Z\u00fcndorf, T.: Shortest feasible paths with charging stops for battery electric vehicles. Transp. Sci. 53(6), 1627\u20131655 (2019)","journal-title":"Transp. Sci."},{"key":"9489_CR6","unstructured":"BRASIL, L., Lei n$$^\\circ $$ 13.103. Disp\u00f5e sobre o exerc\u00edcio da profiss\u00e3o de motorista. Dispon\u00edvel emhttp:\/\/www.planalto.gov.br\/ccivil_03\/_Ato2015-2018\/2015\/LeiL, 13103, (2015)"},{"issue":"2","key":"9489_CR7","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1111\/j.1475-3995.2009.00702.x","volume":"17","author":"ME Bruni","year":"2010","unstructured":"Bruni, M.E., Guerriero, F.: An enhanced exact procedure for the absolute robust shortest path problem. Int. Trans. Oper. Res. 17(2), 207\u2013220 (2010)","journal-title":"Int. Trans. Oper. Res."},{"issue":"3","key":"9489_CR8","doi-asserted-by":"crossref","first-page":"369","DOI":"10.1287\/trsc.1030.0046","volume":"38","author":"AM Campbell","year":"2004","unstructured":"Campbell, A.M., Savelsbergh, M.: Efficient insertion heuristics for vehicle routing and scheduling problems. Transp. Sci. 38(3), 369\u2013378 (2004)","journal-title":"Transp. Sci."},{"issue":"1","key":"9489_CR9","doi-asserted-by":"crossref","first-page":"56","DOI":"10.1287\/trsc.1080.0256","volume":"43","author":"A Ceselli","year":"2009","unstructured":"Ceselli, A., Righini, G., Salani, M.: A column generation algorithm for a rich vehicle-routing problem. Transp. Sci. 43(1), 56\u201369 (2009)","journal-title":"Transp. Sci."},{"issue":"1","key":"9489_CR10","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/trsc.2013.0472","volume":"48","author":"LC Coelho","year":"2014","unstructured":"Coelho, L.C., Cordeau, J.-F., Laporte, G.: Thirty years of inventory routing. Transp. Sci. 48(1), 1\u201319 (2014)","journal-title":"Transp. Sci."},{"issue":"5","key":"9489_CR11","doi-asserted-by":"crossref","first-page":"512","DOI":"10.1057\/palgrave.jors.2601319","volume":"53","author":"J-F Cordeau","year":"2002","unstructured":"Cordeau, J.-F., Gendreau, M., Laporte, G., Potvin, J.-Y., Semet, F.: A guide to vehicle routing heuristics. J. Oper. Res. Soci. 53(5), 512\u2013522 (2002)","journal-title":"J. Oper. Res. Soci."},{"issue":"2","key":"9489_CR12","doi-asserted-by":"crossref","first-page":"607","DOI":"10.1287\/trsc.2015.0651","volume":"51","author":"S Dabia","year":"2017","unstructured":"Dabia, S., Demir, E., Woensel, T.V.: An exact approach for a variant of the pollution-routing problem. Transp. Sci. 51(2), 607\u2013628 (2017)","journal-title":"Transp. Sci."},{"issue":"1","key":"9489_CR13","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1590\/S0101-74382003000100015","volume":"23","author":"JN de Figueiredo","year":"2003","unstructured":"de Figueiredo, J.N., Gonzaga, C.C.: Aplica\u00e7ao de m\u00e9todos de busca em grafos com n\u00f3s parcialmente ordenadosa loca\u00e7ao de torres de transmissao. Pesquisa Operacional 23(1), 209\u2013220 (2003)","journal-title":"Pesquisa Operacional"},{"issue":"6","key":"9489_CR14","doi-asserted-by":"crossref","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.: Shortest paths in piecewise continuous time-dependent networks. Oper. Res. Lett. 36(6), 688\u2013691 (2008)","journal-title":"Oper. Res. Lett."},{"key":"9489_CR15","doi-asserted-by":"crossref","unstructured":"Dijkstra, E.W.: A note on two problems in connexion with graphs: Numerische Mathematik. pages 269\u2013271, (1959)","DOI":"10.1007\/BF01386390"},{"issue":"2","key":"9489_CR16","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1007\/s12159-010-0022-9","volume":"2","author":"M Drexl","year":"2010","unstructured":"Drexl, M., Prescott-Gagnon, E.: Labelling algorithms for the elementary shortest path problem with resource constraints considering eu drivers\u2019 rules. Logist. Res. 2(2), 79\u201396 (2010)","journal-title":"Logist. Res."},{"issue":"4","key":"9489_CR17","doi-asserted-by":"crossref","first-page":"756","DOI":"10.1287\/trsc.2018.0820","volume":"52","author":"A Franceschetti","year":"2018","unstructured":"Franceschetti, A., Honhon, D., Laporte, G., Van Woensel, T.: A shortest-path algorithm for the departure time and speed optimization problem. Transp. Sci. 52(4), 756\u2013768 (2018)","journal-title":"Transp. Sci."},{"issue":"11","key":"9489_CR18","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, L.R.: Heuristic shortest path algorithms for transportation applications: state of the art. Comput. Oper. Res. 33(11), 3324\u20133343 (2006)","journal-title":"Comput. Oper. Res."},{"issue":"1","key":"9489_CR19","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1287\/trsc.1070.0226","volume":"43","author":"A Goel","year":"2009","unstructured":"Goel, A.: Vehicle scheduling and routing with drivers\u2019 working hours. Transp. Sci. 43(1), 17\u201326 (2009)","journal-title":"Transp. Sci."},{"issue":"10","key":"9489_CR20","doi-asserted-by":"crossref","first-page":"2359","DOI":"10.1016\/j.cor.2011.12.016","volume":"39","author":"A Goel","year":"2012","unstructured":"Goel, A.: The canadian minimum duration truck driver scheduling problem. Comput. Oper. Res. 39(10), 2359\u20132367 (2012)","journal-title":"Comput. Oper. Res."},{"issue":"6","key":"9489_CR21","first-page":"733","volume":"15","author":"A Goel","year":"2012","unstructured":"Goel, A.: A mixed integer programming formulation and effective cuts for minimising schedule durations of australian truck drivers. J. Sched. 15(6), 733\u2013741 (2012)","journal-title":"J. Sched."},{"key":"9489_CR22","doi-asserted-by":"crossref","first-page":"144","DOI":"10.1016\/j.tre.2018.02.011","volume":"114","author":"A Goel","year":"2018","unstructured":"Goel, A.: Legal aspects in road transport optimization in europe. Transp. Res. Part E Logist. Transp. Rev. 114, 144\u2013162 (2018)","journal-title":"Transp. Res. Part E Logist. Transp. Rev."},{"issue":"2","key":"9489_CR23","doi-asserted-by":"crossref","first-page":"737","DOI":"10.1287\/trsc.2016.0678","volume":"51","author":"A Goel","year":"2017","unstructured":"Goel, A., Irnich, S.: An exact method for vehicle routing and truck driver scheduling problems. Transp. Sci. 51(2), 737\u2013754 (2017)","journal-title":"Transp. Sci."},{"issue":"1","key":"9489_CR24","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1007\/s10696-011-9086-3","volume":"24","author":"A Goel","year":"2012","unstructured":"Goel, A., Kok, L.: Efficient scheduling of team truck drivers in the european union. Flex. Serv. Manuf. J. 24(1), 81\u201396 (2012)","journal-title":"Flex. Serv. Manuf. J."},{"issue":"3","key":"9489_CR25","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1287\/trsc.2013.0477","volume":"48","author":"A Goel","year":"2014","unstructured":"Goel, A., Vidal, T.: Hours of service regulations in road freight transport: an optimization-based international assessment. Transp. Sci. 48(3), 391\u2013412 (2014)","journal-title":"Transp. Sci."},{"issue":"5","key":"9489_CR26","doi-asserted-by":"crossref","first-page":"1122","DOI":"10.1016\/j.cor.2011.05.021","volume":"39","author":"A Goel","year":"2012","unstructured":"Goel, A., Archetti, C., Savelsbergh, M.: Truck driver scheduling in australia. Comput. Operat. Res. 39(5), 1122\u20131132 (2012)","journal-title":"Comput. Operat. Res."},{"key":"9489_CR27","doi-asserted-by":"crossref","unstructured":"Goel, A., Vidal, T., Kok, A.L.: To team up or not-single versus team driving in european road freight transport. Tech. Rep., PUC-Rio, Rio de Janeiro, Brasil, Technical report (2019)","DOI":"10.1007\/s10696-020-09398-0"},{"key":"9489_CR28","first-page":"156","volume":"5","author":"AV Goldberg","year":"2005","unstructured":"Goldberg, A.V., Harrelson, C.: Computing the shortest path: a search meets graph theory. SODA 5, 156\u2013165 (2005)","journal-title":"SODA"},{"issue":"2","key":"9489_CR29","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1109\/TSSC.1968.300136","volume":"4","author":"PE Hart","year":"1968","unstructured":"Hart, P.E., Nilsson, N.J., Raphael, B.: A formal basis for the heuristic determination of minimum cost paths. IEEE Trans. Syst. Sci. Cybern. 4(2), 100\u2013107 (1968)","journal-title":"IEEE Trans. Syst. Sci. Cybern."},{"key":"9489_CR30","doi-asserted-by":"crossref","first-page":"150","DOI":"10.1016\/j.cor.2016.04.013","volume":"73","author":"M Horv\u00e1th","year":"2016","unstructured":"Horv\u00e1th, M., Kis, T.: Solving resource constrained shortest path problems with lp-based methods. Comput. Oper. Res. 73, 150\u2013164 (2016)","journal-title":"Comput. Oper. Res."},{"issue":"4","key":"9489_CR31","first-page":"182","volume":"48","author":"G Klunder","year":"2006","unstructured":"Klunder, G., Post, H.: The shortest path problem on large-scale real-road networks. Netw Int J 48(4), 182\u2013194 (2006)","journal-title":"Netw Int J"},{"key":"9489_CR32","doi-asserted-by":"publisher","DOI":"10.1057\/s41274-017-0202-y","author":"\u00c7 Ko\u00e7","year":"2017","unstructured":"Ko\u00e7, \u00c7., Jabali, O., Laporte, G.: Long-haul vehicle routing and scheduling with idling options. J. Oper. Res. Soc. (2017). https:\/\/doi.org\/10.1057\/s41274-017-0202-y","journal-title":"J. Oper. Res. Soc."},{"issue":"4","key":"9489_CR33","doi-asserted-by":"crossref","first-page":"442","DOI":"10.1287\/trsc.1100.0331","volume":"44","author":"AL Kok","year":"2010","unstructured":"Kok, A.L., Meyer, C.M., Kopfer, H., Schutten, J.M.J.: A dynamic programming heuristic for the vehicle routing problem with time windows and european community social legislation. Transp. Sci. 44(4), 442\u2013454 (2010)","journal-title":"Transp. Sci."},{"issue":"4","key":"9489_CR34","doi-asserted-by":"crossref","first-page":"408","DOI":"10.1287\/trsc.1090.0301","volume":"43","author":"G Laporte","year":"2009","unstructured":"Laporte, G.: Fifty years of vehicle routing. Transp. Sci. 43(4), 408\u2013416 (2009)","journal-title":"Transp. Sci."},{"issue":"5","key":"9489_CR35","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/1754399.1754400","volume":"57","author":"L Mandow","year":"2008","unstructured":"Mandow, L., De La Cruz, J.L.P.: Multiobjective a* search with consistent heuristics. J. ACM (JACM) 57(5), 1\u201325 (2008)","journal-title":"J. ACM (JACM)"},{"key":"9489_CR36","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1016\/j.tra.2020.07.021","volume":"140","author":"SF Mayerle","year":"2020","unstructured":"Mayerle, S.F., Chiroli, D.M.D.G., de Figueiredo, J.N., Rodrigues, H.F.: The long-haul full-load vehicle routing and truck driver scheduling problem with intermediate stops: an economic impact evaluation of brazilian policy. Transp. Res. Part A. Policy Pract. 140, 36\u201351 (2020)","journal-title":"Transp. Res. Part A. Policy Pract."},{"issue":"10","key":"9489_CR37","doi-asserted-by":"crossref","first-page":"1667","DOI":"10.1016\/S0305-0548(03)00114-X","volume":"31","author":"R Montemanni","year":"2004","unstructured":"Montemanni, R., Gambardella, L.M.: An exact algorithm for the robust shortest path problem with interval data. Comput. Oper. Res. 31(10), 1667\u20131680 (2004)","journal-title":"Comput. Oper. Res."},{"issue":"5","key":"9489_CR38","doi-asserted-by":"crossref","first-page":"669","DOI":"10.1002\/1520-6750(199208)39:5<669::AID-NAV3220390506>3.0.CO;2-W","volume":"39","author":"I Murthy","year":"1992","unstructured":"Murthy, I., Her, S.-S.: Solving min-max shortest-path problems on a network. Naval Res. Logist. (NRL) 39(5), 669\u2013683 (1992)","journal-title":"Naval Res. Logist. (NRL)"},{"issue":"1","key":"9489_CR39","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1007\/s10589-008-9172-y","volume":"45","author":"G Nannicini","year":"2010","unstructured":"Nannicini, G., Baptiste, P., Barbier, G., Krob, D., Liberti, L.: Fast paths in large-scale dynamic road networks. Comput. Optim. Appl. 45(1), 143\u2013158 (2010)","journal-title":"Comput. Optim. Appl."},{"issue":"2","key":"9489_CR40","doi-asserted-by":"crossref","first-page":"240","DOI":"10.1002\/net.20438","volume":"59","author":"G Nannicini","year":"2012","unstructured":"Nannicini, G., Delling, D., Schultes, D., Liberti, L.: Bidirectional a* search on time-dependent road networks. Networks 59(2), 240\u2013251 (2012)","journal-title":"Networks"},{"issue":"1","key":"9489_CR41","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1016\/j.ijpe.2010.07.035","volume":"128","author":"DB Nascimento","year":"2010","unstructured":"Nascimento, D.B., de Figueiredo, J.N., Mayerle, S., Nascimento, P., Casali, R.: A state-space solution search method for apparel industry spreading and cutting. Int. J. Prod. Econ. 128(1), 379\u2013392 (2010)","journal-title":"Int. J. Prod. Econ."},{"key":"9489_CR42","unstructured":"Nilsson, N.J.: Problem-solving methods in. Artificial Intelligence, (1971)"},{"issue":"1","key":"9489_CR43","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1111\/j.1467-9574.2007.00348.x","volume":"61","author":"W Pijls","year":"2007","unstructured":"Pijls, W.: Heuristic estimates in shortest path algorithms. Stat. Neerl. 61(1), 61\u201374 (2007)","journal-title":"Stat. Neerl."},{"key":"9489_CR44","unstructured":"Pohl, I.: Bi-directional search, machine intelligence 6. (1971)"},{"issue":"4","key":"9489_CR45","doi-asserted-by":"crossref","first-page":"455","DOI":"10.1287\/trsc.1100.0328","volume":"44","author":"E Prescott-Gagnon","year":"2010","unstructured":"Prescott-Gagnon, E., Desaulniers, G., Drexl, M., Rousseau, L.-M.: European driver rules in vehicle routing with time windows. Transp. Sci. 44(4), 455\u2013473 (2010)","journal-title":"Transp. Sci."},{"issue":"1","key":"9489_CR46","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1287\/trsc.1120.0417","volume":"47","author":"M-E Rancourt","year":"2013","unstructured":"Rancourt, M.-E., Cordeau, J.-F., Laporte, G.: Long-haul vehicle routing and scheduling with working hour rules. Transp. Sci. 47(1), 81\u2013107 (2013)","journal-title":"Transp. Sci."},{"issue":"4","key":"9489_CR47","doi-asserted-by":"crossref","first-page":"474","DOI":"10.1287\/opre.46.4.474","volume":"46","author":"M Savelsbergh","year":"1998","unstructured":"Savelsbergh, M., Sol, M.: Drive: dynamic routing of independent vehicles. Oper. Res. 46(4), 474\u2013490 (1998)","journal-title":"Oper. Res."},{"issue":"2","key":"9489_CR48","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1287\/trsc.2018.0836","volume":"53","author":"M Schiffer","year":"2019","unstructured":"Schiffer, M., Schneider, M., Walther, G., Laporte, G.: Vehicle routing and location routing with intermediate stops: a review. Transp. Sci. 53(2), 319\u2013343 (2019)","journal-title":"Transp. Sci."},{"issue":"1","key":"9489_CR49","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.ejor.2013.02.053","volume":"231","author":"T Vidal","year":"2013","unstructured":"Vidal, T., Crainic, T.G., Gendreau, M., Prins, C.: Heuristics for multi-attribute vehicle routing problems: a survey and synthesis. Eur. J. Oper. Res. 231(1), 1\u201321 (2013)","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"9489_CR50","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1016\/j.ejor.2019.10.010","volume":"286","author":"T Vidal","year":"2019","unstructured":"Vidal, T., Laporte, G., Matl, P.: A concise guide to existing and emerging vehicle routing problem variants. Eur. J. Oper. Res. 286(2), 401\u2013416 (2019)","journal-title":"Eur. J. Oper. Res."},{"key":"9489_CR51","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.trb.2021.04.002","volume":"148","author":"F Vital","year":"2021","unstructured":"Vital, F., Ioannou, P.: Scheduling and shortest path for trucks with working hours and parking availability constraints. Transp. Res. Part B Methodol. 148, 1\u201337 (2021)","journal-title":"Transp. Res. Part B Methodol."},{"issue":"11","key":"9489_CR52","doi-asserted-by":"crossref","first-page":"3037","DOI":"10.1109\/TSMC.2016.2560418","volume":"47","author":"Y Wang","year":"2016","unstructured":"Wang, Y., Li, X., Ruiz, R.: An exact algorithm for the shortest path problem with position-based learning effects. IEEE Trans. Syst. Man Cybern. Syst. 47(11), 3037\u20133049 (2016)","journal-title":"IEEE Trans. Syst. Man Cybern. Syst."},{"issue":"3","key":"9489_CR53","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1287\/trsc.37.3.347.16044","volume":"37","author":"H Xu","year":"2003","unstructured":"Xu, H., Chen, Z.-L., Rajagopal, S., Arunapuram, S.: Solving a practical pickup and delivery problem. Transp. Sci. 37(3), 347\u2013364 (2003)","journal-title":"Transp. Sci."}],"container-title":["Journal of Heuristics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-021-09489-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10732-021-09489-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-021-09489-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,2,21]],"date-time":"2022-02-21T09:04:41Z","timestamp":1645434281000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10732-021-09489-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,1,10]]},"references-count":53,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2022,2]]}},"alternative-id":["9489"],"URL":"https:\/\/doi.org\/10.1007\/s10732-021-09489-7","relation":{},"ISSN":["1381-1231","1572-9397"],"issn-type":[{"value":"1381-1231","type":"print"},{"value":"1572-9397","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,1,10]]},"assertion":[{"value":"24 February 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 September 2021","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 December 2021","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 January 2022","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}