{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,9]],"date-time":"2026-03-09T17:16:21Z","timestamp":1773076581439,"version":"3.50.1"},"reference-count":43,"publisher":"Springer Science and Business Media LLC","issue":"9","license":[{"start":{"date-parts":[[2022,1,17]],"date-time":"2022-01-17T00:00:00Z","timestamp":1642377600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,1,17]],"date-time":"2022-01-17T00:00:00Z","timestamp":1642377600000},"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":["Optim Lett"],"published-print":{"date-parts":[[2023,12]]},"DOI":"10.1007\/s11590-021-01833-x","type":"journal-article","created":{"date-parts":[[2022,1,17]],"date-time":"2022-01-17T00:04:05Z","timestamp":1642377845000},"page":"1981-2003","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":20,"title":["Combining variable neighborhood search and machine learning to solve the vehicle routing problem with crowd-shipping"],"prefix":"10.1007","volume":"17","author":[{"given":"Luigi Di Puglia","family":"Pugliese","sequence":"first","affiliation":[]},{"given":"Daniele","family":"Ferone","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2243-6054","authenticated-orcid":false,"given":"Paola","family":"Festa","sequence":"additional","affiliation":[]},{"given":"Francesca","family":"Guerriero","sequence":"additional","affiliation":[]},{"given":"Giusy","family":"Macrina","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,1,17]]},"reference":[{"key":"1833_CR1","doi-asserted-by":"publisher","first-page":"984","DOI":"10.1016\/j.jclepro.2019.06.156","volume":"234","author":"YA Al Hla","year":"2019","unstructured":"Al Hla, Y.A., Othman, M., Saleh, Y.: Optimising an eco-friendly vehicle routing problem model using regular and occasional drivers integrated with driver behaviour control. J. Clean. Prod. 234, 984\u20131001 (2019)","journal-title":"J. Clean. Prod."},{"key":"1833_CR2","doi-asserted-by":"publisher","first-page":"105272","DOI":"10.1016\/j.cor.2021.105272","volume":"131","author":"M Alicastro","year":"2021","unstructured":"Alicastro, M., Ferone, D., Festa, P., Fugaro, S., Pastore, T.: A reinforcement learning iterated local search for makespan minimization in additive manufacturing machine scheduling problems. Comput. Oper. Res. 131, 105272 (2021). https:\/\/doi.org\/10.1016\/j.cor.2021.105272","journal-title":"Comput. Oper. Res."},{"key":"1833_CR3","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1016\/j.tre.2019.06.002","volume":"128","author":"M Allahviranloo","year":"2019","unstructured":"Allahviranloo, M., Baghestani, A.: A dynamic crowdshipping model and daily travel behavior. Transport. Res. Part E: Logist. Transport. Rev. 128, 175\u2013190 (2019)","journal-title":"Transport. Res. Part E: Logist. Transport. Rev."},{"key":"1833_CR4","doi-asserted-by":"publisher","first-page":"102139","DOI":"10.1016\/j.omega.2019.102139","volume":"98","author":"A Alnaggar","year":"2019","unstructured":"Alnaggar, A., Gzara, F., Bookbinder, J.H.: Crowdsourced delivery: a review of platforms and academic literature. Omega 98, 102139 (2019). https:\/\/doi.org\/10.1016\/j.omega.2019.102139","journal-title":"Omega"},{"key":"1833_CR5","doi-asserted-by":"publisher","first-page":"105144","DOI":"10.1016\/j.cor.2020.105144","volume":"127","author":"C Archetti","year":"2020","unstructured":"Archetti, C., Guerriero, F., Macrina, G.: The online vehicle routing problem with occasional drivers. Comput. Oper. Res. 127, 105144 (2020)","journal-title":"Comput. Oper. Res."},{"key":"1833_CR6","doi-asserted-by":"publisher","first-page":"472","DOI":"10.1016\/j.ejor.2016.03.049","volume":"254","author":"C Archetti","year":"2016","unstructured":"Archetti, C., Savelsbergh, M., Speranza, M.G.: The vehicle routing problem with occasional drivers. Eur. J. Oper. Res. 254, 472\u2013480 (2016). https:\/\/doi.org\/10.1016\/j.ejor.2016.03.049","journal-title":"Eur. J. Oper. Res."},{"key":"1833_CR7","doi-asserted-by":"publisher","first-page":"208","DOI":"10.3390\/a11120208","volume":"11","author":"Q Arnau","year":"2018","unstructured":"Arnau, Q., Juan, A., Serra, I.: On the use of learnheuristics in vehicle routing optimization problems with dynamic inputs. Algorithms 11, 208 (2018). https:\/\/doi.org\/10.3390\/a11120208","journal-title":"Algorithms"},{"key":"1833_CR8","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1287\/trsc.2017.0803","volume":"53","author":"AM Arslan","year":"2019","unstructured":"Arslan, A.M., Agatz, N., Kroon, L., Zuidwijk, R.: Crowdsourced delivery\u2014a dynamic pickup and delivery problem with ad hoc drivers. Transport. Sci. 53, 222\u2013235 (2019). https:\/\/doi.org\/10.1287\/trsc.2017.0803","journal-title":"Transport. Sci."},{"key":"1833_CR9","unstructured":"Barr, A., Wohl, J.: Exclusive: Wal-Mart may get customers to deliver packages to online buyers. REUTERS -. Business. (2013)"},{"key":"1833_CR10","unstructured":"Bensinger, G.: Amazon\u2019s next delivery drone: You. , Wall Street Journal (2015)"},{"key":"1833_CR11","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1515\/math-2017-0029","volume":"15","author":"L Calvet","year":"2017","unstructured":"Calvet, L., Armas, J.D., Masip, D., Juan, A.A.: Learnheuristics: hybridizing metaheuristics with machine learning for optimization with dynamic inputs. Open Math. 15, 261\u2013280 (2017). https:\/\/doi.org\/10.1515\/math-2017-0029","journal-title":"Open Math."},{"key":"1833_CR12","doi-asserted-by":"publisher","DOI":"10.1051\/ro\/2019080","author":"B Chen","year":"2019","unstructured":"Chen, B., Qu, R., Bai, R., Laesanklang, W.: A variable neighborhood search algorithm with reinforcement learning for a real-life periodic vehicle routing problem with time windows and open routes. RAIRO\u2013Oper. Res. (2019a). https:\/\/doi.org\/10.1051\/ro\/2019080","journal-title":"RAIRO\u2013Oper. Res."},{"key":"1833_CR13","unstructured":"Chen, X., Ulmer, M.W., Thomas, B.W.: Deep Q-learning for same-day delivery with a heterogeneous fleet of vehicles and drones. (2019b) arXiv:1910.11901"},{"key":"1833_CR14","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/978-3-319-68496-3_4","volume-title":"Computational Logistics","author":"L Dahle","year":"2017","unstructured":"Dahle, L., Andersson, H., Christiansen, M.: The vehicle routing problem with dynamic occasional drivers. In: Bekta\u015f, T., Coniglio, S., Martinez-Sykora, A., Vo\u00df, S. (eds.) Computational Logistics, pp. 49\u201363. Springer International Publishing, Cham (2017)"},{"key":"1833_CR15","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1016\/j.cor.2019.04.023","volume":"109","author":"L Dahle","year":"2019","unstructured":"Dahle, L., Andersson, H., Christiansen, M., Speranza, M.G.: The pickup and delivery problem with time windows and occasional drivers. Comput. Oper. Res. 109, 122\u2013133 (2019). https:\/\/doi.org\/10.1016\/j.cor.2019.04.023","journal-title":"Comput. Oper. Res."},{"key":"1833_CR16","unstructured":"Dayarian, I., Savelsbergh, M.: Crowdshipping and same-day delivery: employing in-store customers to deliver online orders. Optimiz. Online 2011, 07\u20136142. https:\/\/pdfs.semanticscholar.org\/cf5d\/9c4c79ce5470e20ce6872403c2929c1bd446.pdf (2017)"},{"key":"1833_CR17","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.swevo.2011.02.002","volume":"1","author":"J Derrac","year":"2011","unstructured":"Derrac, J., Garc\u00eda, S., Molina, D., Herrera, F.: A practical tutorial on the use of nonparametric statistical tests as a methodology for comparing evolutionary and swarm intelligence algorithms. Swarm Evol. Comput. 1, 3\u201318 (2011). https:\/\/doi.org\/10.1016\/j.swevo.2011.02.002","journal-title":"Swarm Evol. Comput."},{"key":"1833_CR18","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1109\/3477.484436","volume":"26","author":"M Dorigo","year":"1996","unstructured":"Dorigo, M., Maniezzo, V., Colorni, A.: Ant system: optimization by a colony of cooperating agents. IEEE Trans. Syst. Man Cybern. Part B (Cybernetics) 26, 29\u201341 (1996). https:\/\/doi.org\/10.1109\/3477.484436","journal-title":"IEEE Trans. Syst. Man Cybern. Part B (Cybernetics)"},{"key":"1833_CR19","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1016\/j.trpro.2018.09.011","volume":"30","author":"K Gdowska","year":"2018","unstructured":"Gdowska, K., Viana, A., Pedroso, J.P.: Stochastic last-mile delivery with crowdshipping. Transport. Res. Procedia 30, 90\u2013100 (2018). https:\/\/doi.org\/10.1016\/j.trpro.2018.09.011","journal-title":"Transport. Res. Procedia"},{"key":"1833_CR20","doi-asserted-by":"crossref","unstructured":"Hansen, P., Mladenovi\u0107, N., Brimberg, J., P\u00e9rez, J. A.: Variable neighborhood search. In: Handbook of Metaheuristics, pp. 57\u201397. Springer International Publishing, Cham (2019)","DOI":"10.1007\/978-3-319-91086-4_3"},{"key":"1833_CR21","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1007\/s13675-016-0075-x","volume":"5","author":"P Hansen","year":"2017","unstructured":"Hansen, P., Mladenovi\u0107, N., Todosijevi\u0107, R., Hanafi, S.: Variable neighborhood search: basics and variants. EURO J. Comput. Optim. 5, 423\u2013454 (2017). https:\/\/doi.org\/10.1007\/s13675-016-0075-x","journal-title":"EURO J. Comput. Optim."},{"key":"1833_CR22","doi-asserted-by":"publisher","first-page":"220","DOI":"10.1016\/j.ejor.2004.01.027","volume":"162","author":"J Homberger","year":"2015","unstructured":"Homberger, J., Gehring, H.: A two-phase hybrid metaheuristic for the vehicle routing problem with time windows. Eur. J. Oper. Res. 162, 220\u2013238 (2015)","journal-title":"Eur. J. Oper. Res."},{"key":"1833_CR23","unstructured":"Kool, W., van Hoof, H., Welling, M.: Attention, learn to solve routing problems. In: 7th International Conference on Learning Representations, ICLR 2019 (2018) arXiv:1803.08475"},{"key":"1833_CR24","volume-title":"Thinking Creatively in the Digital Age","author":"R Landa","year":"2015","unstructured":"Landa, R.: Thinking Creatively in the Digital Age, 1st edn. Nimble, Blue Ash, Ohio (2015)","edition":"1"},{"key":"1833_CR25","doi-asserted-by":"publisher","unstructured":"L\u00f3pez-Ib\u00e1\u00f1ez, Dubois-Lacoste., J., C\u00e1ceres, L.P., Birattari, M., St\u00fctzle, T.: The irace package: Iterated racing for automatic algorithm configuration. Oper. Res. Persp.3, 43\u201358 (2016). https:\/\/doi.org\/10.1016\/j.orp.2016.09.002","DOI":"10.1016\/j.orp.2016.09.002"},{"key":"1833_CR26","unstructured":"Macrina, G.: Green logistics and crowd-shipping: challenges and opportunities. University of Calabria (2018). Ph.D. thesis"},{"key":"1833_CR27","doi-asserted-by":"publisher","first-page":"483","DOI":"10.1016\/j.promfg.2020.02.048","volume":"42","author":"G Macrina","year":"2020","unstructured":"Macrina, G., Di Puglia Pugliese, L., Guerriero, F.: Crowd-shipping: a new efficient and eco-friendly delivery strategy. Procedia Manufac. 42, 483\u2013487 (2020a)","journal-title":"Procedia Manufac."},{"key":"1833_CR28","doi-asserted-by":"publisher","unstructured":"Macrina, G., Pugliese, L.D.P., Guerriero, F.: A variable neighborhood search for the vehicle routing problem with occasional drivers and time windows. In: Proceedings of the 9th International Conference on Operations Research and Enterprise Systems - Volume 1: ICORES, organizationINSTICC. SciTePress. pp. 270\u2013277. (2020b) https:\/\/doi.org\/10.5220\/0009193302700277","DOI":"10.5220\/0009193302700277"},{"key":"1833_CR29","doi-asserted-by":"publisher","first-page":"577","DOI":"10.1007\/978-3-319-67308-0_58","volume-title":"Optimization and Decision Science: Methodologies and Appliations, ODS, Sorrento, Italy","author":"G Macrina","year":"2017","unstructured":"Macrina, G., Di Puglia Pugliese, L., Guerriero, F., Lagan\u00e0, D.: The vehicle routing problem with occasional drivers and time windows. In: Sforza, A., Sterle, C. (eds.) Optimization and Decision Science: Methodologies and Appliations, ODS, Sorrento, Italy, pp. 577\u2013587. Switzerland, Springer, Cham (2017)"},{"key":"1833_CR30","doi-asserted-by":"publisher","first-page":"104086","DOI":"10.1016\/J.COR.2019.104806","volume":"113","author":"G Macrina","year":"2020","unstructured":"Macrina, G., Di Puglia Pugliese, L., Guerriero, F., Laporte, G.: Crowd-shipping with time windows and transshipment nodes. Comput. Oper. Res. 113, 104086 (2020c). https:\/\/doi.org\/10.1016\/J.COR.2019.104806","journal-title":"Comput. Oper. Res."},{"key":"1833_CR31","volume-title":"New Trends in Emerging Complex Real Life Problems","author":"G Macrina","year":"2018","unstructured":"Macrina, G., Guerriero, F.: The green vehicle routing problem with occasional drivers. In: Daniele, P., Scrimali, L. (eds.) New Trends in Emerging Complex Real Life Problems. Springer, New York LLC (2018)"},{"key":"1833_CR32","doi-asserted-by":"publisher","first-page":"1097","DOI":"10.1016\/S0305-0548(97)00031-2","volume":"24","author":"M Mladenovi\u0107","year":"1997","unstructured":"Mladenovi\u0107, M., Hansen, P.: Variable neighborhood search. Comput. Oper. Res. 24, 1097\u20131100 (1997)","journal-title":"Comput. Oper. Res."},{"key":"1833_CR33","unstructured":"Nazari, M., Oroojlooy, A., Snyder, L., Tak\u00e1c, M.: Reinforcement learning for solving the vehicle routing problem. Advances in Neural Information Processing Systems , pp. 9839\u20139849 (2018)"},{"key":"1833_CR34","doi-asserted-by":"publisher","first-page":"4939","DOI":"10.1016\/j.eswa.2014.01.040","volume":"41","author":"JP Queiroz Dos Santos","year":"2014","unstructured":"Queiroz Dos Santos, J.P., De Melo, J.D., Duarte Neto, A.D., Aloise, D.: Reactive search strategies using reinforcement learning, local search algorithms and Variable Neighborhood Search. Expert Syst. Appl. 41, 4939\u20134949 (2014). https:\/\/doi.org\/10.1016\/j.eswa.2014.01.040","journal-title":"Expert Syst. Appl."},{"key":"1833_CR35","doi-asserted-by":"publisher","first-page":"1515","DOI":"10.1111\/itor.12507","volume":"25","author":"A Reyes","year":"2018","unstructured":"Reyes, A., Ribeiro, C.C.: Extending time-to-target plots to multiple instances. Int. Trans. Oper. Res. 25, 1515\u20131536 (2018). https:\/\/doi.org\/10.1111\/itor.12507","journal-title":"Int. Trans. Oper. Res."},{"key":"1833_CR36","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1016\/j.trpro.2018.09.012","volume":"30","author":"S Serafini","year":"2018","unstructured":"Serafini, S., Nigro, M., Gatta, V., Marcucci, E.: Sustainable crowdshipping using public transport: a case study evaluation in Rome. Transport. Res. Procedia 30, 101\u2013110 (2018). https:\/\/doi.org\/10.1016\/j.trpro.2018.09.012","journal-title":"Transport. Res. Procedia"},{"key":"1833_CR37","unstructured":"Slabinac, M.: Innovative solutions for a \u201clast-mile\u201d delivery\u2014a european experience, In: 15th international scientific conference \u201cBusiness Logistics in Modern Management\u201d, Croatia. p. 111\u2013129 (2015)"},{"key":"1833_CR38","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, 254\u2013265 (1987). https:\/\/doi.org\/10.1287\/opre.35.2.254","journal-title":"Oper. Res."},{"key":"1833_CR39","volume-title":"Reinforcement Learning: An Introduction","author":"RS Sutton","year":"2018","unstructured":"Sutton, R.S., Barto, A.G.: Reinforcement Learning: An Introduction. The MIT Press, Cambridge (2018)"},{"key":"1833_CR40","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1016\/j.eswa.2016.08.060","volume":"65","author":"JF Sze","year":"2016","unstructured":"Sze, J.F., Salhi, S., Wassan, N.: A hybridisation of adaptive variable neighbourhood search and large neighbourhood search: application to the vehicle routing problem. Expert Syst. Appl. 65, 383\u2013397 (2016). https:\/\/doi.org\/10.1016\/j.eswa.2016.08.060","journal-title":"Expert Syst. Appl."},{"key":"1833_CR41","doi-asserted-by":"publisher","first-page":"344","DOI":"10.1016\/j.dam.2018.03.019","volume":"261","author":"S Thevenin","year":"2019","unstructured":"Thevenin, S., Zufferey, N.: Learning Variable Neighborhood Search for a scheduling problem with time windows and rejections. Discr. Appl. Math. 261, 344\u2013353 (2019). https:\/\/doi.org\/10.1016\/j.dam.2018.03.019","journal-title":"Discr. Appl. Math."},{"key":"1833_CR42","doi-asserted-by":"crossref","unstructured":"Vera, J.M., Abad, A.G.: Deep reinforcement learning for routing a heterogeneous fleet of vehicles. (2019) arXiv:1912.03341","DOI":"10.1109\/LA-CCI47412.2019.9037042"},{"key":"1833_CR43","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/bf00992698","volume":"8","author":"CJCH Watkins","year":"1992","unstructured":"Watkins, C.J.C.H., Dayan, P.: Q-learning. Mach. Learn. 8, 279\u2013292 (1992). https:\/\/doi.org\/10.1007\/bf00992698","journal-title":"Mach. Learn."}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-021-01833-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11590-021-01833-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-021-01833-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,30]],"date-time":"2023-10-30T11:04:07Z","timestamp":1698663847000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11590-021-01833-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,1,17]]},"references-count":43,"journal-issue":{"issue":"9","published-print":{"date-parts":[[2023,12]]}},"alternative-id":["1833"],"URL":"https:\/\/doi.org\/10.1007\/s11590-021-01833-x","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,1,17]]},"assertion":[{"value":"21 April 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 November 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 January 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}