{'fraction_non_alphanumeric': 0.0162748643761302, 'fraction_numerical': 0.0, 'mean_word_length': 4.8936170212765955, '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}}
An Efficiently Novel Model for Vehicle Routing Problems with Stochastic Demands

In this paper, the Vehicle Routing Problem with Stochastic Demands (VRPSD) is considered where customer demands are normally distributed. We propose a new model for computing the expected length of a tour. Monte Carlo simulation is used to demonstrate the accuracy of the model on randomly generated test problems. It is assumed that the service policy is non-divisible, meaning that the entire demand at each customer must be served in a single visit by a unique vehicle.