IDEAS home Printed from https://ideas.repec.org/a/spr/coopap/v92y2025i2d10.1007_s10589-025-00713-9.html
   My bibliography  Save this article

The Capacitated Vehicle Routing Problem with Planned Downtime

Author

Listed:
  • Mercedes Landete

    (University Miguel Hernández)

  • Marina Leal

    (University Miguel Hernández)

  • Juan Francisco Monge

    (University Miguel Hernández)

  • Inmaculada Rodríguez-Martín

    (Faculty of Science, IMAULL, University of La Laguna)

Abstract

The Capacitated Vehicle Routing Problem with Planned Downtime introduced in this work is a generalization of the classical vehicle routing problem in which two sets of routes have to be jointly designed: one set considering that all the vehicles of the fleet are available, and another set that considers the scheduled unavailability of a vehicle. Besides routing cost minimization, it is also intended that the routes for the two cases (when all vehicles are available and when one is missing) are as similar as possible in order to reduce the impact on the customers. In this paper, we formally define the problem, propose two mixed integer programming models for it, one of them based on bilevel programming, and devise exact branch-and-cut algorithms based on those models. The algorithms are first compared, and then the most efficient one is tested on different benchmark instances with up to 40 nodes and 5 vehicles.

Suggested Citation

  • Mercedes Landete & Marina Leal & Juan Francisco Monge & Inmaculada Rodríguez-Martín, 2025. "The Capacitated Vehicle Routing Problem with Planned Downtime," Computational Optimization and Applications, Springer, vol. 92(2), pages 655-681, November.
    • Handle: RePEc:spr:coopap:v:92:y:2025:i:2:d:10.1007_s10589-025-00713-9
    DOI: 10.1007/s10589-025-00713-9
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10589-025-00713-9
    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/s10589-025-00713-9?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.

    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:spr:coopap:v:92:y:2025:i:2:d:10.1007_s10589-025-00713-9. 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.