{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,2]],"date-time":"2026-03-02T23:44:06Z","timestamp":1772495046881,"version":"3.50.1"},"reference-count":49,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2022,5,3]],"date-time":"2022-05-03T00:00:00Z","timestamp":1651536000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,5,3]],"date-time":"2022-05-03T00:00:00Z","timestamp":1651536000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001807","name":"FAPESP","doi-asserted-by":"crossref","award":["2016\/01860-1"],"award-info":[{"award-number":["2016\/01860-1"]}],"id":[{"id":"10.13039\/501100001807","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001807","name":"FAPESP","doi-asserted-by":"crossref","award":["2013\/07375-3"],"award-info":[{"award-number":["2013\/07375-3"]}],"id":[{"id":"10.13039\/501100001807","id-type":"DOI","asserted-by":"crossref"}]},{"name":"CNPQ","award":["306083\/2016-7"],"award-info":[{"award-number":["306083\/2016-7"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2025,7]]},"DOI":"10.1007\/s10479-022-04701-8","type":"journal-article","created":{"date-parts":[[2022,5,3]],"date-time":"2022-05-03T10:05:32Z","timestamp":1651572332000},"page":"37-62","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["GRASP and VNS approaches for a vehicle routing problem with step cost functions"],"prefix":"10.1007","volume":"350","author":[{"given":"D\u00e9bora P.","family":"Ronconi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6946-6149","authenticated-orcid":false,"given":"Jo\u00e3o L. V.","family":"Manguino","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,5,3]]},"reference":[{"key":"4701_CR1","doi-asserted-by":"crossref","unstructured":"Anoki\u0107, A., & Staki\u0107, S. Z. D., & Davidovi\u0107, T. (2021). Metaheuristic approaches to a vehicle scheduling problem in sugar beet transportation. Operational Research, 21, 2021\u20132053.","DOI":"10.1007\/s12351-019-00495-z"},{"key":"4701_CR2","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1016\/j.cor.2018.02.007","volume":"106","author":"F Arnold","year":"2019","unstructured":"Arnold, F., & S\u00f6rensen, K. (2019). What makes a VRP solution good? The generation of problem-specific knowledge for heuristics. Computers and Operations Research, 106, 280\u2013288.","journal-title":"Computers and Operations Research"},{"issue":"7","key":"4701_CR3","doi-asserted-by":"publisher","first-page":"700","DOI":"10.1057\/palgrave.jors.2600521","volume":"49","author":"J Atkinson","year":"1998","unstructured":"Atkinson, J. (1998). A greedy randomised search heuristic for time-constrained vehicle scheduling and the incorporation of a learning strategy. Journal of the Operational Research Society, 49(7), 700\u2013708.","journal-title":"Journal of the Operational Research Society"},{"issue":"1","key":"4701_CR4","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1111\/j.1540-5915.1983.tb00172.x","volume":"14","author":"MO Ball","year":"1983","unstructured":"Ball, M. O., Golden, B., Assad, A., & Bodin, L. (1983). Planning for truck fleet size in the presence of a common-carrier option. Decision Sciences, 14(1), 103\u2013120.","journal-title":"Decision Sciences"},{"key":"4701_CR5","unstructured":"D\u00e1. Beltrn, J., Calder\u00f3n, J.\u00a0E. , Cabrera, R.\u00a0J. , & P\u00e9rez, J.\u00a0A. (2004) GRASP-VNS hybrid for the strip packing problems. In Hybrid Metaheuristics - HM 2004, Valencia, Spain (pp. 79\u201390)."},{"key":"4701_CR6","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1016\/j.cie.2015.12.007","volume":"99","author":"K Braekers","year":"2016","unstructured":"Braekers, K., Ramaekers, K., & Van Nieuwenhuyse, I. (2016). The vehicle routing problem: State of the art classification and review. Computers and Industrial Engineering, 99, 300\u2013313.","journal-title":"Computers and Industrial Engineering"},{"issue":"1","key":"4701_CR7","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1287\/trsc.1030.0057","volume":"39","author":"O Br\u00e4ysy","year":"2005","unstructured":"Br\u00e4ysy, O., & Gendreau, M. (2005). Vehicle routing problem with time windows, Part II: Metaheuristics. Transportation Science, 39(1), 119\u2013139.","journal-title":"Transportation Science"},{"key":"4701_CR8","doi-asserted-by":"crossref","unstructured":"Brito, J., Mart\u00ednez, F.\u00a0J. , Moreno, J.\u00a0A. , & Verdegay, J.\u00a0L. (2009). A GRASP\u2013VNS hybrid for the fuzzy vehicle routing problem with time windows. In Moreno-D\u00edaz, R., Pichler, F., & Quesada-Arencibia, A. (eds.). Computer Aided Systems Theory\u2014EUROCAST 2009, Berlin, Heidelberg (pp. 825\u2013832).","DOI":"10.1007\/978-3-642-04772-5_106"},{"key":"4701_CR9","doi-asserted-by":"crossref","unstructured":"Carreto, C., & Baker, B. (2002). A GRASP interactive approach to the vehicle routing problem with backhauls. In Ribeiro, C. (eds.). Essays and Surveys in Metaheuristics (pp. 185\u2013199). Springer.","DOI":"10.1007\/978-1-4615-1507-4_9"},{"issue":"1","key":"4701_CR10","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1287\/mnsc.6.1.80","volume":"6","author":"GB Dantzig","year":"1959","unstructured":"Dantzig, G. B., & Ramser, J. H. (1959). The truck dispatching problem. Management Science, 6(1), 80\u201391.","journal-title":"Management Science"},{"key":"4701_CR11","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1016\/j.engappai.2015.07.013","volume":"45","author":"J de Armas","year":"2015","unstructured":"de Armas, J., Lalla-Ruiz, E., Exp\u00f3sito-Izquierdo, C., Landa-Silva, D., & Meli\u00e1n-Batista, B. (2015). A hybrid GRASP-VNS for ship routing and scheduling problem with discretized time windows. Engineering Applications of Artificial Intelligence, 45, 50\u2013360.","journal-title":"Engineering Applications of Artificial Intelligence"},{"issue":"2","key":"4701_CR12","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/0167-6377(89)90002-3","volume":"8","author":"TA Feo","year":"1989","unstructured":"Feo, T. A., & Resende, M. G. C. (1989). A probabilistic heuristic for a computationally difficult set covering problem. Operations Research Letters, 8(2), 67\u201371.","journal-title":"Operations Research Letters"},{"issue":"2","key":"4701_CR13","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/BF01096763","volume":"6","author":"TA Feo","year":"1995","unstructured":"Feo, T. A., & Resende, M. G. C. (1995). Greedy randomized adaptive search procedures. Journal of Global Optimization, 6(2), 109\u2013133.","journal-title":"Journal of Global Optimization"},{"key":"4701_CR14","doi-asserted-by":"crossref","unstructured":"Festa, P., & Resende, M. G. C. (2009a). An annotated bibliography of GRASP\u2014Part I: Algorithms. International Transactions in Operational Research, 16(1), 1\u201324.","DOI":"10.1111\/j.1475-3995.2009.00663.x"},{"key":"4701_CR15","doi-asserted-by":"crossref","unstructured":"Festa, P., & Resende, M.\u00a0G.\u00a0C. (2009b). Hybrid GRASP heuristics. In Foundations of Computational Intelligence (Vol. 3, pp. 75\u2013100). Springer.","DOI":"10.1007\/978-3-642-01085-9_4"},{"issue":"2","key":"4701_CR16","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1111\/j.1475-3995.2009.00664.x","volume":"16","author":"P Festa","year":"2009","unstructured":"Festa, P., & Resende, M. G. C. (2009). An annotated bibliography of GRASP-Part II: Applications. International Transactions in Operational Research, 16(2), 131\u2013172.","journal-title":"International Transactions in Operational Research"},{"key":"4701_CR17","doi-asserted-by":"publisher","first-page":"192","DOI":"10.1016\/j.tre.2016.10.010","volume":"97","author":"C Gahm","year":"2017","unstructured":"Gahm, C., Brab\u00e4nder, C., & Tuma, A. (2017). Vehicle routing with private fleet, multiple common carriers offering volume discounts, and rental options. Transportation Research Part E: Logistics and Transportation Review, 97, 192\u2013216.","journal-title":"Transportation Research Part E: Logistics and Transportation Review"},{"issue":"1","key":"4701_CR18","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1016\/0305-0548(84)90007-8","volume":"11","author":"B Golden","year":"1984","unstructured":"Golden, B., Assad, A., Levy, L., & Gheysens, F. (1984). The fleet size and mix vehicle routing problem. Computers and Operations Research, 11(1), 49\u201366.","journal-title":"Computers and Operations Research"},{"issue":"1","key":"4701_CR19","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1007\/s10479-009-0657-6","volume":"175","author":"P Hansen","year":"2010","unstructured":"Hansen, P., Mladenovi\u0107, N., & Moreno P\u00e9rez, J. A. (2010). Variable neighbourhood search: Methods and applications. Annals of Operations Research, 175(1), 367\u2013407.","journal-title":"Annals of Operations Research"},{"key":"4701_CR20","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/978-3-319-91086-4_3","volume-title":"Handbook of metaheuristics","author":"P Hansen","year":"2019","unstructured":"Hansen, P., Mladenovi\u0107, N., Brimberg, J., & Moreno P\u00e9rez, J. A. (2019). Variable neighbourhood search. In M. Gendreau & J. Potvin (Eds.), Handbook of metaheuristics (pp. 57\u201397). Berlin: Springer."},{"issue":"3","key":"4701_CR21","doi-asserted-by":"publisher","first-page":"791","DOI":"10.1016\/j.ejor.2007.08.048","volume":"195","author":"VC Hemmelmayr","year":"2009","unstructured":"Hemmelmayr, V. C., Doerner, K. F., & Hartl, R. F. (2009). A variable neighborhood search heuristic for periodic routing problems. European Journal of Operational Research, 195(3), 791\u2013802.","journal-title":"European Journal of Operational Research"},{"key":"4701_CR22","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1016\/j.eswa.2015.12.015","volume":"51","author":"S Ho","year":"2016","unstructured":"Ho, S., & Szeto, W. (2016). GRASP with path relinking for the selective pickup and delivery problem. Expert Systems with Applications, 51, 14\u201325.","journal-title":"Expert Systems with Applications"},{"issue":"12","key":"4701_CR23","doi-asserted-by":"publisher","first-page":"2041","DOI":"10.1016\/j.cor.2010.03.015","volume":"37","author":"A Hoff","year":"2010","unstructured":"Hoff, A., Andersson, H., Christiansen, M., Hasle, G., & L\u00f8kketangen, A. (2010). Industrial aspects and literature survey: Fleet composition and routing. Computers and Operations Research, 37(12), 2041\u20132061.","journal-title":"Computers and Operations Research"},{"issue":"2","key":"4701_CR24","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1016\/j.ejor.2008.07.022","volume":"197","author":"A Imran","year":"2009","unstructured":"Imran, A., Salhi, S., & Wassan, N. A. (2009). A variable neighborhood-based heuristic for the heterogeneous fleet vehicle routing problem. European Journal of Operational Research, 197(2), 509\u2013518.","journal-title":"European Journal of Operational Research"},{"key":"4701_CR25","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1016\/j.cor.2015.05.004","volume":"64","author":"\u00c7 Ko\u00e7","year":"2015","unstructured":"Ko\u00e7, \u00c7., Bekta\u015f, T., Jabali, O., & Laporte, G. (2015). A hybrid evolutionary algorithm for heterogeneous fleet vehicle routing problems with time windows. Computers and Operations Research, 64, 11\u201327.","journal-title":"Computers and Operations Research"},{"issue":"1","key":"4701_CR26","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1287\/ijoc.7.1.10","volume":"7","author":"G Kontoravdis","year":"1995","unstructured":"Kontoravdis, G., & Bard, J. F. (1995). A GRASP for the vehicle routing problem with time windows. ORSA Journal on Computing, 7(1), 10\u201323.","journal-title":"ORSA Journal on Computing"},{"issue":"9","key":"4701_CR27","doi-asserted-by":"publisher","first-page":"2743","DOI":"10.1016\/j.cor.2005.10.010","volume":"34","author":"J Kyt\u00f6joki","year":"2007","unstructured":"Kyt\u00f6joki, J., Nuortio, T., Br\u00e4ysy, O., & Gendreau, M. (2007). An efficient variable neighborhood search heuristic for very large scale vehicle routing problems. Computers and Operations Research, 34(9), 2743\u20132757.","journal-title":"Computers and Operations Research"},{"issue":"4","key":"4701_CR28","doi-asserted-by":"publisher","first-page":"408","DOI":"10.1287\/trsc.1090.0301","volume":"43","author":"G Laporte","year":"2009","unstructured":"Laporte, G. (2009). Fifty years of vehicle routing. Transportation Science, 43(4), 408\u2013416.","journal-title":"Transportation Science"},{"issue":"1","key":"4701_CR29","doi-asserted-by":"publisher","first-page":"104","DOI":"10.5325\/transportationj.54.1.0104","volume":"54","author":"RC Lieb","year":"2015","unstructured":"Lieb, R. C., & Lieb, K. J. (2015). The North American third-party logistics industry in 2013: The provider CEO perspective. Transportation Journal, 54(1), 104\u2013121.","journal-title":"Transportation Journal"},{"issue":"7","key":"4701_CR30","doi-asserted-by":"publisher","first-page":"721","DOI":"10.1057\/palgrave.jors.2600763","volume":"50","author":"F-H Liu","year":"1999","unstructured":"Liu, F.-H., & Shen, S.-Y. (1999). The fleet size and mix vehicle routing problem with time windows. Journal of the Operational Research Society, 50(7), 721\u2013732.","journal-title":"Journal of the Operational Research Society"},{"key":"4701_CR31","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/s13748-017-0129-1","volume":"7","author":"I L\u00f3pez-Plata","year":"2018","unstructured":"L\u00f3pez-Plata, I., Exp\u00f3sito-Izquierdo, C., Meli\u00e1n-Batista, B., & Moreno-Vega, J. M. (2018). Management of internal delivery vehicles in maritime container terminals. Progress in Artificial Intelligence, 7, 65\u201380.","journal-title":"Progress in Artificial Intelligence"},{"issue":"6","key":"4701_CR32","doi-asserted-by":"publisher","first-page":"649","DOI":"10.1007\/s10951-019-00619-5","volume":"23","author":"S Lu","year":"2020","unstructured":"Lu, S., Pei, J., Liu, X., Qian, X., Mladenovi\u0107, N., & Pardalos, P. (2020). Less is more: Variable neighborhood search for integrated production and assembly in smart manufacturing. Journal of Scheduling, 23(6), 649\u2013664.","journal-title":"Journal of Scheduling"},{"key":"4701_CR33","doi-asserted-by":"crossref","unstructured":"Manguino, J.\u00a0L. (2020). Heuristic methods applied to the mixed fleet vehicle routing problem with time windows and step costs per distance range. PhD Thesis, Escola Polit\u00e9cnica, Universidade de S\u00e3o Paulo, S\u00e3o Paulo. https:\/\/doi.org\/10.11606\/T.3.2020.tde-04092020-090739.","DOI":"10.11606\/T.3.2020.tde-04092020-090739"},{"key":"4701_CR34","doi-asserted-by":"publisher","DOI":"10.1007\/s10479-020-03915-y","author":"JL Manguino","year":"2021","unstructured":"Manguino, J. L., & Ronconi, D. P. (2021). Step cost functions in a fleet size and mix vehicle routing problem with time windows. Annals of Operations Research. https:\/\/doi.org\/10.1007\/s10479-020-03915-y.","journal-title":"Annals of Operations Research"},{"key":"4701_CR35","doi-asserted-by":"crossref","unstructured":"Manguino, J. L. V., & Ronconi, D. P. (2020). Metaheuristic approaches for the fleet size and mix vehicle routing problem with time windows and step cost functions. Lecture Notes in Computer Science. In 11th International Conference on Computational Logistics (pp. 231\u2013245). The Netherlands: Enschede.","DOI":"10.1007\/978-3-030-59747-4_15"},{"issue":"1","key":"4701_CR36","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1016\/j.ijpe.2007.05.017","volume":"113","author":"A Marasco","year":"2008","unstructured":"Marasco, A. (2008). Third-party logistics: A literature review. International Journal of Production Economics, 113(1), 127\u2013147.","journal-title":"International Journal of Production Economics"},{"key":"4701_CR37","doi-asserted-by":"publisher","first-page":"6807","DOI":"10.1016\/j.eswa.2012.01.015","volume":"39","author":"Y Marinakis","year":"2012","unstructured":"Marinakis, Y. (2012). Multiple phase neighborhood search-grasp for the capacitated vehicle routing problem. Expert Systems with Applications, 39, 6807\u20136815.","journal-title":"Expert Systems with Applications"},{"issue":"11","key":"4701_CR38","doi-asserted-by":"publisher","first-page":"1097","DOI":"10.1016\/S0305-0548(97)00031-2","volume":"24","author":"N Mladenovi\u0107","year":"1997","unstructured":"Mladenovi\u0107, N., & Hansen, P. (1997). Variable neighborhood search. Computers and Operations Research, 24(11), 1097\u20131100.","journal-title":"Computers and Operations Research"},{"issue":"1","key":"4701_CR39","doi-asserted-by":"publisher","first-page":"480","DOI":"10.1111\/itor.12646","volume":"27","author":"N Mladenovi\u0107","year":"2020","unstructured":"Mladenovi\u0107, N., Alkandari, A., Pei, J., Todosijevi\u0107, R., & Pardalos, P. M. (2020). Less is more approach: basic variable neighborhood search for the obnoxious p-median problem. International Transactions in Operational Research, 27(1), 480\u2013493.","journal-title":"International Transactions in Operational Research"},{"key":"4701_CR40","doi-asserted-by":"publisher","first-page":"408","DOI":"10.1016\/j.cor.2015.11.007","volume":"78","author":"PJ Palomo-Mart\u00ednez","year":"2017","unstructured":"Palomo-Mart\u00ednez, P. J., Salazar-Aguilar, M. A., Laporte, G., & Langevin, A. (2017). A hybrid variable neighborhood search for the orienteering problem with mandatory visits and exclusionary constraints. Computers and Operations Research, 78, 408\u2013419.","journal-title":"Computers and Operations Research"},{"issue":"5","key":"4701_CR41","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1007\/s10732-007-9045-z","volume":"14","author":"DC Paraskevopoulos","year":"2008","unstructured":"Paraskevopoulos, D. C., Repoussis, P. P., Tarantilis, C. D., Ioannou, G., & Prastacos, G. P. (2008). A reactive variable neighborhood Tabu search for the heterogeneous fleet vehicle routing problem with time windows. Journal of Heuristics, 14(5), 425\u2013455.","journal-title":"Journal of Heuristics"},{"key":"4701_CR42","unstructured":"Pitsoulis, L., & Resende, M.\u00a0G. (2002). Greedy randomized adaptive search procedures. In Handbook of Applied Optimization (pp. 168\u2013183). Oxford University Press."},{"issue":"12","key":"4701_CR43","doi-asserted-by":"publisher","first-page":"1433","DOI":"10.1057\/jors.1995.204","volume":"46","author":"J-Y Potvin","year":"1995","unstructured":"Potvin, J.-Y., & Rousseau, J.-M. (1995). An exchange heuristic for routing problems with time windows. Journal of the Operational Research Society, 46(12), 1433\u20131446.","journal-title":"Journal of the Operational Research Society"},{"key":"4701_CR44","doi-asserted-by":"crossref","unstructured":"Resende, M.\u00a0G.\u00a0C. , & Ribeiro, C.\u00a0C. (2010). Greedy randomized adaptive search procedures: Advances, hybridizations, and applications. In Handbook of metaheuristics (pp. 283\u2013319). Springer.","DOI":"10.1007\/978-1-4419-1665-5_10"},{"key":"4701_CR45","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/j.eswa.2018.07.034","volume":"114","author":"L Simeonova","year":"2018","unstructured":"Simeonova, L., Wassan, N., Salhi, S., & Nagy, G. (2018). The heterogeneous fleet vehicle routing problem with light loads and overtime: Formulation and population variable neighbourhood search with adaptive memory. Expert Systems with Applications, 114, 183\u2013195.","journal-title":"Expert Systems with Applications"},{"issue":"2","key":"4701_CR46","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. (1987). Algorithms for the vehicle routing and scheduling problems with time window constraints. Operations Research, 35(2), 254\u2013265.","journal-title":"Operations Research"},{"issue":"2","key":"4701_CR47","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1287\/trsc.31.2.170","volume":"31","author":"\u00c9 Taillard","year":"1997","unstructured":"Taillard, \u00c9., Badeau, P., Gendreau, M., Guertin, F., & Potvin, J.-Y. (1997). A Tabu search heuristic for the vehicle routing problem with soft time windows. Transportation Science, 31(2), 170\u2013186.","journal-title":"Transportation Science"},{"issue":"1","key":"4701_CR48","doi-asserted-by":"publisher","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. (2013). Heuristics for multi-attribute vehicle routing problems: A survey and synthesis. European Journal of Operational Research, 231(1), 1\u201321.","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"4701_CR49","doi-asserted-by":"publisher","first-page":"475","DOI":"10.1016\/j.cor.2012.07.018","volume":"40","author":"T Vidal","year":"2013","unstructured":"Vidal, T., Crainic, T. G., Gendreau, M., & Prins, C. (2013). A hybrid genetic algorithm with adaptive diversity management for a large class of vehicle routing problems with time-windows. Computers and Operations Research, 40(1), 475\u2013489.","journal-title":"Computers and Operations Research"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-022-04701-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10479-022-04701-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-022-04701-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,5]],"date-time":"2025-09-05T18:09:41Z","timestamp":1757095781000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10479-022-04701-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,5,3]]},"references-count":49,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2025,7]]}},"alternative-id":["4701"],"URL":"https:\/\/doi.org\/10.1007\/s10479-022-04701-8","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,5,3]]},"assertion":[{"value":"4 April 2022","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 May 2022","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}