VNS methods for home care routing and scheduling problem with temporal dependencies, and multiple structures and specialties
From MaRDI portal
Publication:6088244
DOI10.1111/itor.12604MaRDI QIDQ6088244
Publication date: 16 November 2023
Published in: International Transactions in Operational Research (Search for Journal in Brave)
synchronizationtime windowsVNSdisjunctionhome careprecedenceVRPTWmultiple structuresGVNSGVNS-ECmultiple specialties
Related Items (11)
Temporal constraints and device management for the skill VRP: mathematical model and lower bounding techniques ⋮ The aquaculture service vessel routing problem with time dependent travel times and synchronization constraints ⋮ The daily routing and scheduling problem of home health care: based on costs and participants’ preference satisfaction ⋮ Efficient metaheuristics for the home (health)-care routing and scheduling problem with time windows and synchronized visits ⋮ Multi-objective home health care routing: a variable neighborhood search method ⋮ An exact solution method for home health care scheduling with synchronized services ⋮ A variable neighborhood search for flying sidekick traveling salesman problem ⋮ Constant-factor approximation algorithms for a series of combinatorial routing problems based on the reduction to the asymmetric traveling salesman problem ⋮ Variable neighborhood search based algorithms to solve a rich \(k\)-travelling repairmen problem ⋮ Efficient approximation of the metric CVRP in spaces of fixed doubling dimension ⋮ Approximation of the capacitated vehicle routing problem with a limited number of routes in metric spaces of fixed doubling dimension
Cites Work
- Heuristic solutions for the vehicle routing problem with time windows and synchronized visits
- 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
- Combined vehicle routing and scheduling with temporal precedence and synchronization constraints
- Variable neighborhood search
- General variable neighborhood search for home healthcare routing and scheduling problem with time windows and synchronized visits
- Ejection chains, reference structures and alternating path methods for traveling salesman problems
- The home care crew scheduling problem: preference-based visit clustering and temporal dependencies
- Heuristic algorithms for a vehicle routing problem with simultaneous delivery and pickup and time windows in home health care
- A hybrid setup for a hybrid scenario: combining heuristics for the home health care problem
- A patient assignment algorithm for home care services
- Sequential variable neighborhood descent variants: an empirical study on the traveling salesman problem
- An integration of mixed VND and VNS: the case of the multivehicle covering tour problem
This page was built for publication: VNS methods for home care routing and scheduling problem with temporal dependencies, and multiple structures and specialties