Publication:
A home hospitalization assignment and routing problem with multiple time windows, mandatory returns and perishable biological samples: A Chilean case study

Simple item page
dc.contributor.authorVaras, Mauricio
dc.contributor.authorBaesler, Felipe
dc.contributor.authorBasso, Franco
dc.contributor.authorContreras, Juan Pablo
dc.contributor.authorPezoa, Raúl
dc.contributor.authorRojas-Goldsack, María Francisca
dc.date.accessioned2024-11-20T15:46:00Z
dc.date.available2024-11-20T15:46:00Z
dc.date.issued2024
dc.description.abstractThe increase in life expectancy and formal care has fostered the demand for home care services, including home hospitalization. For this service, decision-makers must allocate the staff and route the visits as efficiently as possible. To tackle this problem, in this paper, we devise a new mixed-integer programming formulation that incorporates several industry-specific features, including matching patients to medical specialties and synchronized visits of multiple specialists. Moreover, the proposed formulation also includes three features that have not been tackled simultaneously in the previous literature: multiple time windows, mandatory lunch breaks at the hospital, and fast delivery of perishable biological samples. The proposed model can be reduced to a vehicle routing problem with multiple times windows, known as NP-hard. Therefore, for solving large instances, we design a heuristic procedure composed of a constructive heuristic coupled with an improvement heuristic, which builds on a local branching scheme. To test the applicability of our approach, we conduct a case study focusing on the actual operations of Hospital Padre Hurtado of Santiago, Chile. Our computational experiments show that the model provides fully implementable solutions. Moreover, the heuristic procedure provides high-quality routes (regarding quality and solution times), making it a promising alternative to experience-based scheduling methods and state-of-the-art solvers.
dc.description.versionVersión publicada
dc.format.extent15 p.
dc.identifier.citationMauricio Varas, Felipe Baesler, Franco Basso, Juan Pablo Contreras, Raúl Pezoa, María Francisca Rojas-Goldsack, Ricardo Ronco, A home hospitalization assignment and routing problem with multiple time windows, mandatory returns and perishable biological samples: A Chilean case study, Computers & Industrial Engineering, Volume 189, 2024, 109951, ISSN 0360-8352, https://doi.org/10.1016/j.cie.2024.109951.
dc.identifier.doihttps://doi.org/10.1016/j.cie.2024.109951
dc.identifier.urihttps://hdl.handle.net/11447/9424
dc.language.isoen
dc.subjectHome care services
dc.subjectStaff allocation
dc.subjectVisit routing
dc.subjectMatheuristics
dc.subjectCase study
dc.titleA home hospitalization assignment and routing problem with multiple time windows, mandatory returns and perishable biological samples: A Chilean case study
dc.typeArticle
dcterms.accessRightsPrivado
dcterms.sourceComputers & Industrial Engineering
dspace.entity.typePublication
relation.isAuthorOfPublicationaabf5511-badd-482c-a49b-670fb33e5dbb
relation.isAuthorOfPublication.latestForDiscoveryaabf5511-badd-482c-a49b-670fb33e5dbb

Files

Original bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
A home hospitalization assignment and routing problem with multiple time windows, mandatory.pdf
Size:
1.07 MB
Format:
Adobe Portable Document Format
Download
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
347 B
Format:
Item-specific license agreed upon to submission
Description:
Download

Collections

Artículos Ingeniería

Implementado por OpenGeek Services