Memes, Self-generation and Nurse Rostering

  • Ender Özcan
Conference paper

DOI: 10.1007/978-3-540-77345-0_6

Volume 3867 of the book series Lecture Notes in Computer Science (LNCS)
Cite this paper as:
Özcan E. (2007) Memes, Self-generation and Nurse Rostering. In: Burke E.K., Rudová H. (eds) Practice and Theory of Automated Timetabling VI. PATAT 2006. Lecture Notes in Computer Science, vol 3867. Springer, Berlin, Heidelberg


This paper presents an empirical study on memetic algorithms in two parts. In the first part, the details of the memetic algorithm experiments with a set of well known benchmark functions are described. In the second part, a heuristic template is introduced for solving timetabling problems. Two adaptive heuristics that utilize a set of constraint-based hill climbers in a co-operative manner are designed based on this template. A hyper-heuristic is a mechanism used for managing a set of low-level heuristics. At each step, an appropriate heuristic is chosen and applied to a candidate solution. Both adaptive heuristics can be considered as hyper-heuristics. Memetic algorithms employing each hyper-heuristic separately as a single hill climber are experimented on a set of randomly generated nurse rostering problem instances. Moreover, the standard genetic algorithm and two self-generating multimeme memetic algorithms are compared to the proposed memetic algorithms and a previous study.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2007

Authors and Affiliations

  • Ender Özcan
    • 1
  1. 1.Yeditepe University, Department of Computer Engineering, 34755 Kadıköy/IstanbulTurkey