Nurse Scheduling Method and Device Based on Random Variable Neighborhood Search Algorithm
A technology of variable neighborhood search and nurse, applied in the field of personnel scheduling, can solve problems such as long time-consuming, achieve high efficiency, and simplify the effect of scheduling algorithms
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment 1
[0042] This embodiment provides a nurse shift scheduling method based on a random variable neighborhood search algorithm, such as figure 1 shown, including the following steps:
[0043] Step 1: Set the constraints that nurses need to meet for scheduling, and obtain the objective function f(x) according to the constraints;
[0044] The present invention adopts the model and data set adopted in the First International NurseRostering Competition (INRC-2010), the model can basically describe the rostering situation in the real situation and can be extended to a certain extent , referred to as the INRC model here. Under normal circumstances, a nurse schedule can be regarded as a two-dimensional table. The rows of the table are for different nurses, and the columns are for different times. The contents of the table are filled with the name of a nurse's work at a certain time. The job title refers to the type of shift the nurse works. Job names used in the INRC model include: mo...
Embodiment 2
[0100] Based on the method described in Embodiment 1, the present invention also provides a nurse shift scheduling device based on a random variable neighborhood search algorithm, including:
[0101] The objective function establishment module is used to set the constraint conditions that nurses need to meet in order to establish the objective function;
[0102] The initial solution generation module is used to generate a random initial solution and use it as the current solution and the historical optimal solution;
[0103] The optimal solution search module is used to iteratively search the current optimal solution by using the random variable neighborhood search algorithm, and set the iteration termination condition;
[0104] In the iterative process, a swap or move operator is randomly selected to perform operations on the temporary solution (a copy of the current solution);
[0105] When the objective function value corresponding to the temporary solution is less than or...
PUM
Login to View More Abstract
Description
Claims
Application Information
Login to View More - R&D
- Intellectual Property
- Life Sciences
- Materials
- Tech Scout
- Unparalleled Data Quality
- Higher Quality Content
- 60% Fewer Hallucinations
Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.
© 2025 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com



