Memetic algorithms for nurse rostering

Authors:
Ender Özcan
Affiliations:
Department of Computer Engineering, Yeditepe University, Kayışdağı, İstanbul, Turkey
Venue:
ISCIS'05 Proceedings of the 20th international conference on Computer and Information Sciences
Year:
2005

Citing 11
Cited 8

Genetic Algorithms in Search, Optimization and Machine Learning

Genetic Algorithms in Search, Optimization and Machine Learning
A Memetic Approach to the Nurse Rostering Problem

Applied Intelligence
Improving Evolutionary Timetabling with Delta Evaluation and Directed Mutation

PPSN III Proceedings of the International Conference on Evolutionary Computation. The Third Conference on Parallel Problem Solving from Nature: Parallel Problem Solving from Nature
Nurse Rostering at the Hospital Authority of Hong Kong

Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence
Formal Memetic Algorithms

Selected Papers from AISB Workshop on Evolutionary Computing
Fast Practical Evolutionary Timetabling

Selected Papers from AISB Workshop on Evolutionary Computing
A Hybrid Tabu Search Algorithm for the Nurse Rostering Problem

SEAL'98 Selected papers from the Second Asia-Pacific Conference on Simulated Evolution and Learning on Simulated Evolution and Learning
A hybrid AI approach for nurse rostering problem

Proceedings of the 2003 ACM symposium on Applied computing
An indirect genetic algorithm for a nurse-scheduling problem

Computers and Operations Research
Variable neighborhood search for nurse rostering problems

Metaheuristics
The State of the Art of Nurse Rostering

Journal of Scheduling

Memetic algorithms for parallel code optimization

International Journal of Parallel Programming
A comprehensive analysis of hyper-heuristics

Intelligent Data Analysis
A Component-Based Heuristic Search Method with Evolutionary Eliminations for Hospital Personnel Scheduling

INFORMS Journal on Computing
Memes, self-generation and nurse rostering

PATAT'06 Proceedings of the 6th international conference on Practice and theory of automated timetabling VI
A categorisation of nurse rostering problems

Journal of Scheduling
The Interleaved Constructive Memetic Algorithm and its application to timetabling

Computers and Operations Research
Periodic Mutation Operator for Nurse Scheduling by Using Cooperative GA

International Journal of Applied Evolutionary Computation
Cooperative search for fair nurse rosters

Expert Systems with Applications: An International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

Nurse rostering problems represent a subclass of scheduling problems that are hard to solve. The goal is finding high quality shift and resource assignments, satisfying the needs and requirements of employees as well as the employers in healthcare institutions. In this paper, a real case of a nurse rostering problem is introduced. Memetic Algorithms utilizing different type of promising genetic operators and a self adaptive violation directed hierarchical hill climbing method are presented based on a previously proposed framework.