IDEAS home Printed from https://ideas.repec.org/a/ids/eujine/v11y2017i4p425-468.html
   My bibliography  Save this article

A two-phase heuristic algorithm for designing reliable capacitated logistics networks under disruptions

Author

Listed:
  • Davood Shishebori
  • Mehdi Karimi-Nasab
  • Lawrence V. Snyder

Abstract

This paper considers the reliable capacitated logistics network design problem (RCLNDP) with system disruptions, which is concerned with locating facilities, constructing transportation links, and allocating their capacities to customers in order to satisfy the demand with minimum expected total cost. Both the facilities and the transportation links are subject to random disruptions, and the expected total cost accounts for the costs of facility location, link construction, and flows in both normal and disrupted conditions. We model this problem as a two-stage stochastic program in which the decision maker establishes plans for facility location and link construction in the first stage (before disruptions are realised) and may choose link flows in the second stage. This is a large-scale mixed-integer optimisation problem and is therefore difficult to solve. Hence, we propose an efficient two-phase heuristic with three possible initial solution-generation methods. [Received 1 November 2015; Revised 3 March 2016; Revised 22 May 2016; Revised 8 June 2016; Accepted 10 June 2016]

Suggested Citation

  • Davood Shishebori & Mehdi Karimi-Nasab & Lawrence V. Snyder, 2017. "A two-phase heuristic algorithm for designing reliable capacitated logistics networks under disruptions," European Journal of Industrial Engineering, Inderscience Enterprises Ltd, vol. 11(4), pages 425-468.
    • Handle: RePEc:ids:eujine:v:11:y:2017:i:4:p:425-468
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=86178
    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.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Bhuiyan, Tanveer Hossain & Medal, Hugh R. & Harun, Sarah, 2020. "A stochastic programming model with endogenous and exogenous uncertainty for reliable network design under random disruption," European Journal of Operational Research, Elsevier, vol. 285(2), pages 670-694.
    2. Aldrighetti, Riccardo & Battini, Daria & Ivanov, Dmitry & Zennaro, Ilenia, 2021. "Costs of resilience and disruptions in supply chain network design models: A review and future research directions," International Journal of Production Economics, Elsevier, vol. 235(C).

    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:eujine:v:11:y:2017:i:4:p:425-468. 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=210 .

    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.