IDEAS home Printed from https://ideas.repec.org/a/taf/tprsxx/v60y2022i4p1316-1340.html
   My bibliography  Save this article

A distributionally robust optimisation model for last mile relief network under mixed transport

Author

Listed:
  • Peiyu Zhang
  • Yankui Liu
  • Guoqing Yang
  • Guoqing Zhang

Abstract

The last mile relief network is the final stage of the relief chain but the most critical stage for ensuring the timely delivery of relief supplies after a disaster. Due to the suddenness of the disaster, balancing the shortages of relief supplies and the high demands of victims is a serious problem. We introduce a mixed transport way of relief supply transportation between points of distributions and demand nodes in our problem to face the manpower and resource limitations. We establish a bi-objective distributionally robust optimisation model to balance transportation time and transportation safety, where the demand, transportation time, freight and safety coefficient are assumed to be uncertain variables with partial distribution information. We also deduce the refinement robust counterparts under the ambiguous sets to prove the safe tractable approximations of chance constraints. Finally, we conduct a case study of Tonghai county earthquake to illustrate the efficiency of our proposed distributionally robust model.

Suggested Citation

  • Peiyu Zhang & Yankui Liu & Guoqing Yang & Guoqing Zhang, 2022. "A distributionally robust optimisation model for last mile relief network under mixed transport," International Journal of Production Research, Taylor & Francis Journals, vol. 60(4), pages 1316-1340, February.
  • Handle: RePEc:taf:tprsxx:v:60:y:2022:i:4:p:1316-1340
    DOI: 10.1080/00207543.2020.1856439
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/00207543.2020.1856439
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1080/00207543.2020.1856439?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:tprsxx:v:60:y:2022:i:4:p:1316-1340. 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/TPRS20 .

    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.