A biased random‐key genetic algorithm for the home health care problem

DOI10.1111/itor.13221arXiv2206.14347OpenAlexW4307282764MaRDI QIDQ6146648

Unnamed Author, Mauricio G. C. Resende, Luciana S. Buriol, Olinto C. B. de Araújo

Publication date: 31 January 2024

Published in: International Transactions in Operational Research (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2206.14347

zbMATH Keywords

solution spaceexploration and exploitationroute synchronizationvehicle routing problem with time-windowshome health care problemroute inter-dependencies

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Cites Work

• Unnamed Item
• Home care service planning. The case of Landelijke Thuiszorg
• Hybrid method with CS and BRKGA applied to the minimization of tool switches problem
• \textsc{Laps}\ \textsc{Care} -- an operational system for staff planning of home care
• Combined vehicle routing and scheduling with temporal precedence and synchronization constraints
• Home health care routing and scheduling: a review
• General variable neighborhood search for home healthcare routing and scheduling problem with time windows and synchronized visits
• A set partitioning heuristic for the home health care routing and scheduling problem
• A parallel multi-population biased random-key genetic algorithm for a container loading problem
• The home care crew scheduling problem: preference-based visit clustering and temporal dependencies
• The multi-parent biased random-key genetic algorithm with implicit path-relinking and its real-world applications
• Pitfalls and Best Practices in Algorithm Configuration
• Handbook of metaheuristics
• Introduction to evolutionary computing