A survey on the applications of variable neighborhood search algorithm in healthcare management
From MaRDI portal
Publication:2240705
DOI10.1007/s10472-021-09727-5OpenAlexW3132103190MaRDI QIDQ2240705
Shaowen Lan, Wenjuan Fan, Panos M. Pardalos, Shan-Lin Yang, Nenad Mladenović
Publication date: 4 November 2021
Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10472-021-09727-5
health caremetaheuristicvariable neighborhood searchoptimization problemnurse rosteringhome health careoperating roomrouting optimizationperturbation operations
Related Items
Dynamic scheduling of patients in emergency departments, Hybrid genetic search for the traveling salesman problem with hybrid electric vehicle and time windows
Uses Software
Cites Work
- Metaheuristics for solving a multimodal home-healthcare scheduling problem
- Variable neighborhood search for the pharmacy duty scheduling problem
- Ambulance routing for disaster response with patient groups
- A two-phase adaptive variable neighborhood approach for nurse rostering
- Exact and heuristic solutions to minimize total waiting time in the blood products distribution problem
- A variable neighborhood search based matheuristic for nurse rostering problems
- Metaheuristics for the dynamic stochastic dial-a-ride problem with expected return transports
- An evolutionary approach for the nurse rerostering problem
- Securing home health care in times of natural disasters
- A heuristic approach to solve the preventive health care problem with budget and congestion constraints
- Delivery strategies for blood products supplies
- Variable neighbourhood search: methods and applications
- Operating room planning and scheduling: a literature review
- Vendor managed inventory for environments with stochastic product usage
- A hybrid model of integer programming and variable neighbourhood search for highly-constrained nurse rostering problems
- Variable neighborhood search
- Multi-directional local search for a bi-objective dial-a-ride problem in patient transportation
- A variable neighborhood search algorithm for the surgery tactical planning problem
- Variable neighborhood search accelerated column generation for the nurse rostering problem
- General variable neighborhood search for home healthcare routing and scheduling problem with time windows and synchronized visits
- A hybrid integer programming and variable neighbourhood search algorithm to solve nurse rostering problems
- Ejection chains, reference structures and alternating path methods for traveling salesman problems
- A general variable neighborhood search for the one-commodity pickup-and-delivery travelling salesman problem
- A multi-objective combinatorial model of casualty processing in major incident response
- Operating room planning and surgical case scheduling: a review of literature
- A hybrid heuristic ordering and variable neighbourhood search for the nurse rostering problem
- A hybrid setup for a hybrid scenario: combining heuristics for the home health care problem
- A perturbation based variable neighborhood search heuristic for solving the vehicle routing problem with simultaneous pickup and delivery with time limit
- Assigning surgery cases to operating rooms: a VNS approach for leveling ward beds occupancies
- New multi-objective approach for the home care service problem based on scheduling algorithms and variable neighborhood descent
- A heuristic two-phase solution approach for the multi-objective dial-a-ride problem
- Sequential variable neighborhood descent variants: an empirical study on the traveling salesman problem
- Variable neighborhood search: Principles and applications
