Hybridizing adaptive large neighborhood search with kernel search: a new solution approach for the nurse routing problem with incompatible services and minimum demand

DOI10.1111/itor.13127OpenAlexW4212835328MaRDI QIDQ6056092

Roberto Zanotti, Daniele Manerba, Alessandro Gobbi, Renata Mansini

Publication date: 29 September 2023

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

Full work available at URL: https://doi.org/10.1111/itor.13127

zbMATH Keywords

ALNSkernel searchhome Healthcareincompatible servicesnurse routing problem

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Related Items (1)

Patient admission scheduling problems with uncertain length of stay: optimization models and an efficient matheuristic approach

Cites Work

• Metaheuristics for solving a multimodal home-healthcare scheduling problem
• The multi-vehicle traveling purchaser problem with pairwise incompatibility constraints and unitary demands: a branch-and-price approach
• A bi-objective home care scheduling problem: analyzing the trade-off between costs and client inconvenience
• Kernel search: a new heuristic framework for portfolio selection
• Securing home health care in times of natural disasters
• \textsc{Laps}\ \textsc{Care} -- an operational system for staff planning of home care
• A general heuristic for vehicle routing problems
• Combined vehicle routing and scheduling with temporal precedence and synchronization constraints
• The manpower allocation problem with time windows and job-teaming constraints: A branch-and-price approach
• Kernel search: a general heuristic for the multi-dimensional knapsack problem
• The transportation problem with exclusionary side constraints
• A mixed-integer model for solving ordering problems with side constraints
• Home health care routing and scheduling: a review
• A matheuristic based on large neighborhood search for the vehicle routing problem with cross-docking
• The traveling purchaser problem and its variants
• The directed profitable rural postman problem with incompatibility constraints
• Optimal patient and personnel scheduling policies for care-at-home service facilities
• The home care crew scheduling problem: preference-based visit clustering and temporal dependencies
• Record breaking optimization results using the ruin and recreate principle
• Exact solution algorithms for the maximum flow problem with additional conflict constraints
• Coupling feasibility pump and large neighborhood search to solve the Steiner team orienteering problem
• Prioritized single nurse routing and scheduling for home healthcare services
• Optimizing the physician scheduling problem in a large hospital ward
• A two-phase kernel search variant for the multidimensional multiple-choice knapsack problem
• The multi-visit team orienteering problem with precedence constraints
• A hybrid setup for a hybrid scenario: combining heuristics for the home health care problem
• A Branch-and-Bound Algorithm for the Knapsack Problem with Conflict Graph
• A branch‐and‐cut algorithm for the Team Orienteering Problem
• A stochastic programming approach for the traveling purchaser problem

This page was built for publication: Hybridizing adaptive large neighborhood search with kernel search: a new solution approach for the nurse routing problem with incompatible services and minimum demand