{'fraction_non_alphanumeric': 0.016272189349112426, 'fraction_numerical': 0.0, 'mean_word_length': 5.637254901960785, '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 Multiobjective Bilevel Transportation-Distribution Planning Problem by Modified NSGA II

Transportation-distribution planning problems have been one of the important topics in management science. This paper studies a bilevel multiobjective transportation-distribution planning nodel in which the distributing company has two objectives and the manufacturing company has one objective. For the proposed model, we present a hybrid algorithm to solve this problem, the algorithm uses the controlled elitism and the dynamic crowding distance to improve the NSGA-II, and thus a modified NSGA II is given. A practical problem is presented to validate the proposed algorithm.