Stochastic vehicle routing problem with restocking

Stochastic vehicle routing problem with restocking

0.00 Avg rating0 Votes
Article ID: iaor2001889
Country: United States
Volume: 34
Issue: 1
Start Page Number: 99
End Page Number: 112
Publication Date: Feb 2000
Journal: Transportation Science
Authors: , ,
Keywords: vehicle routing & scheduling
Abstract:

In this paper, a stochastic vehicle routing problem is considered. In particular, customer demand is assumed to be uncertain, and actual demand is revealed only upon the visit to the customer. Instead of adopting the simple recourse action of returning to the depot whenever the vehicle runs out of stock, the points along the route at which restocking is to occur are designed into the route. The restocking points may be before a stockout actually occurs. Two heuristic algorithms are developed to construct both single and multiple routes that minimize total travel cost. The computational results show that the heuristic procedures produce quality solutions and are efficient.

Reviews

Required fields are marked *. Your email address will not be published.