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

Fuzzy multi-objective linear programming for a stochastic hub maximal covering problem with uncertain shipments

Author

Listed:
  • Amir Ebrahimi Zade
  • Ahmad Sadegheih
  • Mohammad Mehdi Lotfi

Abstract

When there are many origins and destinations in a network, the use of hubs helps to benefit from the economies of scale in transportation and considerable reduction in the number of required links. We propose a bi-objective mathematical model for a stochastic hub maximal covering problem formulated under two real-world assumptions. In many networks, there are some risks for the shipments among the nodes. In order to consider such risks, a second objective, in addition to maximising the utility of covered nodes, is aimed at maximising the safety of weakest path in the network. Also, similar to the real world situation, it is assumed that the transport times are normal random variables. An efficient nonlinear mixed-integer model is developed and after linearising, a fuzzy multi-objective linear programming method is applied to solve it. Notably, the single objective version of our model has smaller number of variables and equations than the previous ones. The computational results by establishing 24 test problems extracted from the Turkish dataset confirm: 1) the validity of proposed formulations for single objective hub maximal covering problem; 2) the satisfying performance of proposed bi-objective model in improving the safety of designed network.

Suggested Citation

  • Amir Ebrahimi Zade & Ahmad Sadegheih & Mohammad Mehdi Lotfi, 2016. "Fuzzy multi-objective linear programming for a stochastic hub maximal covering problem with uncertain shipments," International Journal of Industrial and Systems Engineering, Inderscience Enterprises Ltd, vol. 23(4), pages 482-499.
    • Handle: RePEc:ids:ijisen:v:23:y:2016:i:4:p:482-499
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=77699
    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:23:y:2016:i:4:p:482-499. 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.