An adaptive large neighbourhood search algorithm for a real-world home care scheduling problem with time windows and dynamic breaks

DOI10.1016/j.cor.2023.106351OpenAlexW4384831183MaRDI QIDQ6047908

Ángel Manuel González-Rueda, Silvia Lorenzo-Freire, Isabel Méndez-Fernández

Publication date: 13 September 2023

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2023.106351

zbMATH Keywords

schedulingmixed integer linear programminghome careadaptive large neighbourhood search

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Cites Work

• Home care service planning. The case of Landelijke Thuiszorg
• A bi-objective home care scheduling problem: analyzing the trade-off between costs and client inconvenience
• A sequential GRASP for the therapist routing and scheduling problem
• A general heuristic for vehicle routing problems
• Home health care routing and scheduling: a review
• A set partitioning heuristic for the home health care routing and scheduling problem
• Mid-term and short-term planning support for home health care services
• A cardinality-constrained robust model for the assignment problem in home care services
• A hybrid setup for a hybrid scenario: combining heuristics for the home health care problem
• Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints

This page was built for publication: An adaptive large neighbourhood search algorithm for a real-world home care scheduling problem with time windows and dynamic breaks