{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,21]],"date-time":"2026-02-21T09:33:08Z","timestamp":1771666388664,"version":"3.50.1"},"reference-count":36,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2022,2,8]],"date-time":"2022-02-08T00:00:00Z","timestamp":1644278400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2022,2,8]],"date-time":"2022-02-08T00:00:00Z","timestamp":1644278400000},"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":[[2022,6]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>A business delivery model with professional vehicles as well as occasional passing-by vehicles is investigated in this paper. The drivers deliver parcels from the distribution center to customers and the passing-by driver can get a certain amount of compensation in return. To give a satisfactory solution from the perspective of platform owner, customers, professional drivers, occasional drivers, and authority, a multi-layer comprehensive model is proposed. To effectively solve the proposed model, we introduce an improved variable neighborhood search (VNS) with a memory-based restart mechanism. The new algorithm is evaluated on instances derived from Solomon\u2019s benchmark and real-life beer delivery instances. Taguchi experiment is used to tune parameters in the proposed VNS, followed by component analysis and real-life experiments. Experimental results indicate that the proposed strategies are effective and the new delivery model in this paper has some advantages over traditional and single-delivery ones from the comprehensive perspectives of stakeholders in the crowdsourcing logistics system.<\/jats:p>","DOI":"10.1007\/s40747-022-00661-5","type":"journal-article","created":{"date-parts":[[2022,2,8]],"date-time":"2022-02-08T08:03:47Z","timestamp":1644307427000},"page":"2507-2525","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":18,"title":["Memory-based variable neighborhood search for green vehicle routing problem with passing-by drivers: a comprehensive perspective"],"prefix":"10.1007","volume":"8","author":[{"given":"Lei","family":"Cao","sequence":"first","affiliation":[]},{"given":"Chun-ming","family":"Ye","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9410-8263","authenticated-orcid":false,"given":"Ran","family":"Cheng","sequence":"additional","affiliation":[]},{"given":"Zhen-kun","family":"Wang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,2,8]]},"reference":[{"issue":"01","key":"661_CR1","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1142\/S1793930521000015","volume":"13","author":"L Dong","year":"2021","unstructured":"Dong L, Miao G, Wen W (2021) China\u2019s carbon neutrality policy: objectives, impacts and paths. East Asian Policy 13(01):5\u201318","journal-title":"East Asian Policy"},{"key":"661_CR2","volume-title":"The sharing economy: the end of employment and the rise of crowd-based capitalism","author":"A Sundararajan","year":"2017","unstructured":"Sundararajan A (2017) The sharing economy: the end of employment and the rise of crowd-based capitalism. Mit Press, New York"},{"key":"661_CR3","doi-asserted-by":"publisher","first-page":"320","DOI":"10.1016\/j.jclepro.2018.12.154","volume":"213","author":"M Ritter","year":"2019","unstructured":"Ritter M, Schanz H (2019) The sharing economy: a comprehensive business model framework. J Clean Prod 213:320\u2013331","journal-title":"J Clean Prod"},{"issue":"1","key":"661_CR4","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1287\/trsc.2017.0803","volume":"53","author":"M Arslan Alp","year":"2019","unstructured":"Arslan Alp M, Niels A, Leo K, Rob Z (2019) Crowdsourced delivery-a dynamic pickup and delivery problem with ad hoc drivers. Transp Sci 53(1):222\u2013235","journal-title":"Transp Sci"},{"issue":"3","key":"661_CR5","first-page":"1","volume":"9","author":"RH Buldeo","year":"2017","unstructured":"Buldeo RH, Sara V, Jan M, Cathy M (2017) Crowd logistics: an opportunity for more sustainable urban freight transport? Eur Transp Res Rev 9(3):1\u201313","journal-title":"Eur Transp Res Rev"},{"key":"661_CR6","first-page":"1025139","volume":"98","author":"A Aliaa","year":"2021","unstructured":"Aliaa A, Fatma G, Bookbinder James H (2021) Crowdsourced delivery: a review of platforms and academic literature. Omega 98:1025139","journal-title":"Omega"},{"issue":"3","key":"661_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s12544-017-0251-y","volume":"9","author":"Y Li","year":"2017","unstructured":"Li Y, Yuewu Yu (2017) The use of freight apps in road freight transport for co2 reduction. Eur Transp Res Rev 9(3):1\u201313","journal-title":"Eur Transp Res Rev"},{"key":"661_CR8","doi-asserted-by":"crossref","unstructured":"Dablanc L, Morganti E, Arvidsson N, Woxenius J, Browne M, Saidi N (2017) The rise of on-demand \u2019instant deliveries\u2019 in European cities. In: Supply Chain Forum: An International Journal, volume\u00a018, pages 203\u2013217. Taylor & Francis","DOI":"10.1080\/16258312.2017.1375375"},{"key":"661_CR9","unstructured":"Barr A, Wohl J (2013) Exclusive: Walmart may get customers to deliver packages to online buyers. REUTERS\u2013Business Week"},{"issue":"2","key":"661_CR10","doi-asserted-by":"publisher","first-page":"472","DOI":"10.1016\/j.ejor.2016.03.049","volume":"254","author":"A Claudia","year":"2016","unstructured":"Claudia A, Martin S, Grazia SM (2016) The vehicle routing problem with occasional drivers. Eur J Oper Res 254(2):472\u2013480","journal-title":"Eur J Oper Res"},{"key":"661_CR11","doi-asserted-by":"crossref","unstructured":"Macrina G, Pugliese Luigi Di\u00a0P, Guerriero F, Lagan\u00e0 D (2017) The vehicle routing problem with occasional drivers and time windows. In: International conference on optimization and decision science, pp 577\u2013587. Springer","DOI":"10.1007\/978-3-319-67308-0_58"},{"key":"661_CR12","doi-asserted-by":"publisher","first-page":"104806","DOI":"10.1016\/j.cor.2019.104806","volume":"113","author":"G Macrina","year":"2020","unstructured":"Macrina G, Di Puglia L, Pugliese FG, Laporte G (2020) Crowd-shipping with time windows and transshipment nodes. Comput Oper Res 113:104806","journal-title":"Comput Oper Res"},{"key":"661_CR13","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 MG (2019) The pickup and delivery problem with time windows and occasional drivers. Comput Oper Res 109:122\u2013133","journal-title":"Comput Oper Res"},{"key":"661_CR14","doi-asserted-by":"crossref","unstructured":"Macrina G, Guerriero F (2018) The green vehicle routing problem with occasional drivers. In: New trends in emerging complex real life problems, pp 357\u2013366, Springer, New York","DOI":"10.1007\/978-3-030-00473-6_38"},{"key":"661_CR15","doi-asserted-by":"crossref","unstructured":"Dahle L, Andersson H, Christiansen M (2017) The vehicle routing problem with dynamic occasional drivers. In: International conference on computational logistics, pp 49\u201363, Springer, New York","DOI":"10.1007\/978-3-319-68496-3_4"},{"issue":"9","key":"661_CR16","doi-asserted-by":"publisher","first-page":"2153","DOI":"10.1111\/poms.13219","volume":"29","author":"I Dayarian","year":"2020","unstructured":"Dayarian I, Savelsbergh M (2020) Crowdshipping and same-day delivery: employing in-store customers to deliver online orders. Prod Oper Manag 29(9):2153\u20132174","journal-title":"Prod Oper Manag"},{"key":"661_CR17","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1016\/j.trpro.2018.09.011","volume":"30","author":"G Katarzyna","year":"2018","unstructured":"Katarzyna G, Ana V, Pedro PJ (2018) Stochastic last-mile delivery with crowdshipping. Transp Res Procedia 30:90\u2013100","journal-title":"Transp Res Procedia"},{"key":"661_CR18","doi-asserted-by":"crossref","unstructured":"Archetti C, Guerriero F, Macrina G (2021) The online vehicle routing problem with occasional drivers. Comput Oper Res 127:105144","DOI":"10.1016\/j.cor.2020.105144"},{"key":"661_CR19","doi-asserted-by":"crossref","unstructured":"Rai HB, Verlinde S, Macharis C (2018) Shipping outside the box. Environmental impact and stakeholder analysis of a crowd logistics platform in Belgium. J Clean Product 202:806\u2013816","DOI":"10.1016\/j.jclepro.2018.08.210"},{"issue":"1","key":"661_CR20","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1287\/trsc.1110.0396","volume":"47","author":"A Stenger","year":"2013","unstructured":"Stenger A, Vigo D, Enz S, Schwind M (2013) An adaptive variable neighborhood search algorithm for a vehicle routing problem arising in small package shipping. Transp Sci 47(1):64\u201380","journal-title":"Transp Sci"},{"key":"661_CR21","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1016\/j.eswa.2016.09.017","volume":"66","author":"B Kalayci Can","year":"2016","unstructured":"Kalayci Can B, Can K (2016) An ant colony system empowered variable neighborhood search algorithm for the vehicle routing problem with simultaneous pickup and delivery. Expert Syst Appl 66:163\u2013175","journal-title":"Expert Syst Appl"},{"issue":"5","key":"661_CR22","doi-asserted-by":"publisher","first-page":"1401","DOI":"10.1007\/s00170-013-4866-4","volume":"87","author":"X Li","year":"2016","unstructured":"Li X, Haiyan X, Li M (2016) A memory-based complete local search method with variable neighborhood structures for no-wait job shops. Int J Adv Manuf Technol 87(5):1401\u20131408","journal-title":"Int J Adv Manuf Technol"},{"key":"661_CR23","doi-asserted-by":"crossref","unstructured":"Am\u00e9lia\u00a0LSM, de\u00a0Souza S\u00e9rgio\u00a0R, Jamilson\u00a0Freitas Souza M, L\u00facia\u00a0C, Bazzan A (2019) A reinforcement learning-based multi-agent framework applied for solving routing and scheduling problems. Expert Systems with Applications, 131:148\u2013171","DOI":"10.1016\/j.eswa.2019.04.056"},{"key":"661_CR24","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 (2019) Learning variable neighborhood search for a scheduling problem with time windows and rejections. Discret Appl Math 261:344\u2013353","journal-title":"Discret Appl Math"},{"key":"661_CR25","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1016\/j.knosys.2014.02.014","volume":"62","author":"J Pacheco","year":"2014","unstructured":"Pacheco J, Garc\u00eda I, \u00c1lvarez A (2014) Enhancing variable neighborhood search by adding memory: App cation to a real logistic problem. Knowl-Based Syst 62:28\u201337","journal-title":"Knowl-Based Syst"},{"key":"661_CR26","unstructured":"Feng L, Zhou L, Gupta A, Zhong J, Zhu Z, Tan K-C, Qin K (2019) Solving generalized vehicle routing problem with occasional drivers via evolutionary multitasking. IEEE Trans Cybern"},{"key":"661_CR27","first-page":"3","volume":"11","author":"LA Zadeh","year":"1979","unstructured":"Zadeh LA (1979) Fuzzy sets and information granularity. Adv Fuzzy Set Theory Appl 11:3\u201318","journal-title":"Adv Fuzzy Set Theory Appl"},{"issue":"5\u20138","key":"661_CR28","first-page":"793","volume":"75","author":"A Mehdi","year":"2014","unstructured":"Mehdi A, Mahdavi AV, Mehdi K (2014) A mathematical model and a solving procedure for multi-depot vehicle routing problem with fuzzy time window and heterogeneous vehicle. Int J Adv Manuf Technol 75(5\u20138):793\u2013802","journal-title":"Int J Adv Manuf Technol"},{"key":"661_CR29","doi-asserted-by":"publisher","first-page":"504","DOI":"10.1016\/j.asoc.2013.08.015","volume":"14","author":"GS Farid","year":"2014","unstructured":"Farid GS, Simak N, Reza T-M, Keivan G (2014) A multi-objective dynamic vehicle routing problem with fuzzy time windows: model, solution and application. Appl Soft Comput 14:504\u2013527","journal-title":"Appl Soft Comput"},{"issue":"7","key":"661_CR30","doi-asserted-by":"publisher","first-page":"1419","DOI":"10.1016\/j.cor.2011.08.013","volume":"39","author":"Y Xiao","year":"2012","unstructured":"Xiao Y, Zhao Q, Kaku I, Yuchun X (2012) Development of a fuel consumption optimization model for the capacitated vehicle routing problem. Comput Oper Res 39(7):1419\u20131431","journal-title":"Comput Oper Res"},{"issue":"11","key":"661_CR31","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. Comput Oper Res 24(11):1097\u20131100","journal-title":"Comput Oper Res"},{"issue":"1","key":"661_CR32","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0377-2217(00)00268-X","volume":"135","author":"D Taillard \u00c9ric","year":"2001","unstructured":"Taillard \u00c9ric D, Gambardella Luca M, Michel G, Jean-Yves P (2001) Adaptive memory programming: a unified view of metaheuristics. Eur J Oper Res 135(1):1\u201316","journal-title":"Eur J Oper Res"},{"issue":"1","key":"661_CR33","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1016\/j.cor.2005.02.044","volume":"34","author":"A Olivera","year":"2007","unstructured":"Olivera A, Viera O (2007) Adaptive memory programming for the vehicle routing problem with multiple trips. Comput Oper Res 34(1):28\u201347","journal-title":"Comput Oper Res"},{"issue":"9","key":"661_CR34","doi-asserted-by":"publisher","first-page":"2309","DOI":"10.1016\/j.cor.2004.03.005","volume":"32","author":"D Tarantilis Christos","year":"2005","unstructured":"Tarantilis Christos D (2005) Solving the vehicle routing problem with adaptive memory programming methodology. Comput Oper Res 32(9):2309\u20132327","journal-title":"Comput Oper Res"},{"issue":"6","key":"661_CR35","doi-asserted-by":"publisher","first-page":"1111","DOI":"10.1016\/j.tre.2010.02.004","volume":"46","author":"L Xiangyong","year":"2010","unstructured":"Xiangyong L, Peng T, Aneja YP (2010) An adaptive memory programming metaheuristic for the heterogeneous fixed fleet vehicle routing problem. Transp Res Part E: Log Transp Rev 46(6):1111\u20131127","journal-title":"Transp Res Part E: Log Transp Rev"},{"issue":"1","key":"661_CR36","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1109\/TEVC.2013.2239648","volume":"18","author":"K Li","year":"2013","unstructured":"Li K, Fialho A, Kwong S, Zhang Q (2013) Adaptive operator selection with bandits for a multiobjective evolutionary algorithm based on decomposition. IEEE Trans Evol Comput 18(1):114\u2013130","journal-title":"IEEE Trans Evol Comput"}],"container-title":["Complex &amp; Intelligent Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40747-022-00661-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s40747-022-00661-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40747-022-00661-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,30]],"date-time":"2022-05-30T01:30:24Z","timestamp":1653874224000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s40747-022-00661-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,2,8]]},"references-count":36,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2022,6]]}},"alternative-id":["661"],"URL":"https:\/\/doi.org\/10.1007\/s40747-022-00661-5","relation":{},"ISSN":["2199-4536","2198-6053"],"issn-type":[{"value":"2199-4536","type":"print"},{"value":"2198-6053","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,2,8]]},"assertion":[{"value":"1 November 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 January 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 February 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declaration"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}