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

Active Publication Date: 2017-12-08
SHANDONG NORMAL UNIV
View PDF3 Cites 12 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

The former can find a definite optimal solution but takes a long time,

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Nurse scheduling method and device based on random variable neighborhood search algorithm
  • Nurse scheduling method and device based on random variable neighborhood search algorithm
  • Nurse scheduling method and device based on random variable neighborhood search algorithm

Examples

Experimental program
Comparison scheme
Effect test

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 ...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

PUM

No PUM Login to view more

Abstract

The invention discloses a nurse scheduling method based on a random variable neighborhood search algorithm. The method comprises the steps that a constraint condition needing to be met by nurse scheduling is set, and an objective function is established; a random initial solution is generated and used as a current solution and a historical optimal solution; the random variable neighborhood search algorithm is adopted to perform iterative search on a current optimal solution, and an iteration termination condition is set; in the iteration process, a random selection exchange operator or a mobile operation operator is used to execute operation on a temporary solution; when an objective function value corresponding to the temporary search solution is smaller than or equal to an objective function value corresponding to the current solution, the temporary search solution is used as a new current solution; and conversely, if the number of iterations meets a determined threshold value, the historical optimal solution is set to be the current solution, and a disturbance operation operator is executed to obtain a new current solution. By the adoption of the technical scheme, nurses can be scheduled quickly and efficiently.

Description

technical field [0001] The invention relates to the field of personnel scheduling, in particular to a nurse scheduling method and device based on a random variable neighborhood search algorithm. Background technique [0002] The problem of multi-constraint personnel scheduling in hospital departments has always been a challenging task. Establishing a nurse schedule should not only consider the workload in the department, but also consider factors such as the technical level and needs of the nurses themselves. It is very time-consuming to perform manual scheduling, and there are still many departments in hospitals that manually schedule nurses. [0003] It is a complex and difficult discrete optimization problem to establish a shift schedule by using software. Over the past few decades, many algorithms have been researched. Algorithms to solve nurse scheduling can be classified into two categories: deterministic algorithms based on integer programming and heuristic search ...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

Application Information

Patent Timeline
no application Login to view more
IPC IPC(8): G06F19/00
Inventor 郑自然
Owner SHANDONG NORMAL UNIV
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products