IDEAS home Printed from https://ideas.repec.org/p/ems/eureri/137109.html
   My bibliography  Save this paper

Demand Management for Attended Home Delivery – A Literature Review

Author

Listed:
  • Wassmuth, K.
  • Köhler, C.
  • Agatz, N.A.H.
  • Fleischmann, M.

Abstract

Given the continuing e-commerce boom, the design of efficient and effective home delivery services is increasingly relevant. From a logistics perspective, attended home delivery, which requires the customer to be present when the purchased goods are delivered, is particularly challenging. To facilitate the delivery, the service provider and the customer typically agree on a specific time window for service. In designing the service offering, service providers face complex trade-offs between customer preferences and profitable service execution. In this paper, we map these trade-offs to different planning levels and demand management levers, and structure and synthesize corresponding literature according to different demand management decisions. Finally, we highlight research gaps and future research directions and discuss the linkage of the different planning levels.

Suggested Citation

  • Wassmuth, K. & Köhler, C. & Agatz, N.A.H. & Fleischmann, M., 2022. "Demand Management for Attended Home Delivery – A Literature Review," ERIM Report Series Research in Management ERS-2022-002-LIS, Erasmus Research Institute of Management (ERIM), ERIM is the joint research institute of the Rotterdam School of Management, Erasmus University and the Erasmus School of Economics (ESE) at Erasmus University Rotterdam.
    • Handle: RePEc:ems:eureri:137109
    as

    Download full text from publisher

    File URL: https://repub.eur.nl/pub/137109/ERS-2022-002-LIS_v1.pdf
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Magdalena A. K. Lang & Catherine Cleophas & Jan Fabian Ehmke, 2021. "Anticipative Dynamic Slotting for Attended Home Deliveries," SN Operations Research Forum, Springer, vol. 2(4), pages 1-39, December.
    2. Lebedev, Denis & Goulart, Paul & Margellos, Kostas, 2021. "A dynamic programming framework for optimal delivery time slot pricing," European Journal of Operational Research, Elsevier, vol. 292(2), pages 456-468.
    3. Elena Belavina & Karan Girotra & Ashish Kabra, 2017. "Online Grocery Retail: Revenue Models and Environmental Impact," Management Science, INFORMS, vol. 63(6), pages 1781-1799, June.
    4. Avraham, Edison & Raviv, Tal, 2021. "The steady-state mobile personnel booking problem," Transportation Research Part B: Methodological, Elsevier, vol. 154(C), pages 266-288.
    5. Remy Spliet & Said Dabia & Tom Van Woensel, 2018. "The Time Window Assignment Vehicle Routing Problem with Time-Dependent Travel Times," Transportation Science, INFORMS, vol. 52(2), pages 261-276, March.
    6. Remy Spliet & Adriana F. Gabor, 2015. "The Time Window Assignment Vehicle Routing Problem," Transportation Science, INFORMS, vol. 49(4), pages 721-731, November.
    7. Strauss, Arne & Gülpınar, Nalan & Zheng, Yijun, 2021. "Dynamic pricing of flexible time slots for attended home delivery," European Journal of Operational Research, Elsevier, vol. 294(3), pages 1022-1041.
    8. Nabila Azi & Michel Gendreau & Jean-Yves Potvin, 2012. "A dynamic vehicle routing problem with multiple delivery routes," Annals of Operations Research, Springer, vol. 199(1), pages 103-112, October.
    9. Spliet, Remy & Desaulniers, Guy, 2015. "The discrete time window assignment vehicle routing problem," European Journal of Operational Research, Elsevier, vol. 244(2), pages 379-391.
    10. Nan Liu & Peter M. van de Ven & Bo Zhang, 2019. "Managing Appointment Booking Under Customer Choices," Management Science, INFORMS, vol. 65(9), pages 4280-4298, September.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Klein, Vienna & Steinhardt, Claudius, 2023. "Dynamic demand management and online tour planning for same-day delivery," European Journal of Operational Research, Elsevier, vol. 307(2), pages 860-886.
    2. Abdollahi, Mohammad & Yang, Xinan & Nasri, Moncef Ilies & Fairbank, Michael, 2023. "Demand management in time-slotted last-mile delivery via dynamic routing with forecast orders," European Journal of Operational Research, Elsevier, vol. 309(2), pages 704-718.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Waßmuth, Katrin & Köhler, Charlotte & Agatz, Niels & Fleischmann, Moritz, 2023. "Demand management for attended home delivery—A literature review," European Journal of Operational Research, Elsevier, vol. 311(3), pages 801-815.
    2. Fleckenstein, David & Klein, Robert & Steinhardt, Claudius, 2023. "Recent advances in integrating demand management and vehicle routing: A methodological review," European Journal of Operational Research, Elsevier, vol. 306(2), pages 499-518.
    3. Klein, Vienna & Steinhardt, Claudius, 2023. "Dynamic demand management and online tour planning for same-day delivery," European Journal of Operational Research, Elsevier, vol. 307(2), pages 860-886.
    4. Subramanyam, Anirudh & Wang, Akang & Gounaris, Chrysanthos E., 2018. "A scenario decomposition algorithm for strategic time window assignment vehicle routing problems," Transportation Research Part B: Methodological, Elsevier, vol. 117(PA), pages 296-317.
    5. Yang, Meng & Ni, Yaodong & Song, Qinyu, 2022. "Optimizing driver consistency in the vehicle routing problem under uncertain environment," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 164(C).
    6. Kevin Dalmeijer & Guy Desaulniers, 2021. "Addressing Orientation Symmetry in the Time Window Assignment Vehicle Routing Problem," INFORMS Journal on Computing, INFORMS, vol. 33(2), pages 495-510, May.
    7. Yao, Yu & Van Woensel, Tom & Veelenturf, Lucas P. & Mo, Pengli, 2021. "The consistent vehicle routing problem considering path consistency in a road network," Transportation Research Part B: Methodological, Elsevier, vol. 153(C), pages 21-44.
    8. Neves-Moreira, Fábio & Pereira da Silva, Diogo & Guimarães, Luís & Amorim, Pedro & Almada-Lobo, Bernardo, 2018. "The time window assignment vehicle routing problem with product dependent deliveries," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 116(C), pages 163-183.
    9. Dollevoet, T.A.B. & Pecin, D. & Spliet, R., 2020. "The path programming problem and a partial path relaxation," Econometric Institute Research Papers EI-2020-04, Erasmus University Rotterdam, Erasmus School of Economics (ESE), Econometric Institute.
    10. Koch, Sebastian & Klein, Robert, 2020. "Route-based approximate dynamic programming for dynamic pricing in attended home delivery," European Journal of Operational Research, Elsevier, vol. 287(2), pages 633-652.
    11. Marlin W. Ulmer & Barrett W. Thomas, 2019. "Enough Waiting for the Cable Guy—Estimating Arrival Times for Service Vehicle Routing," Transportation Science, INFORMS, vol. 53(3), pages 897-916, May.
    12. Yan Cheng Hsu & Jose L. Walteros & Rajan Batta, 2020. "Solving the petroleum replenishment and routing problem with variable demands and time windows," Annals of Operations Research, Springer, vol. 294(1), pages 9-46, November.
    13. Campelo, Pedro & Neves-Moreira, Fábio & Amorim, Pedro & Almada-Lobo, Bernardo, 2019. "Consistent vehicle routing problem with service level agreements: A case study in the pharmaceutical distribution sector," European Journal of Operational Research, Elsevier, vol. 273(1), pages 131-145.
    14. Katrin Heßler & Stefan Irnich, 2023. "Partial Dominance in Branch-Price-and-Cut for the Basic Multicompartment Vehicle-Routing Problem," INFORMS Journal on Computing, INFORMS, vol. 35(1), pages 50-65, January.
    15. Bruck, Bruno P. & Cordeau, Jean-François & Iori, Manuel, 2018. "A practical time slot management and routing problem for attended home services," Omega, Elsevier, vol. 81(C), pages 208-219.
    16. Tsang, Man Yiu & Shehadeh, Karmel S., 2023. "Stochastic optimization models for a home service routing and appointment scheduling problem with random travel and service times," European Journal of Operational Research, Elsevier, vol. 307(1), pages 48-63.
    17. Katrin Heßler & Stefan Irnich, 2021. "Partial Dominance in Branch-Price-and-Cut for the Basic Multi-Compartment Vehicle-Routing Problem," Working Papers 2115, Gutenberg School of Management and Economics, Johannes Gutenberg-Universität Mainz.
    18. Pei-Ju Wu & Yu-Shan Lin, 2023. "Reducing waste and achieving sustainable food security through optimizing surplus-food collection and meal distribution," Annals of Operations Research, Springer, vol. 328(2), pages 1537-1555, September.
    19. Annelieke C. Baller & Said Dabia & Wout E. H. Dullaert & Daniele Vigo, 2020. "The Vehicle Routing Problem with Partial Outsourcing," Transportation Science, INFORMS, vol. 54(4), pages 1034-1052, July.
    20. Han, Shuihua & Zhao, Ling & Chen, Kui & Luo, Zong-wei & Mishra, Deepa, 2017. "Appointment scheduling and routing optimization of attended home delivery system with random customer behavior," European Journal of Operational Research, Elsevier, vol. 262(3), pages 966-980.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:ems:eureri:137109. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: RePub (email available below). General contact details of provider: https://edirc.repec.org/data/erimanl.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.