Genetic algorithm with the constraints for nurse scheduling problem

Abstract

The Nurse Scheduling Problem (NSP) is a problem of allocating shifts (day and night shifts, holidays, and so on) for nurses under various constraints. Generally, NSP has a lot of constraints. As a result, it needs a lot of knowledge and experience to construct the scheduling table with its constraints, and it is usually done by the head nurse or the authority in hospitals. Some research on NSP using genetic algorithms (GA) is reported. Conventional methods take the constraints into the fitness function. However, if it reduces the fitness value a lot to the parts of solution against the constraints, it causes useless search, because most of the chromosomes are selected in the initial population or in the change by the genetic operations. If it doesn't reduce the fitness value so much, the final solution has some parts against the constraints. Some of them are established by the Labor Standards Act or the Labor Union Act, so the solution has to be modified. As a result, it is difficult to acquire an effective scheduling table automatically. The paper studies the method of coding and genetic operations with their constraints for NSP. The exchange of shifts is done to satisfy the constraints in the coding and after the genetic operations. We apply this method to NSP using actual shifts and constraints being used in a hospital. It shows that an effective scheduling table satisfying the constraints is acquired by this method.

Cite this work

No public copy is stored for this record, so only the metadata is cited.

Stored only when both papers are in the corpus — 56 citations exist upstream.

Papers that cite the same references — the relational fallback while embeddings are still backfilling.