3,589 research outputs found
A Component Based Heuristic Search Method with Evolutionary Eliminations
Nurse rostering is a complex scheduling problem that affects hospital
personnel on a daily basis all over the world. This paper presents a new
component-based approach with evolutionary eliminations, for a nurse scheduling
problem arising at a major UK hospital. The main idea behind this technique is
to decompose a schedule into its components (i.e. the allocated shift pattern
of each nurse), and then to implement two evolutionary elimination strategies
mimicking natural selection and natural mutation process on these components
respectively to iteratively deliver better schedules. The worthiness of all
components in the schedule has to be continuously demonstrated in order for
them to remain there. This demonstration employs an evaluation function which
evaluates how well each component contributes towards the final objective. Two
elimination steps are then applied: the first elimination eliminates a number
of components that are deemed not worthy to stay in the current schedule; the
second elimination may also throw out, with a low level of probability, some
worthy components. The eliminated components are replenished with new ones
using a set of constructive heuristics using local optimality criteria.
Computational results using 52 data instances demonstrate the applicability of
the proposed approach in solving real-world problems.Comment: 27 pages, 4 figure
An Optimization Technique to Prepare Nurse Schedule for a Monthly TIME Horizon
Nurse scheduling problem is one of the most difficult scheduling problems to solve since its solution space is large and it expects to comply many constraints. There is no standard model or a method of solution for nurse scheduling. The main objective of this study is to search for a scientific method to prepare a monthly working schedule for a group of nursing officers employed in a hospital. We propose an optimization method to prepare an optimal schedule. Initially, we develop an optimization model by formulating the objective and the constraints of the problem. The optimization model that we are interestedin is a 0-1 Integer Linear Programming problem. We apply the Branch-and-Bound technique to solve the problem using the optimization software package LINGO. Finally, the solution to the optimization problem is formulated to a regular nurse schedule. The methodology is illustrated by preparing a monthly schedule for a private hospital in Sri Lanka
'A Bayesian Optimisation Algorithm for the Nurse Scheduling Problem'
Abstract- A Bayesian optimization algorithm for the nurse scheduling problem is presented, which involves choosing a suitable scheduling rule from a set for each nurse's assignment. Unlike our previous work that used GAs to implement implicit learning, the learning in the proposed algorithm is explicit, i.e. eventually, we will be able to identify and mix building blocks directly. The Bayesian optimization algorithm is applied to implement such explicit learning by building a Bayesian network of the joint distribution of solutions. The conditional probability of each variable in the network is computed according to an initial set of promising solutions. Subsequently, each new instance for each variable is generated by using the corresponding conditional probabilities, until all variables have been generated, i.e. in our case, a new rule string has been obtained. Another set of rule strings will be generated in this way, some of which will replace previous strings based on fitness selection. If stopping conditions are not met, the conditional probabilities for all nodes in the Bayesian network are updated again using the current set of promising rule strings. Computational results from 52 real data instances demonstrate the success of this approach. It is also suggested that the learning mechanism in the proposed approach might be suitable for other scheduling problems
A time predefined variable depth search for nurse rostering
This paper presents a variable depth search for the nurse rostering problem. The algorithm works by chaining together single neighbourhood swaps into more effective compound moves. It achieves this by using heuristics to decide whether to continue extending a chain and which candidates to examine as the next potential link in the chain. Because end users vary in how long they are willing to wait for solutions, a particular goal of this research was to create an algorithm that accepts a user specified computational time limit and uses it effectively. When compared against previously published approaches the results show that the algorithm is very competitive
- …