{'fraction_non_alphanumeric': 0.014112903225806451, 'fraction_numerical': 0.0, 'mean_word_length': 5.0920245398773005, '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 generalized vehicle routing problem by parallel universes and Tabu search

Vehicle routing problem (VRP) is one of the most important transportation problems in such a way that most of the transportation problems are changeable to it. This problem can be considerably effective in transportation and the costs arising from it. The VRP with some constraints and limitations become closer to the actual world. The generalized problem of VRP is in a state that should select agents among the customers so that the problem to be solved in a more generalized form. In this paper, we have tried to improve the answers on generalized vehicle routing transportation problems (GVRP) and obtain a better result in implementation, using the combination of parallel universes' algorithms in addition to the Tabu search. Our results indicate that our method has been productive successful and we have achieved better answers compared to the similar algorithms presented until now, in this context.