Mostrar o rexistro simple do ítem
An Adaptive Large Neighbourhood Search algorithm for a real-world Home Care Scheduling Problem with time windows and dynamic breaks
dc.contributor.author | Méndez-Fernández, Isabel | |
dc.contributor.author | Lorenzo Freire, Silvia | |
dc.contributor.author | González Rueda, Ángel Manuel | |
dc.date.accessioned | 2023-11-16T13:50:55Z | |
dc.date.available | 2023-11-16T13:50:55Z | |
dc.date.issued | 2023-11 | |
dc.identifier.citation | I. Méndez-Fernández, S. Lorenzo-Freire, and Á.M. González-Rueda, "An Adaptive Large Neighbourhood Search algorithm for a real-world Home Care Scheduling Problem with time windows and dynamic breaks", Computers and Operations Research, Vol. 159, November 2023, article 106351, doi: 10.1016/j.cor.2023.106351 | es_ES |
dc.identifier.uri | http://hdl.handle.net/2183/34267 | |
dc.description | Financiado para publicación en acceso aberto: Universidade da Coruña/CISUG | es_ES |
dc.description.abstract | [Abstract]: This paper presents a Home Care Scheduling Problem (from now on HCSP) based on a real case of a care company for elderly and dependent people located in the North of Spain. The problem incorporates many of the common features addressed in the HCSP literature, such as soft and hard time windows for the services, available working time of the caregivers or affinity levels between users and caregivers. However, it also includes other novel characteristics that increase the difficulty of the problem significantly, since the breaks between services will play a key role in the quality of the solutions. To evaluate the solutions, the users welfare will be prioritized over the cost associated with the schedule. The problem has been formulated as a Mixed Integer Linear Programming (MILP) one but, due to the complexity of the model, it is not possible to solve it for real size instances. Therefore, we have designed a method that combines the Adaptive Large Neighbourhood Search (ALNS) methodology with a heuristic approach necessary to evaluate the objective functions. To analyse the behaviour of the algorithm, a set of computational experiments are carried out under different configurations. First, the MILP formulation and the algorithm have been compared over some standard instances from the literature. Finally, the performance of the algorithm is evaluated over a real case study based on the timetables of the company during some weeks from 2016 to 2017. | es_ES |
dc.description.sponsorship | This research was funded by MICINN/AEI/10.13039/501100011033/ and ERDF/EU through R+D+I project grants MTM2017-87197-C3-1-P and PID2021-124030NB-C31 and by Consellería de Cultura, Educación e Universidades, Xunta de Galicia (Grupos de Referencia Competitiva ED431C-2020/14 and Centro de Investigación del Sistema universitario de Galicia ED431G-2019/01). Funding for open access charge: Universidade da Coruña/CISUG. Constructive comments from several referees and the editor are also gratefully acknowledged. | es_ES |
dc.description.sponsorship | Xunta de Galicia; ED431C-2020/14 | es_ES |
dc.description.sponsorship | Xunta de Galicia; ED431G-2019/01 | es_ES |
dc.language.iso | eng | es_ES |
dc.publisher | Elsevier Ltd | es_ES |
dc.relation | info:eu-repo/grantAgreement/AEI/Plan Estatal de Investigación Científica y Técnica y de Innovación 2013-2016/MTM2017-87197-C3-1-P/ES/OPTIMIZACION Y COOPERACION CON APLICACIONES EN ECONOMIA, ENERGIA Y LOGISTICA | es_ES |
dc.relation | info:eu-repo/grantAgreement/AEI/Plan Estatal de Investigación Científica, Técnica y de Innovación 2021-2023/PID2021-124030NB-C31/ES/OPTIMIZACIÓN, APRENDIZAJE Y COOPERACIÓN CON APLICACIONES EN LOGÍSTICA | es_ES |
dc.relation.uri | https://doi.org/10.1016/j.cor.2023.106351 | es_ES |
dc.rights | Atribución 4.0 Internacional (CC BY 4.0) | es_ES |
dc.rights.uri | http://creativecommons.org/licenses/by/3.0/es/ | * |
dc.subject | Adaptive large neighbourhood search | es_ES |
dc.subject | Home care | es_ES |
dc.subject | Mixed integer linear programming | es_ES |
dc.subject | Scheduling | es_ES |
dc.title | An Adaptive Large Neighbourhood Search algorithm for a real-world Home Care Scheduling Problem with time windows and dynamic breaks | es_ES |
dc.type | info:eu-repo/semantics/article | es_ES |
dc.rights.access | info:eu-repo/semantics/openAccess | es_ES |
UDC.journalTitle | Computers and Operations Research | es_ES |
UDC.volume | 159 | es_ES |
UDC.startPage | 106351 | es_ES |
dc.identifier.doi | 10.1016/j.cor.2023.106351 |
Ficheiros no ítem
Este ítem aparece na(s) seguinte(s) colección(s)
-
GI-MODES - Artigos [139]