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 the problem of long time consumption, achieve the effect of high efficiency and simplify the scheduling algorithm
- 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 scheduling method based on 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 in scheduling, and obtain the objective function f(x) according to the constraints;
[0044] The present invention adopts the model and data set used in the First International Nurse Rostering Competition (INRC-2010). The model can basically describe the real situation of scheduling and can be expanded to a certain extent. , here referred to as the INRC model. In general, a nurse schedule can be regarded as a two-dimensional table. The rows of the table are different nurses, and the columns are different times. The content in the form is filled with the job name of a certain nurse at a certain time. The job title refers to the type of shift the nurse works on. Job titles used in the INRC model include: morning shift (E), evening shift (L), night...
Embodiment 2
[0100] Based on the method described in Embodiment 1, the present invention also provides a nurse scheduling device based on a random neighborhood search algorithm, comprising:
[0101] The objective function building module is used to set the constraints that nurses need to meet in scheduling and 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 using the random variable neighborhood search algorithm, and set the iteration termination condition;
[0104] In the iterative process, randomly select an exchange or move operator to perform an operation 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 equal to the objective ...
PUM
Abstract
Description
Claims
Application Information
- R&D Engineer
- R&D Manager
- IP Professional
- Industry Leading Data Capabilities
- Powerful AI technology
- Patent DNA Extraction
Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.
© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com