In this study, we present risk-neutral and risk-averse two-stage stochastic formulations for the uncapacitated multiple allocation p-hub median problem and discuss the impact of risk-aversion on the optimal solution. Although stochastic models are useful to tackle the uncertainty in problem parameters, the solution of these models requires higher computational effort than their deterministic counterparts. Therefore, we present a scenario decomposition algorithm for the stochastic formulations. To evaluate the performance of the proposed solution algorithm, a set of computational experiments is conducted on real data sets. The results show that the proposed algorithm is very effective in finding optimal or near-optimal solutions in significantly shorter computation time than that of deterministic equivalent problems.