| Abstract: |  The topic of this bachelor’s thesis is the nurse rostering problem (NRP), which is a well known NP-hard problem. An integral part of this thesis is a survey of the rostering problem and its representation. The main goal is to design and implement an iterative algorithm, applying evolutionary and other meta-heuristics for solving instances of NRP. The commonly used solving procedures are introduced and compared with the proposed one. Proposed solution is inspired by heuristics such as Lin-Kernighan heuristic or variable depth search (VDS). Designed algorithm is tested on benchmark instances and compared with best known solutions. On some instances, solutions equal to the best known ones were found.
|
|---|