Vehicle Routing Problem with Time Windows and Stochastic Travel Times: The real-world environment is defined by probabilistic data, as is the travel time between two customers. Thus, models that consider environmental uncertainty are the most appropriate. In this context, the present work develops a strategy to solve the VRP with time windows in which the travel time among the customers is known only probabilistically. This problem is known as the Stochastic Vehicle Routing Problem with Time Windows (SVRPTW). This problem combines stochastic travel times with VRP with time windows (VRPTW). Pack of instances: Click here to download