{'fraction_non_alphanumeric': 0.011021307861866276, 'fraction_numerical': 0.0, 'mean_word_length': 4.9475982532751095, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Solving the Nurse Rostering Problem Knowledge Representation and Reasoning Seminar

Nurse rostering is a complex problem which affects the everyday activities and health care tasks in modern hospitals. The Nurse Rostering Problem is a subclass of the personnel scheduling problems, and most of its instances are NP-hard. The goal is to find a quality assignment of shift categories to available nurses. Even though solving the Nurse Rostering Problem has been a field of interest of many research areas during many years, still the task of creating a schedule for the nurses is usually done manually. Many attempts to create an efficient algorithm for producing optimal schedules for all the available nurses in a real world hospital have been made by researchers from different areas. These attempts employ different methods in solving the Nurse Rostering Problem. Some of them combine several methods in order to obtain a hybrid one. In the following, we describe a hybrid approach for solving a real world Nurse Rostering Problem. This method makes use of Constraint Programming and Variable Neighborhood Descent in an Iterated Local Search framework. Its development has been based on the health care regulations which can be found in Norwegian hospitals. This approach has shown good test results in obtaining a feasible solution in a short amount of time.