M. Bashiri - Shahed Univ. - Department of Industrial Engineering-
S. Mehrabi - Shahed Univ. - Department of Industrial Engineering-

In this paper, we present a stochastic version of the p-hub covering problem (we call it SpHCP) that optimizes location of hubs and allocation decisions. The goal of our model is to maximize the minimum service-level that can achieved for a given maximum path length (delivery time on the path). We have formulated this problem using the chance constraints with a linear structure and finally numerical examples are solved for more illustration.

Location, hub-spoke network, service level, delivery time, covering