{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,16]],"date-time":"2025-12-16T11:58:18Z","timestamp":1765886298073,"version":"3.37.3"},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2021,12,1]],"date-time":"2021-12-01T00:00:00Z","timestamp":1638316800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2021,12,6]],"date-time":"2021-12-06T00:00:00Z","timestamp":1638748800000},"content-version":"vor","delay-in-days":5,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"publisher","award":["CL605\/2-1"],"award-info":[{"award-number":["CL605\/2-1"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"publisher","award":["EH449\/1-1"],"award-info":[{"award-number":["EH449\/1-1"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003065","name":"University of Vienna","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100003065","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Oper. Res. Forum"],"published-print":{"date-parts":[[2021,12]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Attended home delivery requires offering narrow delivery time slots for online booking. Given a fixed fleet of delivery vehicles and uncertainty about the value of potential future customers, retailers have to decide about the offered delivery time slots for each individual order. To this end, dynamic slotting techniques compare the reward from accepting an order to the opportunity cost of not reserving the required delivery capacity for later orders. However, exactly computing this opportunity cost means solving a complex vehicle routing and scheduling problem. In this paper, we propose and evaluate several dynamic slotting approaches that rely on an anticipatory, simulation-based preparation phase ahead of the order horizon to approximate opportunity cost. Our approaches differ in their reliance on outcomes from the preparation phase (anticipation) versus decision making on request arrival (flexibility). For the preparation phase, we create anticipatory schedules by solving the Team Orienteering Problem with Multiple Time Windows. From stochastic demand streams and problem instance characteristics, we apply learning models to flexibly estimate the effort of accepting and delivering an order request. In an extensive computational study, we explore the behavior of the proposed solution approaches. Simulating scenarios of different sizes shows that all approaches require only negligible run times within the order horizon. Finally, an empirical scenario demonstrates the concept of estimating demand model parameters from sales observations and highlights the applicability of the proposed approaches in practice.<\/jats:p>","DOI":"10.1007\/s43069-021-00086-9","type":"journal-article","created":{"date-parts":[[2021,12,6]],"date-time":"2021-12-06T02:02:41Z","timestamp":1638756161000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Anticipative Dynamic Slotting for Attended Home Deliveries"],"prefix":"10.1007","volume":"2","author":[{"given":"Magdalena A. K.","family":"Lang","sequence":"first","affiliation":[]},{"given":"Catherine","family":"Cleophas","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8474-7483","authenticated-orcid":false,"given":"Jan Fabian","family":"Ehmke","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,12,6]]},"reference":[{"issue":"3","key":"86_CR1","doi-asserted-by":"publisher","first-page":"435","DOI":"10.1287\/trsc.1100.0346","volume":"45","author":"N Agatz","year":"2011","unstructured":"Agatz N, Campbell AM, Fleischmann M, Savelsbergh M (2011) Time slot management in attended home delivery. Transp Sci 45(3):435\u2013449","journal-title":"Transp Sci"},{"issue":"2","key":"86_CR2","doi-asserted-by":"publisher","first-page":"128","DOI":"10.1057\/rpm.2012.51","volume":"12","author":"N Agatz","year":"2013","unstructured":"Agatz N, Campbell AM, Fleischmann M, Van Nunen J, Savelsbergh M (2013) Revenue management opportunities for internet retailers. J Revenue Pricing Manag 12(2):128\u2013138","journal-title":"J Revenue Pricing Manag"},{"key":"86_CR3","doi-asserted-by":"crossref","unstructured":"Asdemir K, Jacob VS, Krishnan R (2009) Dynamic pricing of multiple home delivery options.\u00a0Eur\u00a0J\u00a0Oper\u00a0Res\u00a0196(1):246\u2013257","DOI":"10.1016\/j.ejor.2008.03.005"},{"key":"86_CR4","doi-asserted-by":"crossref","unstructured":"Campbell AM, Savelsbergh M (2006) Incentive schemes for attended home delivery services. Transp Sci 40(3)327\u2013341","DOI":"10.1287\/trsc.1050.0136"},{"key":"86_CR5","doi-asserted-by":"crossref","unstructured":"Campbell AM, Savelsbergh MW (2005) Decision support for consumer direct grocery initiatives. Transp Sci 39:(3)313\u2013327","DOI":"10.1287\/trsc.1040.0105"},{"key":"86_CR6","doi-asserted-by":"crossref","unstructured":"Chatwin RE (1998) Multiperiod airline overbooking with a single fare class. Oper Res 46(6):805\u2013819","DOI":"10.1287\/opre.46.6.805"},{"key":"86_CR7","doi-asserted-by":"crossref","unstructured":"Cleophas C, Ehmke JF (2014) When are deliveries profitable? Business & Information Systems Engineering 6:(3)153\u2013163","DOI":"10.1007\/s12599-014-0321-9"},{"key":"86_CR8","doi-asserted-by":"crossref","unstructured":"Davis JM, Gallego G, Topaloglu H (2014) Assortment optimization under variants of the nested logit model. Oper Res 62:(2)250\u2013273","DOI":"10.1287\/opre.2014.1256"},{"key":"86_CR9","doi-asserted-by":"crossref","unstructured":"Ehmke JF, Campbell AM (2014) Customer acceptance mechanisms for home deliveries in metropolitan areas. Eur J Oper Res 233(1):193\u2013207","DOI":"10.1016\/j.ejor.2013.08.028"},{"key":"86_CR10","doi-asserted-by":"crossref","unstructured":"H\u00fcbner A, Kuhn H, Wollenburg J (2016) Last mile fulfilment and distribution in omni-channel grocery retailing: a strategic planning framework.\u00a0Int\u00a0J\u00a0Retail\u00a0Distrib\u00a0Manag\u00a044(3):228\u2013247","DOI":"10.1108\/IJRDM-11-2014-0154"},{"key":"86_CR11","doi-asserted-by":"crossref","unstructured":"Klein R, Mackert J, Neugebauer M, Steinhardt CA (2018) model-based approximation of opportunity cost for dynamic pricing in attended home delivery. OR Spectrum 40:969\u2013996","DOI":"10.1007\/s00291-017-0501-3"},{"key":"86_CR12","doi-asserted-by":"crossref","unstructured":"Klein R, Neugebauer M, Ratkovitch D, Steinhardt C (2017) Differentiated time slot pricing under routing considerations in attended home delivery. Transp Sci 53:(1)236\u2013255","DOI":"10.1287\/trsc.2017.0738"},{"key":"86_CR13","doi-asserted-by":"crossref","unstructured":"Koch S, Klein R (2017) Time window budgets for anticipation in attended home delivery. SSRN Electronic Journal","DOI":"10.2139\/ssrn.3061350"},{"key":"86_CR14","doi-asserted-by":"crossref","unstructured":"K\u00f6hler C, Ehmke JF, Campbell AM (2019) Flexible time window management for attended home deliveries. Omega in Press","DOI":"10.1016\/j.omega.2019.01.001"},{"key":"86_CR15","doi-asserted-by":"crossref","unstructured":"Kunnumkal S (2014) Randomization approaches for network revenue management with customer choice behavior. Production and Operations Management 23(9):1617\u20131633","DOI":"10.1111\/poms.12164"},{"key":"86_CR16","doi-asserted-by":"crossref","unstructured":"Lang M, Cleophas C (2020) Establishing an extendable benchmarking framework for e-fulfillment. In Proceedings of the 53rd Hawaii International Conference on System Sciences","DOI":"10.24251\/HICSS.2020.195"},{"key":"86_CR17","doi-asserted-by":"crossref","unstructured":"Lin II, Mahmassani HS (2002) Can online grocers deliver?: Some logistics considerations. Transp Res Rec\u00a01817(1):17\u201324","DOI":"10.3141\/1817-03"},{"key":"86_CR18","doi-asserted-by":"crossref","unstructured":"Mackert J (2019) Choice-based dynamic time slot management in attended home delivery. Comp Ind Eng 129:333\u2013345","DOI":"10.1016\/j.cie.2019.01.048"},{"key":"86_CR19","doi-asserted-by":"crossref","unstructured":"Meissner J, Strauss A, Talluri K (2013) An enhanced concave program relaxation for choice network revenue management. Prod Oper Manag 22, 1 (2013), 71\u201387","DOI":"10.1111\/j.1937-5956.2012.01345.x"},{"key":"86_CR20","doi-asserted-by":"crossref","unstructured":"Melacini M, Perotti S, Rasini M, Tappia E (2018) E-fulfilment and distribution in omni-channel retailing: a systematic literature review.\u00a0Int J Phys Distrib Logist Manag\u00a048(4):391\u2013414","DOI":"10.1108\/IJPDLM-02-2017-0101"},{"key":"86_CR21","doi-asserted-by":"crossref","unstructured":"Powell WB (2007) Approximate Dynamic Programming: Solving the curses of dimensionality, vol. 703. John Wiley & Sons Inc, Hoboken, New Jersey","DOI":"10.1002\/9780470182963"},{"key":"86_CR22","doi-asserted-by":"crossref","unstructured":"Savelsbergh MW (1985) Local search in routing problems with time windows. Ann Oper Res 4(1)285\u2013305","DOI":"10.1007\/BF02022044"},{"key":"86_CR23","doi-asserted-by":"crossref","unstructured":"Souffriau W, Vansteenwegen P Vanden Berghe G, Van Oudheusden D (2013) The multiconstraint team orienteering problem with multiple time windows. Transp Sci 47(1)53\u201363","DOI":"10.1287\/trsc.1110.0377"},{"key":"86_CR24","unstructured":"Sutton RS, Barto AG (2018) Reinforcement learning: An introduction. MIT press, Cambridge, MA"},{"key":"86_CR25","doi-asserted-by":"crossref","unstructured":"Ulmer MW, Mattfeld DC, K\u00f6ster F (2017) Budgeting time for dynamic vehicle routing with stochastic customer requests. Transp Sci 52(1):20\u201337","DOI":"10.1287\/trsc.2016.0719"},{"key":"86_CR26","doi-asserted-by":"crossref","unstructured":"Ulmer MW, Thomas BW (2019) Meso-parametric value function approximation for dynamic customer acceptances in delivery routing. European Journal of Operational Research in Press","DOI":"10.1016\/j.ejor.2019.04.029"},{"key":"86_CR27","doi-asserted-by":"crossref","unstructured":"Vansteenwegen P, Souffriau W, Berghe GV,\u00a0 Van Oudheusden D (2009) Iterated local search for the team orienteering problem with time windows. Comp Oper Res 36(12):3281\u20133290","DOI":"10.1016\/j.cor.2009.03.008"},{"key":"86_CR28","doi-asserted-by":"crossref","unstructured":"Yang X, Strauss AK (2017) An approximate dynamic programming approach to attended home delivery management. Eur J Oper Res 263(3):935\u2013945","DOI":"10.1016\/j.ejor.2017.06.034"},{"key":"86_CR29","doi-asserted-by":"crossref","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","DOI":"10.1287\/trsc.2014.0549"},{"key":"86_CR30","doi-asserted-by":"crossref","unstructured":"Zhang D, Cooper WL (2005) Revenue management for parallel flights with customer-choice behavior. Oper Res 53:(3)415\u2013431","DOI":"10.1287\/opre.1050.0194"}],"container-title":["Operations Research Forum"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s43069-021-00086-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s43069-021-00086-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s43069-021-00086-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,27]],"date-time":"2021-12-27T06:23:40Z","timestamp":1640586220000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s43069-021-00086-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,12]]},"references-count":30,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2021,12]]}},"alternative-id":["86"],"URL":"https:\/\/doi.org\/10.1007\/s43069-021-00086-9","relation":{},"ISSN":["2662-2556"],"issn-type":[{"type":"electronic","value":"2662-2556"}],"subject":[],"published":{"date-parts":[[2021,12]]},"assertion":[{"value":"15 October 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 July 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 December 2021","order":3,"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 conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of Interest"}}],"article-number":"70"}}