{'fraction_non_alphanumeric': 0.014669926650366748, 'fraction_numerical': 0.0, 'mean_word_length': 5.604838709677419, '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}}
Tobacco distribution vehicle routing program and the resolving method

The problem of tobacco distribution was resolved as two phases: static delivery routing programming phase and dynamic vehicle routing daily schedule phase. The static phase was modeled as the multiple traveling salesmen problem (MTSP) with workload balance. A hybrid ant colony optimization algorithm (HACO) was developed for this MTSP. The proposed HACO was tested on some benchmark instances in literatures with the objective of minimizing the maximum distance traveled by each salesman, which is related with balancing the workload among salesmen. Computational results show that the HACO is competitive. One real tobacco distribution instance was resolved by proposed method which result in distribution cost reducing and efficiency improving.