{'fraction_non_alphanumeric': 0.024495677233429394, 'fraction_numerical': 0.0, 'mean_word_length': 4.791666666666667, '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}}
An efficient encoding scheme for a new multiple-type museum visitor routing problem with must-see and select-see exhibition rooms

We present a new multiple-type museum visitor routing problem (MT-MVRP) in which a museum’s exhibition rooms are classified into must-see and select-see rooms. A novel encoding scheme is proposed to simultaneously determine the scheduling of rooms for all of the groups and an immune based evolutionary algorithm is developed to solve the MT-MVRP. Additionally, the lower bound of the makespan for the MT-MVRP is derived. The numerical results of the immune based algorithm on three museums in Taiwan are discussed and compared with those by the other approaches.