Estrategia de resolución iterativa para el problema de ruteo periódico de vehículos
; Fumero, Yanina 
Otros responsables
Fecha
2025
Editorial
Sociedad Argentina de Informática e Investigación Operativa
Revista
Título del libro
Nombre del evento
54° Jornadas Argentinas de Informática
Fecha del evento
2025-08-04
Institución organizadora
Sociedad Argentina de Informática e Investigación Operativa
ISSN
2451-7496
eISSN
ISBN
Idioma
Español
Tipo del evento
Jornada
Clasificación temática
Palabras clave
Resumen
Dado un horizonte temporal de planificación y una flota limitada y heterogénea, el problema de ruteo periódico de vehículos busca determinar un conjunto de rutas que minimice el costo total de traslado, garantizando al mismo tiempo la satisfacción de la demanda y la frecuencia de visitas requerida por los clientes. La complejidad de este problema radica en la gran cantidad combinatoria de alternativas, ya que se deben tomar decisiones simultáneas sobre qué días visitar a cada cliente, qué vehículos utilizar cada día y cuáles serán las rutas para cada vehículo seleccionado. Este trabajo presenta una metodología eficiente basada en la descomposición del problema en dos subproblemas: uno de asignación y otro de ruteo diario de una flota de vehículos. Se desarrolla una estrategia iterativa que utiliza dos modelos de programación mixta entera lineal: el primero asigna los clientes a días de visita, minimizando los costos fijos de utilización de los vehículos, mientras que el segundo optimiza la asignación de vehículos a clientes y las rutas diarias de cada uno de ellos, de acuerdo con la asignación obtenida en el primer modelo, con el objetivo de reducir el costo total de transporte. Se comparan los resultados obtenidos con un enfoque previamente desarrollado, observándose que, en tiempos de cómputo reducidos, se obtienen soluciones de alta calidad. La estrategia propuesta representa una herramienta útil para la optimización de tareas logísticas, y es aplicable a problemas tanto de recolección como de distribución.
Given a planning horizon and a limited and heterogeneous fleet, the Periodic Vehicle Routing Problem (PVRP) seeks to determine a set of routes that minimizes the total transportation cost while satisfying both the demand and the visit frequency required by each customer. The complexity of this problem lies in the vast combinatorial number of alternatives, since decisions must be made simultaneously regarding which days to visit each customer, which vehicles to use each day, and what routes those vehicles should follow. This work proposes an efficient methodology based on the decomposition of the problem into two subproblems: an assignment model and a daily routing model of a vehicle fleet. An iterative strategy is developed using two mixed-integer linear programming models. The first model assigns customers to visit days in order to minimize the fixed costs of vehicles usage, while the second optimizes both the assignment of vehicles to customers and their daily routes, based on the allocation obtained in the first model, with the goal of minimizing total transportation cost.The proposed strategy is compared with a previously developed approach, showing that high-quality solutions can be obtained in significantly reduced computation times. The proposed solution strategy represents a useful decision-support tool for optimizing logistics tasks and is applicable to both distribution and collection problems.
Given a planning horizon and a limited and heterogeneous fleet, the Periodic Vehicle Routing Problem (PVRP) seeks to determine a set of routes that minimizes the total transportation cost while satisfying both the demand and the visit frequency required by each customer. The complexity of this problem lies in the vast combinatorial number of alternatives, since decisions must be made simultaneously regarding which days to visit each customer, which vehicles to use each day, and what routes those vehicles should follow. This work proposes an efficient methodology based on the decomposition of the problem into two subproblems: an assignment model and a daily routing model of a vehicle fleet. An iterative strategy is developed using two mixed-integer linear programming models. The first model assigns customers to visit days in order to minimize the fixed costs of vehicles usage, while the second optimizes both the assignment of vehicles to customers and their daily routes, based on the allocation obtained in the first model, with the goal of minimizing total transportation cost.The proposed strategy is compared with a previously developed approach, showing that high-quality solutions can be obtained in significantly reduced computation times. The proposed solution strategy represents a useful decision-support tool for optimizing logistics tasks and is applicable to both distribution and collection problems.
Colecciones
Aprobación
Revisión
Complementado por
Referenciado por
Licencia Creative Commons
Excepto donde se indique lo contrario, la licencia de este ítem se describe como by-nc-sa
