Stochastic p-robust uncapacitated multiple allocation p-hub location problem Online publication date: Fri, 27-Dec-2013
by Ragheb Rahmaniani; Abdolsalam Ghaderi; Naman Mahmoudi; Farnaz Barzinepour
International Journal of Industrial and Systems Engineering (IJISE), Vol. 14, No. 3, 2013
Abstract: In this paper, we are aimed to tackle the uncapacitated multiple allocation p-hub location problem under an 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.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Industrial and Systems Engineering (IJISE):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook