{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,17]],"date-time":"2026-01-17T22:39:40Z","timestamp":1768689580552,"version":"3.49.0"},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2023,4,1]],"date-time":"2023-04-01T00:00:00Z","timestamp":1680307200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2023,4,1]],"date-time":"2023-04-01T00:00:00Z","timestamp":1680307200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"name":"Europa-Universit\u00e4t Viadrina Frankfurt (Oder)"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["OR Spectrum"],"published-print":{"date-parts":[[2024,6]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Home delivery services require the attendance of the customer during delivery. Hence, retailers and customers mutually agree on a delivery time window in the booking process. However, when a customer requests a time window, it is not clear how much accepting the ongoing request significantly reduces the availability of time windows for future customers. In this paper, we explore using historical order data to manage scarce delivery capacities efficiently. We propose a sampling-based customer acceptance approach that is fed with different combinations of these data to assess the impact of the current request on route efficiency and the ability to accept future requests. We propose a data-science process to investigate the best use of historical order data in terms of recency and amount of sampling data. We identify features that help to improve the acceptance decision as well as the retailer\u2019s revenue. We demonstrate our approach with large amounts of real historical order data from two cities served by an online grocery in Germany.<\/jats:p>","DOI":"10.1007\/s00291-023-00712-4","type":"journal-article","created":{"date-parts":[[2023,4,3]],"date-time":"2023-04-03T05:57:57Z","timestamp":1680501477000},"page":"295-330","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Data-driven customer acceptance for attended home delivery"],"prefix":"10.1007","volume":"46","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1240-9335","authenticated-orcid":false,"given":"Charlotte","family":"K\u00f6hler","sequence":"first","affiliation":[]},{"given":"Ann Melissa","family":"Campbell","sequence":"additional","affiliation":[]},{"given":"Jan Fabian","family":"Ehmke","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,4,1]]},"reference":[{"issue":"2","key":"712_CR1","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1007\/s10115-016-0987-z","volume":"51","author":"S Aminikhanghahi","year":"2017","unstructured":"Aminikhanghahi S, Cook DJ (2017) A survey of methods for time series change point detection. Knowl Inf Syst 51(2):339\u2013367","journal-title":"Knowl Inf Syst"},{"key":"712_CR2","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1007\/s10479-011-0991-3","volume":"199","author":"N Azi","year":"2012","unstructured":"Azi N, Gendreau M, Potvin J-Y (2012) A dynamic vehicle routing problem with multiple delivery routes. Ann Oper Res 199:103\u2013112","journal-title":"Ann Oper Res"},{"issue":"6","key":"712_CR3","doi-asserted-by":"publisher","first-page":"977","DOI":"10.1287\/opre.1040.0124","volume":"52","author":"R Bent","year":"2004","unstructured":"Bent R, Van Hentenryck P (2004) Scenario-based planning for partially dynamic vehicle routing with stochastic customers. Oper Res 52(6):977\u2013987","journal-title":"Oper Res"},{"issue":"3","key":"712_CR4","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1287\/trsc.1040.0105","volume":"39","author":"AM Campbell","year":"2005","unstructured":"Campbell AM, Savelsbergh M (2005) Decision support for consumer direct grocery initiatives. Transp Sci 39(3):313\u2013327","journal-title":"Transp Sci"},{"issue":"3","key":"712_CR5","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","journal-title":"Transp Sci"},{"key":"712_CR6","doi-asserted-by":"publisher","DOI":"10.1007\/s40747-021-00293-1","author":"H Chu","year":"2021","unstructured":"Chu H, Zhang W, Bai P, Chen Y (2021) Data-driven optimization for last-mile delivery. Complex Intell Syst. https:\/\/doi.org\/10.1007\/s40747-021-00293-1","journal-title":"Complex Intell Syst"},{"issue":"3","key":"712_CR7","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/s12599-014-0321-9","volume":"6","author":"C Cleophas","year":"2014","unstructured":"Cleophas C, Ehmke JF (2014) When are deliveries profitable? Bus Inf Syst Eng 6(3):153\u2013163","journal-title":"Bus Inf Syst Eng"},{"key":"712_CR8","doi-asserted-by":"crossref","unstructured":"Cwioro G, Hungerl\u00e4nder P, Maier K, P\u00f6cher J, Truden C (2019) An optimization approach to the ordering phase of an attended home delivery service. Springer, pp 208\u2013224","DOI":"10.1007\/978-3-030-19212-9_14"},{"issue":"1","key":"712_CR9","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1016\/j.ejor.2013.08.028","volume":"233","author":"JF Ehmke","year":"2014","unstructured":"Ehmke JF, Campbell AM (2014) Customer acceptance mechanisms for home deliveries in metropolitan areas. Eur J Oper Res 233(1):193\u2013207","journal-title":"Eur J Oper Res"},{"issue":"1","key":"712_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2379776.2379788","volume":"45","author":"P Esling","year":"2012","unstructured":"Esling P, Agon C (2012) Time-series data mining. ACM Comput Surveys (CSUR) 45(1):1\u201334","journal-title":"ACM Comput Surveys (CSUR)"},{"issue":"1","key":"712_CR11","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1016\/j.tre.2008.08.003","volume":"45","author":"G Ghiani","year":"2009","unstructured":"Ghiani G, Manni E, Quaranta A, Triki C (2009) Anticipatory algorithms for sameday courier dispatching. Transp Res Part E: Logistics Transp Rev 45(1):96\u2013106","journal-title":"Transp Res Part E: Logistics Transp Rev"},{"key":"712_CR12","volume-title":"Principles of data mining (adaptive computation and machine learning)","author":"DJ Hand","year":"2001","unstructured":"Hand DJ, Mannila H, Smyth P (2001) Principles of data mining (adaptive computation and machine learning). MIT Press, Cambridge"},{"key":"712_CR13","first-page":"492","volume":"27","author":"P Hungerl\u00e4nder","year":"2017","unstructured":"Hungerl\u00e4nder P, Rendl A, Truden C (2017) On the slot optimization problem in on-line vehicle routing. Transp Res Proc 27:492\u2013499","journal-title":"Transp Res Proc"},{"issue":"4","key":"712_CR14","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1287\/trsc.1060.0166","volume":"40","author":"LM Hvattum","year":"2006","unstructured":"Hvattum LM, L\u00f8kketangen A, Laporte G (2006) Solving a dynamic and stochastic vehicle routing problem with a sample scenario hedging heuristic. Transp Sci 40(4):421\u2013438","journal-title":"Transp Sci"},{"issue":"1","key":"712_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/2945.981847","volume":"8","author":"DA Keim","year":"2002","unstructured":"Keim DA (2002) Information visualization and visual data mining. IEEE Trans Visual Comput Graphics 8(1):1\u20138","journal-title":"IEEE Trans Visual Comput Graphics"},{"key":"712_CR16","doi-asserted-by":"publisher","first-page":"969","DOI":"10.1007\/s00291-017-0501-3","volume":"40","author":"R Klein","year":"2017","unstructured":"Klein R, Mackert J, Neugebauer M, Steinhardt C (2017) A model-based approximation of opportunity cost for dynamic pricing in attended home delivery. OR Spectr 40:969\u2013996","journal-title":"OR Spectr"},{"issue":"1","key":"712_CR17","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","journal-title":"Transp Sci"},{"key":"712_CR18","doi-asserted-by":"publisher","DOI":"10.1016\/j.omega.2019.01.001","volume":"91","author":"C K\u00f6hler","year":"2020","unstructured":"K\u00f6hler C, Ehmke JF, Campbell AM (2020) Flexible time window management for attended home deliveries. Omega 91:102023","journal-title":"Omega"},{"key":"712_CR19","doi-asserted-by":"crossref","unstructured":"K\u00f6hler C, Ehmke JF, Campbell AM, Cleophas C (2019) Flexible dynamic time window pricing for attended home deliveries. Working Paper Series","DOI":"10.1016\/j.omega.2019.01.001"},{"key":"712_CR20","first-page":"67","volume":"37","author":"C K\u00f6hler","year":"2019","unstructured":"K\u00f6hler C, Haferkamp J (2019) Evaluation of delivery cost approximation for attended home deliveries. Transp Res Proc 37:67\u201374","journal-title":"Transp Res Proc"},{"key":"712_CR21","doi-asserted-by":"publisher","unstructured":"Lochem Jv, Kronmueller M, Hof Pvt, Alonso-Mora J (2020) Anticipatory vehicle routing for same-day pick-up and delivery using historical data clustering. In 2020 IEEE 23rd international conference on intelligent transportation systems (ITSC), pp 1\u20136. https:\/\/doi.org\/10.1109\/ITSC45102.2020.9294424","DOI":"10.1109\/ITSC45102.2020.9294424"},{"key":"712_CR22","unstructured":"Perron L, Furnon V (2019) OR-Tools. Google"},{"key":"712_CR23","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ejor.2012.08.015","volume":"225","author":"V Pillac","year":"2013","unstructured":"Pillac V, Gendreau M, Gu\u00e9ret C, Medaglia AL (2013) A review of dynamic vehicle routing problems. Eur J Oper Res 225:1\u201311","journal-title":"Eur J Oper Res"},{"issue":"1","key":"712_CR24","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1089\/big.2013.1508","volume":"1","author":"F Provost","year":"2013","unstructured":"Provost F, Fawcett T (2013) Data science and its relationship to big data and data-driven decision making. Big Data 1(1):51\u201359","journal-title":"Big Data"},{"issue":"4","key":"712_CR25","doi-asserted-by":"publisher","first-page":"1016","DOI":"10.1287\/trsc.2019.0958","volume":"54","author":"MW Ulmer","year":"2020","unstructured":"Ulmer MW (2020) Dynamic pricing and routing for same-day delivery. Transp Sci 54(4):1016\u20131033","journal-title":"Transp Sci"},{"issue":"8","key":"712_CR26","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1145\/2240236.2240257","volume":"55","author":"W Van Der Aalst","year":"2012","unstructured":"Van Der Aalst W (2012) Process mining. Commun ACM 55(8):76\u201383","journal-title":"Commun ACM"},{"key":"712_CR27","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/s10479-009-0605-5","volume":"177","author":"P Van Hentenryck","year":"2010","unstructured":"Van Hentenryck P, Bent R, Upfal E (2010) Online stochastic optimization under time constraints. Ann Oper Res 177:151\u2013183","journal-title":"Ann Oper Res"},{"issue":"12","key":"712_CR28","doi-asserted-by":"publisher","first-page":"3281","DOI":"10.1016\/j.cor.2009.03.008","volume":"36","author":"P Vansteenwegen","year":"2009","unstructured":"Vansteenwegen P, Souffriau W, Vanden Berghe G, Van Oudheusden D (2009) Iterated local search for the team orienteering problem with time windows. Comput Oper Res 36(12):3281\u20133290","journal-title":"Comput Oper Res"},{"issue":"2","key":"712_CR29","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1287\/trsc.2014.0549","volume":"50","author":"X Yang","year":"2016","unstructured":"Yang X, Strauss AK, Currie CS, Eglese R (2016) Choice-based demand management and vehicle routing in e-fulfillment. Transp Sci 50(2):473\u2013488","journal-title":"Transp Sci"},{"key":"712_CR30","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2021.105328","volume":"133","author":"W Zeng","year":"2021","unstructured":"Zeng W, Ren Y, Wei W, Yang Z (2021) A data-driven flight schedule optimization model considering the uncertainty of operational displacement. Comput Oper Res 133:105328","journal-title":"Comput Oper Res"}],"container-title":["OR Spectrum"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00291-023-00712-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00291-023-00712-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00291-023-00712-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,1]],"date-time":"2024-06-01T16:02:34Z","timestamp":1717257754000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00291-023-00712-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,4,1]]},"references-count":30,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2024,6]]}},"alternative-id":["712"],"URL":"https:\/\/doi.org\/10.1007\/s00291-023-00712-4","relation":{},"ISSN":["0171-6468","1436-6304"],"issn-type":[{"value":"0171-6468","type":"print"},{"value":"1436-6304","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,4,1]]},"assertion":[{"value":"22 May 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 February 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 April 2023","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}