Abstract
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 necessary 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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
