IDEAS home Printed from https://ideas.repec.org/a/spr/orspec/v45y2023i4d10.1007_s00291-023-00726-y.html
   My bibliography  Save this article

A distributionally robust chance-constrained model for humanitarian relief network design

Author

Listed:
  • Zhenlong Jiang

    (George Mason University)

  • Ran Ji

    (George Mason University)

  • Zhijie Sasha Dong

    (University of Houston)

Abstract

We propose a novel two-stage distributionally robust joint chance-constrained (DRJCC) model to design a resilient humanitarian relief network with uncertainties in demand and unit allocation cost of relief items in the post-disaster environment. This model determines the locations of the supply facilities with pre-positioning inventory levels and the transportation plans. We investigate the problem under two types of ambiguity sets: moment-based ambiguity and Wasserstein ambiguity. For moment-based ambiguity, we reformulate the problem into a mixed-integer conic program and solve it via a sequential optimization procedure by optimizing scaling parameters iteratively. For Wasserstein ambiguity, we reformulate the problem into a mixed-integer linear program. We conduct comprehensive numerical experiments to assess the computational efficiency of the proposed reformulation and algorithmic framework, and evaluate the reliability of the generated network by the proposed model. Through a case study in the Gulf Coast area, we demonstrate that the DRJCC model under Wasserstein ambiguity achieves a better trade-off between cost and network reliability in out-of-sample tests than the moment-based DRJCC model and the classical stochastic programming model.

Suggested Citation

  • Zhenlong Jiang & Ran Ji & Zhijie Sasha Dong, 2023. "A distributionally robust chance-constrained model for humanitarian relief network design," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 45(4), pages 1153-1195, December.
  • Handle: RePEc:spr:orspec:v:45:y:2023:i:4:d:10.1007_s00291-023-00726-y
    DOI: 10.1007/s00291-023-00726-y
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s00291-023-00726-y
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.

    File URL: https://libkey.io/10.1007/s00291-023-00726-y?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.

    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:spr:orspec:v:45:y:2023:i:4:d:10.1007_s00291-023-00726-y. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.