{'fraction_non_alphanumeric': 0.01705237515225335, 'fraction_numerical': 0.0, 'mean_word_length': 5.682926829268292, '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}}
Connected distribution center location problem under traffic network in emergency management

Distribution centers, as place of reserving, distributing and transiting relief goods, play an important role in emergency management. Location of distribution center is important to improve the efficiency of the emergency response. In this paper, we consider the Connected Distribution Center Location Problem (ConDCL), which aims to minimize the total transportation cost or time between each pair of the selected distribution centers that must satisfy the coverage request of each demand city. For solving this problem, we formulated a mathematic model and proposed a genetic algorithm. Computational results show that this proposed algorithm is efficient. This research may help emergency managers to make robust decisions.