{'fraction_non_alphanumeric': 0.015267175572519083, 'fraction_numerical': 0.0, 'mean_word_length': 5.431372549019608, '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}}
Hybrid genetic algorithm for bi-objective assignment problem

We propose a hybrid approach for multi-objective assignment problem which combines genetic algorithm and mathematical programming techniques. This method is based on the dominance cost variant of the multi-objective genetic algorithm hybridized with exact method. The initial population is generated by solving a series of mono-objective assignment problems obtained by a suitable choice of a set of weights. The crossover operator solves a reduced mono-objective problem where the weights are chosen to identify an unexplored region. Numerical experiments show the efficiency of our approach.