Applying Minimum-Risk Criterion to Stochastic Hub Location Problems

Abstract

This paper presents a new class of two-stage stochastic hub location (HL) programming problems with minimum-risk criterion, in which uncertain demands are characterized by random vector. Meanwhile we demonstrate that the twostage programming problem is equivalent to a single-stage stochastic P-model. Under mild assumptions, we develop a deterministic binary programming problem by using standardization, which is equivalent to a binary fractional programming problem. Moreover, we show that the relaxation problem of the binary fractional programming problem is a convex programming problem. Taking advantage of branch-and-bound method, we provide a number of experiments to illustrate the efficiency of the proposed modeling idea.