The Multi-Depot Cumulative Vehicle Routing Problem with Mandatory Visit Times and Minimum Delayed Latency

Alan Osorio-Mora, Mauricio Soto-Bustos, Gustavo Gatica, Pedro Palominos, Rodrigo Linfati

Resultado de la investigación: Contribución a una revistaArtículorevisión exhaustiva

Resumen

This paper introduces a novel variant of the cumulative vehicle routing problem (CCVRP) that deals with home health care (HHC) logistics. It includes multiple nonfixed depots and emergency trips from patients to the closest depot. The aim is to minimize the system's delayed latency by satisfying mandatory visit times. Delayed latency corresponds to caregivers' total overtime hours worked while visiting patients. A new mixed-integer linear programming model is proposed to address this problem. Computational experiments, with more than 165 new benchmark instances, are carried out using the CPLEX and Gurobi MIP solvers. The results indicate that patients' geographical distribution directly impacts the complexity of the problem. An analysis of the model parameters proves that instances with more depots/vehicles or longer workdays are significantly easier to solve than are original cases. The results show that Gurobi outperforms CPLEX in 55% of the instances analyzed, while CPLEX performs better in only 16% of them. To the best of our knowledge, this is the first VRP that minimizes delayed latency and the first HHC routing study to use a cumulative objective function.

Idioma originalInglés
Número de artículo9350647
Páginas (desde-hasta)27210-27225
Número de páginas16
PublicaciónIEEE Access
Volumen9
DOI
EstadoPublicada - 2021

Áreas temáticas de ASJC Scopus

  • Informática (todo)
  • Ciencia de los materiales (todo)
  • Ingeniería (todo)

Huella

Profundice en los temas de investigación de 'The Multi-Depot Cumulative Vehicle Routing Problem with Mandatory Visit Times and Minimum Delayed Latency'. En conjunto forman una huella única.

Citar esto