{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T09:52:38Z","timestamp":1773309158738,"version":"3.50.1"},"reference-count":71,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2025,7,21]],"date-time":"2025-07-21T00:00:00Z","timestamp":1753056000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,7,21]],"date-time":"2025-07-21T00:00:00Z","timestamp":1753056000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"the National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["Grant No.: 71971167"],"award-info":[{"award-number":["Grant No.: 71971167"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"name":"the Major Projects of National Natural Science Foundation of China","award":["Grant No.: 72192830"],"award-info":[{"award-number":["Grant No.: 72192830"]}]},{"name":"the Major Projects of National Natural Science Foundation of China","award":["72192834"],"award-info":[{"award-number":["72192834"]}]},{"DOI":"10.13039\/501100004543","name":"China Scholarship Council","doi-asserted-by":"publisher","award":["No. 202306280181"],"award-info":[{"award-number":["No. 202306280181"]}],"id":[{"id":"10.13039\/501100004543","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Oper Res Int J"],"published-print":{"date-parts":[[2025,9]]},"DOI":"10.1007\/s12351-025-00955-9","type":"journal-article","created":{"date-parts":[[2025,7,21]],"date-time":"2025-07-21T03:33:31Z","timestamp":1753068811000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Integrating incentive-driven delivery options and time-dependent routing decisions with availability profiles"],"prefix":"10.1007","volume":"25","author":[{"given":"Dong","family":"Lei","sequence":"first","affiliation":[]},{"given":"Zhen","family":"Yang","sequence":"additional","affiliation":[]},{"given":"Tao","family":"Jia","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,7,21]]},"reference":[{"key":"955_CR1","unstructured":"Accenture (2020) Holiday research 2020. Accessed April 7, 2021, https:\/\/www.accenture.com\/us-en\/insights\/retail\/holiday-research-2020"},{"key":"955_CR2","unstructured":"Accenture (2021) Can you deliver on the promise of online delivery? Accessed August 1, 2021, www.accenture.com\/us-en\/blogs\/business-functions-blog\/can-you-deliver-on-the-promise"},{"key":"955_CR3","doi-asserted-by":"publisher","DOI":"10.1016\/j.trb.2016.10.013","author":"T Adamo","year":"2024","unstructured":"Adamo T, Gendreau M, Ghiani G, Guerriero E (2024) A review of recent advances in time-dependent vehicle routing. Eur J Oper Res. https:\/\/doi.org\/10.1016\/j.trb.2016.10.013","journal-title":"Eur J Oper Res"},{"key":"955_CR4","doi-asserted-by":"publisher","unstructured":"Amorim P, DeHoratius N, Eng-Larsson F, Martins S (2024) Customer preferences for delivery service attributes in attended home delivery. Manage Sci. https:\/\/doi.org\/10.1287\/mnsc.2020.01274","DOI":"10.1287\/mnsc.2020.01274"},{"key":"955_CR5","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1016\/j.cor.2013.08.010","volume":"52","author":"S Belhaiza","year":"2014","unstructured":"Belhaiza S, Hansen P, Laporte G (2014) A hybrid variable neighborhood tabu search heuristic for the vehicle routing problem with multiple time windows. Comput Oper Res 52:269\u2013281. https:\/\/doi.org\/10.1016\/j.cor.2013.08.010","journal-title":"Comput Oper Res"},{"issue":"3","key":"955_CR6","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1287\/trsc.1050.0136","volume":"40","author":"AM Campbell","year":"2006","unstructured":"Campbell AM, Savelsbergh M (2006) Incentive schemes for attended home delivery services. Transp Sci 40(3):327\u2013341. https:\/\/doi.org\/10.1287\/trsc.1050.0136","journal-title":"Transp Sci"},{"key":"955_CR7","doi-asserted-by":"crossref","unstructured":"Cattaruzza D, Absi N, Feillet D, Gonz\u00b4alez-Feliu J (2017) Vehicle routing problems for city logistics. EURO J Transp Logist 6(1):51\u201379","DOI":"10.1007\/s13676-014-0074-0"},{"key":"955_CR8","unstructured":"McKinsey & Company (2016) Parcel delivery: The future of last mile. Accessed March 16, 2021, https:\/\/www.mckinsey.com\/\/media\/mckinsey\/industries\/travel%20logistics%20and%20infrastructure\/our%20insights\/how%20customer%20demands%20are%20reshaping%20last%20mile%20delivery\/parcel_delivery_the_future_of_last_mile.pdf."},{"issue":"9","key":"955_CR9","doi-asserted-by":"publisher","first-page":"3879","DOI":"10.1287\/mnsc.2019.3411","volume":"66","author":"R Cui","year":"2020","unstructured":"Cui R, Li M, Li Q (2020) Value of high-quality logistics: evidence from a clash between SF express and Alibaba. Manage Sci 66(9):3879\u20133902. https:\/\/doi.org\/10.1287\/mnsc.2019.3411","journal-title":"Manage Sci"},{"issue":"1","key":"955_CR10","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1287\/msom.2021.0174","volume":"26","author":"R Cui","year":"2024","unstructured":"Cui R, Lu Z, Sun T, Golden JM (2024) Sooner or later? Promising delivery speed in online retail. Manuf Serv Oper Manag 26(1):233\u2013251. https:\/\/doi.org\/10.1287\/msom.2021.0174","journal-title":"Manuf Serv Oper Manag"},{"issue":"3","key":"955_CR11","doi-asserted-by":"publisher","first-page":"380","DOI":"10.1287\/trsc.1120.0445","volume":"47","author":"S Dabia","year":"2013","unstructured":"Dabia S, Ropke S, Van Woensel T, De Kok T (2013) Branch and price for the time-dependent vehicle routing problem with time windows. Transp Sci 47(3):380\u2013396. https:\/\/doi.org\/10.1287\/trsc.1120.0445","journal-title":"Transp Sci"},{"key":"955_CR12","unstructured":"DHL (2023) Notification services. Accessed February 20, 2023, www.dhlparcel.nl\/en\/consumer\/change-delivery"},{"key":"955_CR13","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1016\/j.trb.2020.11.012","volume":"144","author":"D Dumez","year":"2021","unstructured":"Dumez D, Lehu\u00e9d\u00e9 F, P\u00e9ton O (2021a) A large neighborhood search approach to the vehicle routing problem with delivery options. Transp Res Part B 144:103\u2013132. https:\/\/doi.org\/10.1016\/j.trb.2020.11.012","journal-title":"Transp Res Part B"},{"key":"955_CR14","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejtl.2021.100040","volume":"10","author":"D Dumez","year":"2021","unstructured":"Dumez D, Tilk C, Irnich S, Lehu\u00e9d\u00e9 F, P\u00e9ton O (2021b) Hybridizing large neighborhood search and exact methods for generalized vehicle routing problems with time windows. EURO J Transport Logist 10:100040. https:\/\/doi.org\/10.1016\/j.ejtl.2021.100040","journal-title":"EURO J Transport Logist"},{"issue":"4","key":"955_CR15","doi-asserted-by":"publisher","first-page":"1293","DOI":"10.1111\/itor.12625","volume":"26","author":"A Estrada-Moreno","year":"2019","unstructured":"Estrada-Moreno A, Savelsbergh M, Juan AA, Panadero J (2019) Biased-randomized iterated local search for a multiperiod vehicle routing problem with price discounts for delivery flexibility. Internat Trans Oper Res 26(4):1293\u20131314. https:\/\/doi.org\/10.1111\/itor.12625","journal-title":"Internat Trans Oper Res"},{"issue":"2","key":"955_CR16","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1080\/09720502.2007.10700491","volume":"10","author":"D Favaretto","year":"2007","unstructured":"Favaretto D, Moretti E, Pellegrini P (2007) Ant colony system for a VRP with multiple time windows and multiple visits. J Interdiscipl Math 10(2):263\u2013284. https:\/\/doi.org\/10.1080\/09720502.2007.10700491","journal-title":"J Interdiscipl Math"},{"issue":"5","key":"955_CR17","doi-asserted-by":"publisher","first-page":"732","DOI":"10.1177\/002224371984994","volume":"56","author":"ML Fisher","year":"2019","unstructured":"Fisher ML, Gallino S, Xu JJ (2019) The value of rapid delivery in omnichannel retailing. J Mark Res 56(5):732\u2013748. https:\/\/doi.org\/10.1177\/002224371984994","journal-title":"J Mark Res"},{"issue":"2","key":"955_CR18","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1287\/trsc.1030.0062","volume":"38","author":"B Fleischmann","year":"2004","unstructured":"Fleischmann B, Gietz M, Gnutzmann S (2004) Time-varying travel times in vehicle routing. Transp Sci 38(2):160\u2013173. https:\/\/doi.org\/10.1287\/trsc.1030.0062","journal-title":"Transp Sci"},{"key":"955_CR19","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1016\/j.trb.2018.09.011","volume":"117","author":"AM Florio","year":"2018","unstructured":"Florio AM, Feillet D, Hartl RF (2018) The delivery problem: optimizing hit rates in e-commerce deliveries. Transp Res Part B 117:455\u2013472. https:\/\/doi.org\/10.1016\/j.trb.2018.09.011","journal-title":"Transp Res Part B"},{"key":"955_CR20","doi-asserted-by":"publisher","unstructured":"Galiullina A, Mutlu N, Kinable J, Van Woensel T (2024) Demand steering in a last-mile delivery problem with home and pickup point delivery options. Transp Sci https:\/\/doi.org\/10.1287\/trsc.2023.0287.","DOI":"10.1287\/trsc.2023.0287"},{"key":"955_CR21","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/j.cor.2015.06.001","volume":"64","author":"M Gendreau","year":"2015","unstructured":"Gendreau M, Ghiani G, Guerriero E (2015) Time-dependent routing problems: a review. Comput Oper Res 64:189\u2013197. https:\/\/doi.org\/10.1016\/j.cor.2015.06.001","journal-title":"Comput Oper Res"},{"issue":"3","key":"955_CR22","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1287\/ijoc.1.3.190","volume":"1","author":"F Glover","year":"1989","unstructured":"Glover F (1989) Tabu search\u2013Part I. ORSA J Comput 1(3):190\u2013206. https:\/\/doi.org\/10.1287\/ijoc.1.3.190","journal-title":"ORSA J Comput"},{"key":"955_CR23","unstructured":"Hermes (2020) Allgemeine Gesch\u00e4ftsbedingungen f\u00fcr den Versand von Hermes P\u00e4ckchen. Hermes Germany GmbH. Accessed October 22, 2022, https:\/\/www.myhermes.de\/content\/pdf\/agb_verpackungsrichtlinien.pdf"},{"issue":"4","key":"955_CR24","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1057\/jors.1992.49","volume":"43","author":"AV Hill","year":"1992","unstructured":"Hill AV, Benton WC (1992) Modelling intra-city time-dependent travel speeds for vehicle scheduling problems. J Oper Res Soc 43(4):343\u2013351. https:\/\/doi.org\/10.1057\/jors.1992.49","journal-title":"J Oper Res Soc"},{"issue":"2","key":"955_CR25","doi-asserted-by":"publisher","first-page":"400","DOI":"10.1287\/trsc.2019.0912","volume":"54","author":"M Hoogeboom","year":"2020","unstructured":"Hoogeboom M, Dullaert W, Lai D, Vigo D (2020) Efficient neighborhood evaluations for the vehicle routing problem with multiple time windows. Transp Sci 54(2):400\u2013416. https:\/\/doi.org\/10.1287\/trsc.2019.0912","journal-title":"Transp Sci"},{"key":"955_CR26","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1016\/j.trb.2016.10.013","volume":"95","author":"Y Huang","year":"2017","unstructured":"Huang Y, Zhao L, Van Woensel T, Gross J-P (2017) Time-dependent vehicle routing problem with path flexibility. Transp Res Part B 95:169\u2013195. https:\/\/doi.org\/10.1016\/j.trb.2016.10.013","journal-title":"Transp Res Part B"},{"issue":"2","key":"955_CR27","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1016\/S0377-2217(02)00147-9","volume":"144","author":"S Ichoua","year":"2003","unstructured":"Ichoua S, Gendreau M, Potvin J (2003) Vehicle dispatching with time-dependent travel times. Eur J Oper Res 144(2):379\u2013396. https:\/\/doi.org\/10.1016\/S0377-2217(02)00147-9","journal-title":"Eur J Oper Res"},{"issue":"2","key":"955_CR28","doi-asserted-by":"publisher","first-page":"1157","DOI":"10.1287\/ijoc.2021.1119","volume":"34","author":"A Jungwirth","year":"2022","unstructured":"Jungwirth A, Desaulniers G, Frey M, Kolisch R (2022) Exact branch price-and-cut for a hospital therapist scheduling problem with flexible service locations and time-dependent location capacity. Informs J Comput 34(2):1157\u20131175. https:\/\/doi.org\/10.1287\/ijoc.2021.1119","journal-title":"Informs J Comput"},{"issue":"4","key":"955_CR29","doi-asserted-by":"publisher","first-page":"969","DOI":"10.1007\/s00291-017-0501-3","volume":"40","author":"R Klein","year":"2018","unstructured":"Klein R, Mackert J, Neugebauer M, Steinhardt C (2018) A model-based approximation of opportunity cost for dynamic pricing in attended home delivery. Or Spectrum 40(4):969\u2013996. https:\/\/doi.org\/10.1007\/s00291-017-0501-3","journal-title":"Or Spectrum"},{"issue":"1","key":"955_CR30","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1287\/trsc.2017.0738","volume":"53","author":"R Klein","year":"2019","unstructured":"Klein R, Neugebauer M, Ratkovitch D, Steinhardt C (2019) Differentiated time slot pricing under routing considerations in attended home delivery. Transp Sci 53(1):236\u2013255. https:\/\/doi.org\/10.1287\/trsc.2017.0738","journal-title":"Transp Sci"},{"issue":"5","key":"955_CR31","doi-asserted-by":"publisher","first-page":"910","DOI":"10.1016\/j.cor.2011.05.027","volume":"39","author":"AL Kok","year":"2012","unstructured":"Kok AL, Hans EW, Schutten JM (2012) Vehicle routing under time-dependent travel times: the impact of congestion avoidance. Comput Oper Res 39(5):910\u2013918. https:\/\/doi.org\/10.1016\/j.cor.2011.05.027","journal-title":"Comput Oper Res"},{"issue":"3","key":"955_CR32","doi-asserted-by":"publisher","first-page":"2033","DOI":"10.1007\/s12351-020-00600-7","volume":"22","author":"GD Konstantakopoulos","year":"2022","unstructured":"Konstantakopoulos GD, Gayialis SP, Kechagias EP (2022) Vehicle routing problem and related algorithms for logistics distribution: a literature review and classification. Oper Res Int J 22(3):2033\u20132062. https:\/\/doi.org\/10.1007\/s12351-020-00600-7","journal-title":"Oper Res Int J"},{"key":"955_CR33","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2023.106480","volume":"163","author":"I Krimi","year":"2024","unstructured":"Krimi I, Benmansour R (2024) Self-adaptive general variable neighborhood search algorithm for parallel machine scheduling with unrelated servers. Comput Oper Res 163:106480. https:\/\/doi.org\/10.1016\/j.cor.2023.106480","journal-title":"Comput Oper Res"},{"issue":"1","key":"955_CR34","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1016\/j.ejor.2018.10.001","volume":"274","author":"X Lai","year":"2019","unstructured":"Lai X, Hao JK, Yue D (2019) Two-stage solution-based tabu search for the multidemand multidimensional knapsack problem. Eur J Oper Res 274(1):35\u201348. https:\/\/doi.org\/10.1016\/j.ejor.2018.10.001","journal-title":"Eur J Oper Res"},{"key":"955_CR35","doi-asserted-by":"publisher","unstructured":"Larsen R, Pacino D (2019) Fast delta evaluation for the vehicle routing problem with multiple time windows. https:\/\/doi.org\/10.48550\/arXiv.1905.04114","DOI":"10.48550\/arXiv.1905.04114"},{"key":"955_CR36","doi-asserted-by":"publisher","first-page":"272","DOI":"10.1016\/j.trpro.2016.11.027","volume":"16","author":"J Lemke","year":"2016","unstructured":"Lemke J, Iwan S, Korczak J (2016) Usability of the parcel lockers from the customer perspective\u2014The research in Polish cities. Transp Res Procedia 16:272\u2013287. https:\/\/doi.org\/10.1016\/j.trpro.2016.11.027","journal-title":"Transp Res Procedia"},{"key":"955_CR37","doi-asserted-by":"publisher","unstructured":"Li J, Qin H, Baldacci R, Zhu W (2020) Branch-and-price-and-cut for the synchronized vehicle routing problem with split delivery, proportional service time and multiple time windows. Transp Res Part E: Logist Transp Rev, 140:101955. https:\/\/doi.org\/10.1016\/j.tre.2020.101955","DOI":"10.1016\/j.tre.2020.101955"},{"issue":"4","key":"955_CR38","doi-asserted-by":"publisher","first-page":"1262","DOI":"10.1111\/poms.13926","volume":"32","author":"SFW Lim","year":"2023","unstructured":"Lim SFW, Wang Q, Webster S (2023) Do it right the first time: vehicle routing with home delivery attempt predictors. Prod Oper Manag 32(4):1262\u20131284. https:\/\/doi.org\/10.1111\/poms.13926","journal-title":"Prod Oper Manag"},{"key":"955_CR39","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1016\/j.future.2019.12.049","volume":"106","author":"Z Lu","year":"2020","unstructured":"Lu Z, Hao J-K, Wu Q (2020) A hybrid evolutionary algorithm for finding low conductance of large graphs. Future Gener Comput Syst 106:105\u2013120. https:\/\/doi.org\/10.1016\/j.future.2019.12.049","journal-title":"Future Gener Comput Syst"},{"key":"955_CR40","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2023.119856","volume":"223","author":"Z Lu","year":"2023","unstructured":"Lu Z, Mart\u00ednez-Gavara A, Hao JK, Lai X (2023) Solution-based tabu search for the capacitated dispersion problem. Expert Syst Appl 223:119856. https:\/\/doi.org\/10.1016\/j.eswa.2023.119856","journal-title":"Expert Syst Appl"},{"issue":"3","key":"955_CR41","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1287\/trsc.26.3.185","volume":"26","author":"C Malandraki","year":"1992","unstructured":"Malandraki C, Daskin MS (1992) Time dependent vehicle routing problems: formulations, properties and heuristic algorithms. Transp Sci 26(3):185\u2013200. https:\/\/doi.org\/10.1287\/trsc.26.3.185","journal-title":"Transp Sci"},{"issue":"1","key":"955_CR42","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1016\/0377-2217(94)00299-1","volume":"90","author":"C Malandraki","year":"1996","unstructured":"Malandraki C, Dial RB (1996) A restricted dynamic programming heuristic algorithm for the time dependent traveling salesman problem. Eur J Oper Res 90(1):45\u201355. https:\/\/doi.org\/10.1016\/0377-2217(94)00299-1","journal-title":"Eur J Oper Res"},{"key":"955_CR43","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2021.105361","volume":"133","author":"S Mancini","year":"2021","unstructured":"Mancini S, Gansterer M (2021) Vehicle routing with private and shared delivery locations. Comput Oper Res 133:105361. https:\/\/doi.org\/10.1016\/j.cor.2021.105361","journal-title":"Comput Oper Res"},{"key":"955_CR44","unstructured":"Ministry of Transport of China (2023) Regulations on the Management of the Express Delivery Market (Order No. 22 of 2023 by the Ministry of Transport of the People\u2019s Republic of China). https:\/\/xxgk.mot.gov.cn\/2020\/jigou\/fgs\/202401\/P020240104504317085126.pdf."},{"key":"955_CR45","doi-asserted-by":"publisher","unstructured":"Pan B, Zhang Z, Lim A (2021) A hybrid algorithm for time-dependent vehicle routing problem with time windows, Comput Oper Res 128:105193. https:\/\/doi.org\/10.1016\/j.cor.2020.105193","DOI":"10.1016\/j.cor.2020.105193"},{"key":"955_CR46","unstructured":"Post NL (2023) PostNL notification services. Accessed March 1, 2023, https:\/\/www.postnl.nl\/zakelijke-oplossingen\/pakket-versturen\/verzendopties\/notificatie-service\/"},{"key":"955_CR47","unstructured":"RetailWire (2016) Will drop-off points boost online sales? Accessed August 1, 2021, www.retailwire.com\/discussion\/will-drop-offpoints-boost-online-sales\/."},{"issue":"5","key":"955_CR48","doi-asserted-by":"publisher","first-page":"1369","DOI":"10.1287\/trsc.2021.1120","volume":"56","author":"H Schaap","year":"2022","unstructured":"Schaap H, Schiffer M, Schneider M, Walther G (2022) A large neighborhood search for the vehicle routing problem with multiple time windows. Transp Sci 56(5):1369\u20131392. https:\/\/doi.org\/10.1287\/trsc.2021.1120","journal-title":"Transp Sci"},{"issue":"4","key":"955_CR49","doi-asserted-by":"publisher","DOI":"10.1016\/j.eij.2023.100420","volume":"24","author":"W Shao","year":"2023","unstructured":"Shao W, Xiao T, Su Z, Ding J, L\u00fc Z (2023) A hybridization of granular adaptive tabu search with path relinking for the multi-depot open vehicle routing problem. Egypt Inform J 24(4):100420. https:\/\/doi.org\/10.1016\/j.eij.2023.100420","journal-title":"Egypt Inform J"},{"issue":"3","key":"955_CR50","doi-asserted-by":"publisher","first-page":"865","DOI":"10.1016\/j.ejor.2022.02.022","volume":"304","author":"N Sluijk","year":"2023","unstructured":"Sluijk N, Florio AM, Kinable J, Dellaert N, Van Woensel T (2023) Two-echelon vehicle routing problems: a literature review. Eur J Oper Res 304(3):865\u2013886. https:\/\/doi.org\/10.1016\/j.ejor.2022.02.022","journal-title":"Eur J Oper Res"},{"issue":"2","key":"955_CR51","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1287\/opre.35.2.254","volume":"35","author":"MM Solomon","year":"1987","unstructured":"Solomon MM (1987) Algorithm for the vehicle routing and scheduling problems with time window constraints. Oper Res 35(2):254\u2013265. https:\/\/doi.org\/10.1287\/opre.35.2.254","journal-title":"Oper Res"},{"issue":"3","key":"955_CR52","doi-asserted-by":"publisher","first-page":"1058","DOI":"10.1016\/j.ejor.2017.07.004","volume":"264","author":"P Sun","year":"2018","unstructured":"Sun P, Veelenturf LP, Dabia S, Van Woensel T (2018a) The time-dependent capacitated profitable tour problem with time windows and precedence constraints. Eur J Oper Res 264(3):1058\u20131073. https:\/\/doi.org\/10.1016\/j.ejor.2017.07.004","journal-title":"Eur J Oper Res"},{"key":"955_CR53","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.trb.2018.07.002","volume":"116","author":"P Sun","year":"2018","unstructured":"Sun P, Veelenturf LP, Hewitt M, Van Woensel T (2018b) The time-dependent pickup and delivery problem with time windows. Transp Res Part B 116:1\u201324. https:\/\/doi.org\/10.1016\/j.trb.2018.07.002","journal-title":"Transp Res Part B"},{"issue":"2","key":"955_CR54","doi-asserted-by":"publisher","first-page":"703","DOI":"10.1016\/j.ejor.2020.12.020","volume":"293","author":"H Tikani","year":"2021","unstructured":"Tikani H, Setak M, Demir E (2021) A risk-constrained time-dependent cash-in-transit routing problem in multigraph under uncertainty. Eur J Oper Res 293(2):703\u2013730. https:\/\/doi.org\/10.1016\/j.ejor.2020.12.020","journal-title":"Eur J Oper Res"},{"issue":"4","key":"955_CR55","doi-asserted-by":"publisher","first-page":"877","DOI":"10.1007\/s00291-021-00633-0","volume":"43","author":"C Tilk","year":"2021","unstructured":"Tilk C, Olkis K, Irnich S (2021) The last-mile vehicle routing problem with delivery options. Or Spectrum 43(4):877\u2013904. https:\/\/doi.org\/10.1007\/s00291-021-00633-0","journal-title":"Or Spectrum"},{"key":"955_CR56","unstructured":"UPS (2018) UPS pulse of the online shopper. Accessed April 7, 2021, www.ups.com\/assets\/resources\/media\/knowledge-center\/upspulse-of-the-online-shopper.PDF."},{"issue":"3","key":"955_CR57","doi-asserted-by":"publisher","first-page":"567","DOI":"10.1287\/trsc.2019.0953","volume":"54","author":"A Vinsensius","year":"2020","unstructured":"Vinsensius A, Wang Y, Chew EP, Lee LH (2020) Dynamic incentive mechanism for delivery slot management in e-commerce attended home delivery. Transp Sci 54(3):567\u2013587. https:\/\/doi.org\/10.1287\/trsc.2019.0953","journal-title":"Transp Sci"},{"issue":"2","key":"955_CR58","doi-asserted-by":"publisher","first-page":"531","DOI":"10.1287\/trsc.2022.1182","volume":"57","author":"S Voigt","year":"2023","unstructured":"Voigt S, Frank M, Fontaine P, Kuhn H (2023) The vehicle routing problem with availability profiles. Transp Sci 57(2):531\u2013551. https:\/\/doi.org\/10.1287\/trsc.2022.1182","journal-title":"Transp Sci"},{"key":"955_CR59","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1016\/j.engappai.2013.09.005","volume":"27","author":"Y Wang","year":"2014","unstructured":"Wang Y, Hao J-K, Glover F, L\u00fc Z (2014) A tabu search based memetic algorithm for the maximum diversity problem. Eng Appl Artif Intell 27:103\u2013114. https:\/\/doi.org\/10.1016\/j.engappai.2013.09.005","journal-title":"Eng Appl Artif Intell"},{"issue":"3","key":"955_CR60","doi-asserted-by":"publisher","first-page":"829","DOI":"10.1016\/j.ejor.2016.10.035","volume":"258","author":"Y Wang","year":"2017","unstructured":"Wang Y, Wu Q, Glover F (2017) Effective metaheuristic algorithms for the minimum differential dispersion problem. Eur J Oper Res 258(3):829\u2013843. https:\/\/doi.org\/10.1016\/j.ejor.2016.10.035","journal-title":"Eur J Oper Res"},{"key":"955_CR61","doi-asserted-by":"publisher","DOI":"10.1016\/j.trc.2022.103901","volume":"144","author":"Y Wang","year":"2022","unstructured":"Wang Y, Wang Z, Hu X, Xue G, Guan X (2022) Truck\u2013drone hybrid routing problem with time-dependent road travel time. Transp Res Part C 144:103901. https:\/\/doi.org\/10.1016\/j.trc.2022.103901","journal-title":"Transp Res Part C"},{"key":"955_CR62","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2021.107260","volume":"105","author":"Z Wei","year":"2021","unstructured":"Wei Z, Hao JK (2021) Multistart solution-based tabu search for the Set-Union Knapsack Problem. Appl Soft Comput 105:107260. https:\/\/doi.org\/10.1016\/j.asoc.2021.107260","journal-title":"Appl Soft Comput"},{"key":"955_CR63","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2024.106807","volume":"172","author":"J Wei","year":"2024","unstructured":"Wei J, Poon M, Zhang Z (2024) A branch-and-cut algorithm for the time-dependent vehicle routing problem with time windows and combinatorial auctions. Comput Oper Res 172:106807. https:\/\/doi.org\/10.1016\/j.cor.2024.106807","journal-title":"Comput Oper Res"},{"key":"955_CR64","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/j.cor.2014.10.007","volume":"56","author":"L Wen","year":"2015","unstructured":"Wen L, Eglese R (2015) Minimum cost VRP with time-dependent speed data and congestion charge. Comput Oper Res 56:41\u201350. https:\/\/doi.org\/10.1016\/j.cor.2014.10.007","journal-title":"Comput Oper Res"},{"issue":"2","key":"955_CR65","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/BF02022565","volume":"41","author":"DL Woodruff","year":"1993","unstructured":"Woodruff DL, Zemel E (1993) Hashing vectors for tabu search. Ann Oper Res 41(2):123\u2013137","journal-title":"Ann Oper Res"},{"issue":"2","key":"955_CR66","doi-asserted-by":"publisher","first-page":"418","DOI":"10.1016\/j.ejor.2023.08.006","volume":"313","author":"Q Wu","year":"2024","unstructured":"Wu Q, He M, Hao JK, Lu Y (2024) An effective hybrid evolutionary algorithm for the clustered orienteering problem. Eur J Oper Res 313(2):418\u2013434. https:\/\/doi.org\/10.1016\/j.ejor.2023.08.006","journal-title":"Eur J Oper Res"},{"key":"955_CR67","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1016\/j.tre.2016.01.011","volume":"88","author":"Y Xiao","year":"2016","unstructured":"Xiao Y, Konak A (2016) The heterogeneous green vehicle routing and scheduling problem with time-varying traffic congestion. Transp Res Part E 88:146\u2013166. https:\/\/doi.org\/10.1016\/j.tre.2016.01.011","journal-title":"Transp Res Part E"},{"key":"955_CR68","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1016\/j.tre.2016.02.011","volume":"89","author":"M Zhalechian","year":"2016","unstructured":"Zhalechian M, Tavakkoli-Moghaddam R, Zahiri B, Mohammadi M (2016) Sustainable design of a closed-loop location-routing-inventory supply chain network under mixed uncertainty. Transp Res Part E 89:182\u2013214. https:\/\/doi.org\/10.1016\/j.tre.2016.02.011","journal-title":"Transp Res Part E"},{"key":"955_CR69","doi-asserted-by":"publisher","unstructured":"Zhao J, Poon M, Zhang Z, Gu R (2022) Adaptive large neighborhood search for the time-dependent profitable dial-a-ride problem. Comput Oper Res 147:105938. https:\/\/doi.org\/10.1016\/j.cor.2022.105938","DOI":"10.1016\/j.cor.2022.105938"},{"issue":"2","key":"955_CR70","doi-asserted-by":"publisher","first-page":"765","DOI":"10.1016\/j.ejor.2017.08.011","volume":"265","author":"L Zhou","year":"2018","unstructured":"Zhou L, Baldacci R, Vigo D, Wang X (2018) A multi-depot two-echelon vehicle routing problem with delivery options arising in the last mile distribution. Eur J Oper Res 265(2):765\u2013778. https:\/\/doi.org\/10.1016\/j.ejor.2017.08.011","journal-title":"Eur J Oper Res"},{"key":"955_CR71","doi-asserted-by":"publisher","unstructured":"Zhao F, Si B, Wei Z,  Lu T (2023) Time-dependent vehicle routing problem of perishable product 14 delivery considering the differences among paths on the congested road. Oper Res Int J, 23(1):5. https:\/\/doi.org\/10.1007\/s12351-023-00751-3","DOI":"10.1007\/s12351-023-00751-3"}],"container-title":["Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12351-025-00955-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12351-025-00955-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12351-025-00955-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,29]],"date-time":"2025-09-29T13:08:16Z","timestamp":1759151296000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12351-025-00955-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,7,21]]},"references-count":71,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2025,9]]}},"alternative-id":["955"],"URL":"https:\/\/doi.org\/10.1007\/s12351-025-00955-9","relation":{},"ISSN":["1109-2858","1866-1505"],"issn-type":[{"value":"1109-2858","type":"print"},{"value":"1866-1505","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,7,21]]},"assertion":[{"value":"5 September 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 April 2025","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 June 2025","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 July 2025","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"80"}}