IDEAS home Printed from https://ideas.repec.org/a/taf/tjorxx/v76y2025i5p935-950.html
   My bibliography  Save this article

Greedy randomized adaptive search procedure for supply chain network resilience optimization considering risk diffusion

Author

Listed:
  • Hyun-Woong Jin
  • Hector A. Vergara

Abstract

Supply disruption risks occurring at individual nodes in a supply chain network can propagate to other nodes through the links in the network affecting the overall performance of the supply chain. In this context, mitigation strategies are commonly implemented to respond to these disruptions and improve the resilience of the supply chain. This study proposes a mathematical model to optimize the resilience of the supply chain network by selecting critical nodes and identifying the appropriate type of mitigation strategies to be implemented under a limited budget. The resilience of the supply chain network is evaluated by the degree of propagation of risks from individual nodes to the entire supply chain network, using a risk diffusion model where a disruption risk decreases exponentially as it progresses downstream in the supply chain. A greedy randomized adaptive search procedure (GRASP)-based solution approach was developed to solve the proposed formulation and its performance was compared to other solution procedures for different scenarios showing it to be the most effective and robust. A summary of the insights developed from the solutions obtained for the different scenarios is presented along with directions for future research.

Suggested Citation

  • Hyun-Woong Jin & Hector A. Vergara, 2025. "Greedy randomized adaptive search procedure for supply chain network resilience optimization considering risk diffusion," Journal of the Operational Research Society, Taylor & Francis Journals, vol. 76(5), pages 935-950, May.
    • Handle: RePEc:taf:tjorxx:v:76:y:2025:i:5:p:935-950
    DOI: 10.1080/01605682.2024.2406228
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/01605682.2024.2406228
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/01605682.2024.2406228?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

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

    More about this item

    Statistics

    Access and download statistics

    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:taf:tjorxx:v:76:y:2025:i:5:p:935-950. 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: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/tjor .

    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.