In this paper, we are aimed to tackle the uncapacitated multiple allocation p-hub location problem under uncertain environment. We develop the mathematical formulation of the considered problem with uncertainty in flows and distances parameters. These uncertain parameters are characterised by a given number of scenarios. The objective function of this problem minimises the expected costs, while relative regret in each scenario must be no greater than an arbitrary value known as the robustness coefficient p≥ (0) . This kind of modelling is known as the stochastic p-robust programming model. Meanwhile, based on the variable neighbourhood search, a heuristic is proposed to solve the problem. This heuristic is tested through the Civil Aeronautics Board (CAB) data sets and the results are then compared with the CPLEX solver. Computational results from all 60 instances from CAB data set show that the algorithm is much more reliable and efficient.
