A survey on stochastic location and routing problems (Q1611506)

This paper is what the title says it is: a survey on stochastic location and routing problems. The focus is on mathematical programming models for settings where customer demands are random parameters, and the arrival time of the demand is known. The paper starts with a good, thorough description of how' to deal with uncertainty in mathematical models in general. Next, stochastic linear programming, including, wait-and-see models, chance-constrained models, and stochastic linear programs with recourse is treated in depth. Further, properties of stochastic integer programming and optimisation methods (\(L\)-shaped method, branch-and-bound method, pseudo-Boolean method, Gröbner bases method, and dynamic programming) are discussed. Then, methods from literature for three stochastic versions of the discrete facility location problem are described extensively; also, methods from literature for a stochastic version of the \(p\)-median problem are discussed. Next, a summary of contributions from the literature for the transportation problem with stochastic demand is given. A separate section is devoted to stochastic vehicle routing problems, Two cases are discussed: one where the presence of a customer is random, and another one where customer-demand is random, and a vehicle might not have sufficient capacity. Finally, the stochastic inventory routing problem, and the stochastic location-routing problem is treated. The final section addresses the main issues of the subject. This well-written paper closes with a list of 259 references.