Models for the Capacitated Vehicle Routing Problem with bounds on each route duration.

J. J. Salazar González

In the classical Capacitated Vehicle Routing Problem (CVRP) routing costs and customer demands are given, and a vehicle route is feasible when the total demand of assigned customers does not exceed the vehicle capacity. The aim is to design vehicle routes to visit each customer once and to minimize the sum of routing costs. In this talk, we address a variant of this problem where travel times are also given, and a vehicle route is feasible when its total travel time must fit within a given interval. Despite the large number of applications where the duration of each vehicle route is constrained, the literature on this difficult variant proposes mainly heuristic approaches. We present new MILP formulations for the exact solution and discuss computational results.

Keywords: Vehicle Routing

Routes and inventory
June 10, 2025  5:10 PM
Mr 2

J. Sicilia Rodríguez, L. A. San José Nieto, M. González de la Rosa, J. Febles Acosta

V. Pando Fernández, L. A. San José Nieto, J. Sicilia Rodríguez, D. Alcaide López de Pablo

I. Valero Pedrón, M. Reula Martin, C. Parreño Torres, M. T. Alonso Martínez, F. Parreño Torres