In open vehicle routing problems, the vehicles are not required to return to the depot after completing service. In this paper, the problem is extended by considering the reliability of the fulfillment of customer demands. Each customer has a demand and each customer is necessarily to be served by a single vehicle and no vehicle may serve a set of customers whose total demand exceeds the vehicle capacity. Each vehicle route must start at the depot and after serving the last customer it is not

more »

... cessary for the vehicle to return to the depot. The objective is to determine the set of vehicle routes that minimizes the total costs, with chance constrained to guarantee that customers' demand is satisfied. We solve the stochastic model using sample average approximation approach.