IDEAS home Printed from https://ideas.repec.org/a/eee/transb/v204y2026ics0191261525002309.html

Is waiting worth it? the value of delaying time window assignment in vehicle routing problems

Author

Listed:
  • Çelik, Sifa
  • Schrotenboer, Albert H.
  • Martin, Layla
  • Van Woensel, Tom

Abstract

We explore the critical balance between immediate and delayed communication of time windows to customers in next-day business services, e.g., repairs, high-value deliveries, or installments. Faster communication benefits customers but potentially harms routing quality, including on-time delivery and transport costs. This paper addresses the Dynamic Delayed Time Window Assignment Vehicle Routing Problem (DDTWAVRP), a complex decision-making challenge service providers face. We model the DDTWAVRP as a semi-Markov Decision Process (MDP) with a finite time horizon. We propose two online algorithms as a solution methodology to evaluate the value of delay, namely, the rollout and the multiple scenario approach policy. Rollout policy simulates and approximates the value function to create robust solutions, whereas the multiple scenario approach policy searches for the most popular solution amongst sampled scenarios. We compare the performance of the proposed methodologies with other benchmark policies from the literature. Our numerical study shows an 11.82 % decrease in routing durations if we allow delaying a time window assignment. Compared to only assigning time windows once all demand is known, routing costs only increase marginally. We show that the decision to delay a time window assignment depends on the current state and must be tailored to customers.

Suggested Citation

  • Çelik, Sifa & Schrotenboer, Albert H. & Martin, Layla & Van Woensel, Tom, 2026. "Is waiting worth it? the value of delaying time window assignment in vehicle routing problems," Transportation Research Part B: Methodological, Elsevier, vol. 204(C).
  • Handle: RePEc:eee:transb:v:204:y:2026:i:c:s0191261525002309
    DOI: 10.1016/j.trb.2025.103381
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0191261525002309
    Download Restriction: Full text for ScienceDirect subscribers only

    File URL: https://libkey.io/10.1016/j.trb.2025.103381?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to

    for a different version of it.

    References listed on IDEAS

    as
    1. Pillac, Victor & Gendreau, Michel & Guéret, Christelle & Medaglia, Andrés L., 2013. "A review of dynamic vehicle routing problems," European Journal of Operational Research, Elsevier, vol. 225(1), pages 1-11.
    2. Mathias A. Klapp & Alan L. Erera & Alejandro Toriello, 2018. "The One-Dimensional Dynamic Dispatch Waves Problem," Transportation Science, INFORMS, vol. 52(2), pages 402-415, March.
    3. 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.
    4. Anastasios D. Vareias & Panagiotis P. Repoussis & Panagiotis P. Repoussi, 2019. "Assessing Customer Service Reliability in Route Planning with Self-Imposed Time Windows and Stochastic Travel Times," Service Science, INFORMS, vol. 53(1), pages 256-281, February.
    5. Ann Melissa Campbell & Martin Savelsbergh, 2004. "Efficient Insertion Heuristics for Vehicle Routing and Scheduling Problems," Transportation Science, INFORMS, vol. 38(3), pages 369-378, August.
    6. Paradiso, Rosario & Roberti, Roberto & Ulmer, Marlin, 2025. "Lookahead scenario relaxation for dynamic time window assignment in service routing," Transportation Research Part B: Methodological, Elsevier, vol. 192(C).
    7. Stacy A. Voccia & Ann Melissa Campbell & Barrett W. Thomas, 2019. "The Same-Day Delivery Problem for Online Purchases," Service Science, INFORMS, vol. 53(1), pages 167-184, February.
    8. Remy Spliet & Adriana F. Gabor, 2015. "The Time Window Assignment Vehicle Routing Problem," Transportation Science, INFORMS, vol. 49(4), pages 721-731, November.
    9. Ann Melissa Campbell & Martin W. P. Savelsbergh, 2005. "Decision Support for Consumer Direct Grocery Initiatives," Transportation Science, INFORMS, vol. 39(3), pages 313-327, August.
    10. 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.
    11. Powell, Warren B., 2019. "A unified framework for stochastic optimization," European Journal of Operational Research, Elsevier, vol. 275(3), pages 795-821.
    12. Barrett W. Thomas, 2007. "Waiting Strategies for Anticipating Service Requests from Known Customer Locations," Transportation Science, INFORMS, vol. 41(3), pages 319-331, August.
    13. 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.
    14. Marlin W. Ulmer & Dirk C. Mattfeld & Felix Köster, 2018. "Budgeting Time for Dynamic Vehicle Routing with Stochastic Customer Requests," Transportation Science, INFORMS, vol. 52(1), pages 20-37, January.
    15. Russell W. Bent & Pascal Van Hentenryck, 2004. "Scenario-Based Planning for Partially Dynamic Vehicle Routing with Stochastic Customers," Operations Research, INFORMS, vol. 52(6), pages 977-987, December.
    16. Iman Dayarian & Martin Savelsbergh & John-Paul Clarke, 2020. "Same-Day Delivery with Drone Resupply," Transportation Science, INFORMS, vol. 54(1), pages 229-249, January.
    17. Klapp, Mathias A. & Erera, Alan L. & Toriello, Alejandro, 2018. "The Dynamic Dispatch Waves Problem for same-day delivery," European Journal of Operational Research, Elsevier, vol. 271(2), pages 519-534.
    18. Şifa Çelik & Layla Martin & Albert H. Schrotenboer & Tom Van Woensel, 2025. "Exact Two-Step Benders Decomposition for the Time Window Assignment Traveling Salesperson Problem," Transportation Science, INFORMS, vol. 59(2), pages 210-228, March.
    19. Justin C. Goodson & Jeffrey W. Ohlmann & Barrett W. Thomas, 2013. "Rollout Policies for Dynamic Solutions to the Multivehicle Routing Problem with Stochastic Demand and Duration Limits," Operations Research, INFORMS, vol. 61(1), pages 138-154, February.
    20. Pedro Amorim & Nicole DeHoratius & Fredrik Eng-Larsson & Sara Martins, 2024. "Customer Preferences for Delivery Service Attributes in Attended Home Delivery," Management Science, INFORMS, vol. 70(11), pages 7559-7578, November.
    21. Marlin W. Ulmer & Justin C. Goodson & Dirk C. Mattfeld & Marco Hennig, 2019. "Offline–Online Approximate Dynamic Programming for Dynamic Vehicle Routing with Stochastic Requests," Service Science, INFORMS, vol. 53(1), pages 185-202, February.
    22. Marlin W. Ulmer & Justin C. Goodson & Barrett W. Thomas, 2024. "Optimal Service Time Windows," Transportation Science, INFORMS, vol. 58(2), pages 394-411, March.
    23. Ehmke, Jan Fabian & Campbell, Ann Melissa & Urban, Timothy L., 2015. "Ensuring service levels in routing problems with time windows and stochastic travel times," European Journal of Operational Research, Elsevier, vol. 240(2), pages 539-550.
    24. 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.
    25. Zhang, Jian & Luo, Kelin & Florio, Alexandre M. & Van Woensel, Tom, 2023. "Solving large-scale dynamic vehicle routing problems with stochastic requests," European Journal of Operational Research, Elsevier, vol. 306(2), pages 596-614.
    26. Ehmke, Jan Fabian & Campbell, Ann Melissa, 2014. "Customer acceptance mechanisms for home deliveries in metropolitan areas," European Journal of Operational Research, Elsevier, vol. 233(1), pages 193-207.
    27. 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.
    Full references (including those not matched with items on IDEAS)

    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. Paradiso, Rosario & Roberti, Roberto & Ulmer, Marlin, 2025. "Lookahead scenario relaxation for dynamic time window assignment in service routing," Transportation Research Part B: Methodological, Elsevier, vol. 192(C).
    2. Zhang, Jian & Woensel, Tom Van, 2023. "Dynamic vehicle routing with random requests: A literature review," International Journal of Production Economics, Elsevier, vol. 256(C).
    3. Jean-François Cordeau & Manuel Iori & Dario Vezzali, 2024. "An updated survey of attended home delivery and service problems with a focus on applications," Annals of Operations Research, Springer, vol. 343(2), pages 885-922, December.
    4. 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.
    5. 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.
    6. 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.
    7. Ritzinger, Ulrike & Puchinger, Jakob & Rudloff, Christian & Hartl, Richard F., 2022. "Comparison of anticipatory algorithms for a dial-a-ride problem," European Journal of Operational Research, Elsevier, vol. 301(2), pages 591-608.
    8. Jean-François Cordeau & Manuel Iori & Dario Vezzali, 2023. "A survey of attended home delivery and service problems with a focus on applications," 4OR, Springer, vol. 21(4), pages 547-583, December.
    9. Zhang, Jian & Luo, Kelin & Florio, Alexandre M. & Van Woensel, Tom, 2023. "Solving large-scale dynamic vehicle routing problems with stochastic requests," European Journal of Operational Research, Elsevier, vol. 306(2), pages 596-614.
    10. Soeffker, Ninja & Ulmer, Marlin W. & Mattfeld, Dirk C., 2022. "Stochastic dynamic vehicle routing in the light of prescriptive analytics: A review," European Journal of Operational Research, Elsevier, vol. 298(3), pages 801-820.
    11. Cavaliere, Francesco & Fischetti, Matteo & Roberti, Roberto & Salvagnin, Domenico, 2026. "Models and algorithms for the Time Window Assignment Traveling Salesperson Problem with stochastic travel times," European Journal of Operational Research, Elsevier, vol. 329(1), pages 96-111.
    12. Daniel Cuellar-Usaquén & Marlin & Camilo Gomez & David Alvarez-Martinez, 2023. "Adaptive stochastic lookahead policies for dynamic multi-period purchasing and inventory routing," FEMM Working Papers 23004, Otto-von-Guericke University Magdeburg, Faculty of Economics and Management.
    13. Marlin W. Ulmer & Justin C. Goodson & Barrett W. Thomas, 2023. "Optimal Service Time Windows," FEMM Working Papers 23001, Otto-von-Guericke University Magdeburg, Faculty of Economics and Management.
    14. Alexander Bosse & Marlin W. Ulmer & Emanuele Manni & Dirk C. Mattfeld, 2022. "Dynamic Priority Rules for Combining On-Demand Passenger Transportation and Transportation of Goods," FEMM Working Papers 22006, Otto-von-Guericke University Magdeburg, Faculty of Economics and Management.
    15. Yu Wu & Bo Zeng & Ming Jian, 2025. "ADP- and rollout-based dynamic vehicle routing for pick-up service via budgeting capacity," Flexible Services and Manufacturing Journal, Springer, vol. 37(2), pages 513-557, June.
    16. Bosse, Alexander & Ulmer, Marlin W. & Manni, Emanuele & Mattfeld, Dirk C., 2023. "Dynamic priority rules for combining on-demand passenger transportation and transportation of goods," European Journal of Operational Research, Elsevier, vol. 309(1), pages 399-408.
    17. Chen, Xinwei & Ulmer, Marlin W. & Thomas, Barrett W., 2022. "Deep Q-learning for same-day delivery with vehicles and drones," European Journal of Operational Research, Elsevier, vol. 298(3), pages 939-952.
    18. 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.
    19. Côté, Jean-François & Mansini, Renata & Raffaele, Alice, 2024. "Multi-period time window assignment for attended home delivery," European Journal of Operational Research, Elsevier, vol. 316(1), pages 295-309.
    20. Klapp, Mathias A. & Erera, Alan L. & Toriello, Alejandro, 2020. "Request acceptance in same-day delivery," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 143(C).

    More about this item

    Keywords

    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    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:eee:transb:v:204:y:2026:i:c:s0191261525002309. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/wps/find/journaldescription.cws_home/548/description#description .

    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.