IDEAS home Printed from https://ideas.repec.org/a/spr/orspec/v47y2025i2d10.1007_s00291-024-00781-z.html
   My bibliography  Save this article

New formulations for the robust vehicle routing problem with time windows under demand and travel time uncertainty

Author

Listed:
  • Rafael Campos

    (Université Laval
    Federal University of São Carlos (UFSCar))

  • Leandro C. Coelho

    (Université Laval
    Centre Interuniversitaire de Recherche sur les Réseaux d’Entreprise, la Logistique et le Transport (CIRRELT))

  • Pedro Munari

    (Federal University of São Carlos (UFSCar))

Abstract

We present new formulations for the robust vehicle routing problem with time windows (RVRPTW) under cardinality- and knapsack-constrained demand and travel time uncertainty. They are the first compact models to address the RVRPTW under travel time uncertainty while considering the knapsack uncertainty set. Moreover, our models employ different types of constraints to control time propagation based on Miller–Tucker–Zemlin and single commodity flow constraints, which are derived from the linearization of recursive equations. We develop branch-and-cut methods based on the proposed formulations, leveraging a dynamic programming algorithm to verify the robust feasibility of solutions concerning both demand and travel time uncertainty, in addition to specific and standard separation procedures from the literature. We present detailed computational results on RVRPTW benchmark instances to compare the performance of our models and algorithms. Furthermore, we evaluate the impact and advantages of implementing each studied uncertainty set.

Suggested Citation

  • Rafael Campos & Leandro C. Coelho & Pedro Munari, 2025. "New formulations for the robust vehicle routing problem with time windows under demand and travel time uncertainty," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 47(2), pages 411-453, June.
    • Handle: RePEc:spr:orspec:v:47:y:2025:i:2:d:10.1007_s00291-024-00781-z
    DOI: 10.1007/s00291-024-00781-z
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s00291-024-00781-z
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s00291-024-00781-z?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 search for a different version of it.

    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:spr:orspec:v:47:y:2025:i:2:d:10.1007_s00291-024-00781-z. 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.

    We have no bibliographic references for this item. You can help adding them by using 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.