{'fraction_non_alphanumeric': 0.020066889632107024, 'fraction_numerical': 0.0011148272017837235, 'mean_word_length': 5.368794326241135, '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}}
A study on bacterial evolutionary algorithm engine for interactive nurse scheduling support system

Nurse scheduling problem (NSP) is a combinatorial optimization problem. This paper presents an interactive nurse scheduling support system. This system learns the evaluation criteria from the past schedules, and generates new schedules using the bacterial evolutionary algorithm (BEA). The user can modify or fix parts of the candidate schedules. The system reschedules the parts that need improvement. The proposed system is needed to produce high quality schedules with a short computation time for a good human-machine interaction. This paper examines the BEA operations, and studies the hardware implementation of BEA on field programmable gate array (FPGA). Appropriate operations and parameters of BEA are clarified. A practical NSP was estimated and solved within 2 seconds by the hardware.