{'fraction_non_alphanumeric': 0.01741654571843251, 'fraction_numerical': 0.0, 'mean_word_length': 4.702479338842975, '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}}
A Real Case of Routing Design for Less-Than-Truckload Motor Carriers Using Genetic Algorithm

How to minimize costs while maintaining a certain level of service is the main concern for most less-than-truckload motor carriers. Hence it is needed to consolidate flows of small shipments and to determine all routes for a fleet of vehicles. In this paper, we proposed a model to describe the routing problem of a real LTL carrier to minimize the long-haul cost with constraints of service time, capacities of different vehicles and management rules. And this paper solved this problem with genetic algorithm and gave the final results using real data of a company in Shandong province, China.