Prolog-based system for nursing staff scheduling implemented on a personal computer
Computers and Biomedical Research
Computers and Biomedical Research
Employee Timetabling, Constraint Networks and Knowledge-Based Rules: A Mixed Approach
Selected papers from the First International Conference on Practice and Theory of Automated Timetabling
Extensions to a Memetic Timetabling System
Selected papers from the First International Conference on Practice and Theory of Automated Timetabling
Selected Papers from AISB Workshop on Evolutionary Computing
Selected Papers from AISB Workshop on Evolutionary Computing
Initialization strategies and diversity in evolutionary timetabling
Evolutionary Computation
A multistage evolutionary algorithm for the timetable problem
IEEE Transactions on Evolutionary Computation
A Hyperheuristic Approach to Scheduling a Sales Summit
PATAT '00 Selected papers from the Third International Conference on Practice and Theory of Automated Timetabling III
A Tabu-Search Hyperheuristic for Timetabling and Rostering
Journal of Heuristics
Variable neighborhood search for nurse rostering problems
Metaheuristics
The State of the Art of Nurse Rostering
Journal of Scheduling
A data-integrated nurse activity simulation model
Proceedings of the 38th conference on Winter simulation
An electromagnetic meta-heuristic for the nurse scheduling problem
Journal of Heuristics
Stochastic programming for nurse assignment
Computational Optimization and Applications
Non-genetic transmission of memes by diffusion
Proceedings of the 10th annual conference on Genetic and evolutionary computation
A hybrid metaheuristic case-based reasoning system for nurse rostering
Journal of Scheduling
Adaptive cellular memetic algorithms
Evolutionary Computation
A grasp-knapsack hybrid for a nurse-scheduling problem
Journal of Heuristics
Towards the decathlon challenge of search heuristics
Proceedings of the 11th Annual Conference Companion on Genetic and Evolutionary Computation Conference: Late Breaking Papers
INFORMS Journal on Computing
Evolution and incremental learning in the iterated prisoner's dilemma
IEEE Transactions on Evolutionary Computation
An evolutionary squeaky wheel optimization approach to personnel scheduling
IEEE Transactions on Evolutionary Computation
Memes, self-generation and nurse rostering
PATAT'06 Proceedings of the 6th international conference on Practice and theory of automated timetabling VI
A shift sequence based approach for nurse scheduling and a new benchmark dataset
Journal of Heuristics
A hybrid evolutionary approach to the nurse Rostering problem
IEEE Transactions on Evolutionary Computation
Long-term staff scheduling with regular temporal distribution
Computer Methods and Programs in Biomedicine
An evolutionary approach for the nurse rerostering problem
Computers and Operations Research
A categorisation of nurse rostering problems
Journal of Scheduling
Adaptive iterated local search for cross-domain optimisation
Proceedings of the 13th annual conference on Genetic and evolutionary computation
Memetic algorithms for nurse rostering
ISCIS'05 Proceedings of the 20th international conference on Computer and Information Sciences
Semantic components for timetabling
PATAT'04 Proceedings of the 5th international conference on Practice and Theory of Automated Timetabling
Nurse rostering using modified harmony search algorithm
SEMCCO'11 Proceedings of the Second international conference on Swarm, Evolutionary, and Memetic Computing - Volume Part II
Periodic Mutation Operator for Nurse Scheduling by Using Cooperative GA
International Journal of Applied Evolutionary Computation
Cyclic staff scheduling: optimization models for some real-life problems
Journal of Scheduling
A Time Predefined Variable Depth Search for Nurse Rostering
INFORMS Journal on Computing
Hi-index | 0.00 |
Constructing timetables of work for personnel in healthcare institutions is known to be a highly constrained and difficult problem to solve. In this paper, we discuss a commercial system, together with the model it uses, for this rostering problem. We show that tabu search heuristics can be made effective, particularly for obtaining reasonably good solutions quickly for smaller rostering problems. We discuss the robustness issues, which arise in practice, for tabu search heuristics. This paper introduces a range of new memetic approaches for the problem, which use a steepest descent improvement heuristic within a genetic algorithm framework. We provide empirical evidence to demonstrate the best features of a memetic algorithm for the rostering problem, particularly the nature of an effective recombination operator, and show that these memetic approaches can handle initialisation parameters and a range of instances more robustly than tabu search algorithms, at the expense of longer solution times. Having presented tabu search and memetic approaches (both with benefits and drawbacks) we finally present an algorithm that is a hybrid of both approaches. This technique produces better solutions than either of the earlier approaches and it is relatively unaffected by initialisation and parameter changes, combining some of the best features of each approach to create a hybrid which is greater than the sum of its component algorithms.