A set partitioning heuristic for the home health care routing and scheduling problem

DOI10.1016/J.EJOR.2018.11.025zbMath1430.90264OpenAlexW2900906469WikidataQ128951980 ScholiaQ128951980MaRDI QIDQ1711476

Antoine Legrain, Nadia Lahrichi, Louis-Martin Rousseau, Florian Grenouilleau

Publication date: 18 January 2019

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2018.11.025

zbMATH Keywords

schedulingroutinglarge neighborhood searchset partitioningOR in health services

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (16)

An integrated routing and scheduling problem for home healthcare delivery with limited person-to-person contact ⋮ A column generation-based heuristic for a rehabilitation patient scheduling and routing problem ⋮ Dynamic routing-scheduling problem for home health care considering caregiver-patient compatibility ⋮ Multi-period location routing: an application to the planning of mobile clinic operations in Iraq ⋮ An adaptive large neighbourhood search algorithm for a real-world home care scheduling problem with time windows and dynamic breaks ⋮ An exact two-phase approach to re-optimize tours in home care planning ⋮ Minimizing total weighted latency in home healthcare routing and scheduling with patient prioritization ⋮ Home healthcare staff dimensioning problem for temporary caregivers: a matheuristic solution approach ⋮ A survey of attended home delivery and service problems with a focus on applications ⋮ A biased random‐key genetic algorithm for the home health care problem ⋮ Stochastic joint homecare service and capacity planning with nested decomposition approaches ⋮ A matheuristic algorithm for stochastic home health care planning ⋮ Prioritized single nurse routing and scheduling for home healthcare services ⋮ New decomposition methods for home care scheduling with predefined visits ⋮ Merging short-term and long-term planning problems in home health care under continuity of care and patterns for visits ⋮ A model-based evolutionary algorithm for home health care scheduling

Uses Software

• PARPAP

Cites Work

• Optimization by Simulated Annealing
• Metaheuristics for solving a multimodal home-healthcare scheduling problem
• 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
• Pattern-based decompositions for human resource planning in home health care services
• Heuristic concentration: Two stage solution construction
• 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
• Vehicle dispatching with time-dependent travel times
• Mid-term and short-term planning support for home health care services
• Record breaking optimization results using the ruin and recreate principle
• A hybrid setup for a hybrid scenario: combining heuristics for the home health care problem
• Combination of Metaheuristic and Exact Algorithms for Solving Set Covering-Type Optimization Problems
• A branch-and-price algorithm for the long-term home care scheduling problem
• Handbook of metaheuristics

This page was built for publication: A set partitioning heuristic for the home health care routing and scheduling problem