{'fraction_non_alphanumeric': 0.018912529550827423, 'fraction_numerical': 0.0, 'mean_word_length': 5.32089552238806, '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}}
Multi-depots distribution problem study based on rich network road model

The multi-depots distribution logistic is a particular combination of transportation and routing problems, in which items that have to be loaded into different customers within vehicles, and then delivered with minimum cost. In this paper, a model is built firstly and the weights between the target nodes are acquired based on actual network road by branch-and-cut and Dijkstra algorithms; Next, the idea of the evolutionary tree classification is used to solve the nonlinear cost variables in the distribution model. Extensive computational results show that the proposed algorithm are capable of solving to optimality for a large number of small-size instances, and consistently outperform previous algorithms from the literature on large-size and real-world instances.