{'fraction_non_alphanumeric': 0.0234375, 'fraction_numerical': 0.0, 'mean_word_length': 5.355371900826446, '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 dynamic vehicle routing problem for medical supplies in large-scale emergencies

In this paper, we propose a mathematical model for a dynamic vehicle routing problem (VRP) with stochastic demands and real-time vehicle control for large-scale emergencies. The problem involves multiple vehicles with various capacities and instantaneous variations of service requests in demand nodes. Both dispatched (serving in a route) and undispatched (in depot) vehicles are considered in the problem. And the adjustments of planned routes arising from demand nodes and service requests are also considered. Then, we propose a hybrid solution algorithm based on C-W saving and tabu search algorithms. Experiments demonstrate the effectiveness of the proposed model and algorithm.