Home care (HC) services represent an effective solution to face the health issues related to population aging. However, several scheduling problems arise in HC, and the providers must make several scheduling and routing decisions, e.g., the assignment of caregivers to clients, in order to balance operating costs and client satisfaction. Starting from the analysis of a real HC provider operating in New York City, NY, USA, this article addresses a scheduling problem with chargeable overtime and preference matching and formulates it as an integer programming model. The objective is to minimize a cost function that includes traveling costs, the overtime cost paid by the provider, the preference mismatch, and a penalty related to the continuity of care violation. To solve this problem, we design a matheuristic algorithm that integrates a specific variable neighborhood search with a set covering model. The results demonstrate the applicability and efficiency of our approach to solving real-size instances. Sensitivity analyses are also performed to discuss practical insights.

(2021). A Matheuristic Approach for the Home Care Scheduling Problem With Chargeable Overtime and Preference Matching [journal article - articolo]. In IEEE TRANSACTIONS ON AUTOMATION SCIENCE AND ENGINEERING. Retrieved from http://hdl.handle.net/10446/170624

A Matheuristic Approach for the Home Care Scheduling Problem With Chargeable Overtime and Preference Matching

Lanzarone, Ettore
2021-01-01

Abstract

Home care (HC) services represent an effective solution to face the health issues related to population aging. However, several scheduling problems arise in HC, and the providers must make several scheduling and routing decisions, e.g., the assignment of caregivers to clients, in order to balance operating costs and client satisfaction. Starting from the analysis of a real HC provider operating in New York City, NY, USA, this article addresses a scheduling problem with chargeable overtime and preference matching and formulates it as an integer programming model. The objective is to minimize a cost function that includes traveling costs, the overtime cost paid by the provider, the preference mismatch, and a penalty related to the continuity of care violation. To solve this problem, we design a matheuristic algorithm that integrates a specific variable neighborhood search with a set covering model. The results demonstrate the applicability and efficiency of our approach to solving real-size instances. Sensitivity analyses are also performed to discuss practical insights.
articolo
2021
Gong, Xuran; Geng, Na; Zhu, Yanran; Matta, Andrea; Lanzarone, Ettore
(2021). A Matheuristic Approach for the Home Care Scheduling Problem With Chargeable Overtime and Preference Matching [journal article - articolo]. In IEEE TRANSACTIONS ON AUTOMATION SCIENCE AND ENGINEERING. Retrieved from http://hdl.handle.net/10446/170624
File allegato/i alla scheda:
File Dimensione del file Formato  
09268951.pdf

Solo gestori di archivio

Versione: publisher's version - versione editoriale
Licenza: Licenza default Aisberg
Dimensione del file 3.19 MB
Formato Adobe PDF
3.19 MB Adobe PDF   Visualizza/Apri
Pubblicazioni consigliate

Aisberg ©2008 Servizi bibliotecari, Università degli studi di Bergamo | Terms of use/Condizioni di utilizzo

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/10446/170624
Citazioni
  • Scopus 12
  • ???jsp.display-item.citation.isi??? 11
social impact