IDEAS home Printed from https://ideas.repec.org/a/ids/ijisen/v14y2013i3p296-314.html
   My bibliography  Save this article

Stochastic p-robust uncapacitated multiple allocation p-hub location problem

Author

Listed:
  • Ragheb Rahmaniani
  • Abdolsalam Ghaderi
  • Naman Mahmoudi
  • Farnaz Barzinepour

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.

Suggested Citation

  • Ragheb Rahmaniani & Abdolsalam Ghaderi & Naman Mahmoudi & Farnaz Barzinepour, 2013. "Stochastic p-robust uncapacitated multiple allocation p-hub location problem," International Journal of Industrial and Systems Engineering, Inderscience Enterprises Ltd, vol. 14(3), pages 296-314.
    • Handle: RePEc:ids:ijisen:v:14:y:2013:i:3:p:296-314
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=54282
    Download Restriction: Access to full text is restricted to subscribers.
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:ids:ijisen:v:14:y:2013:i:3:p:296-314. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sarah Parker (email available below). General contact details of provider: http://www.inderscience.com/browse/index.php?journalID=188 .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.