{'fraction_non_alphanumeric': 0.018134715025906734, 'fraction_numerical': 0.0, 'mean_word_length': 4.863636363636363, '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}}
The assignment problem with fuzzy weights

In this work, we present an algorithm for the assignment problem with fuzzy weights. We use the possibility theory to determine the possibility degree of a solution being optimal. Since this is a NP-hard problem, we develop a genetic algorithm based on the problem's characteristics to find an approximate solution in a reduced computing time.