The Capacitated Vehicle Routing Problem with Planned Downtime

Mercedes Landete (), Marina Leal (), Juan Francisco Monge () and Inmaculada Rodríguez-Martín ()
Additional contact information
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

Computational Optimization and Applications, 2025, vol. 92, issue 2, No 9, 655-681

Abstract: 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.

Keywords: Vehicle routing; Scheduled downtime; Branch-and-cut; Bilevel programming (search for similar items in EconPapers)
Date: 2025
References: Add references at CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10589-025-00713-9 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:coopap:v:92:y:2025:i:2:d:10.1007_s10589-025-00713-9

Ordering information: This journal article can be ordered from
http://www.springer.com/math/journal/10589

DOI: 10.1007/s10589-025-00713-9

Access Statistics for this article

Computational Optimization and Applications is currently edited by William W. Hager

More articles in Computational Optimization and Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().