IDEAS home Printed from https://ideas.repec.org/a/eee/soceps/v96y2024ics0038012124002933.html
   My bibliography  Save this article

Multi-period emergency facility location-routing problems under uncertainty and risk aversion

Author

Listed:
  • Hu, Qing-Mi
  • Hu, Yan
  • Li, Xiaoping

Abstract

This paper addresses a multi-period emergency facility location-routing problem, in which the uncertainties in material demands and transportation time, as well as dynamic inventory replenishment and carryover are incorporated in the design of multi-level emergency logistics networks. To measure the risks stemming from uncertain transportation time, mean-CVaR method is used. Then, a risk-averse stochastic programming model for the presented problem is formulated to minimize the total rescue time of the network. Moreover, a genetic algorithm is developed to solve the proposed model. Extensive numerical experiments including the randomly generated instances and a case study on the Wenchuan earthquake in China are conducted to verify the effectiveness of the presented model and algorithm. Experimental results show that the genetic algorithm significantly performs better than the Gurobi solver in terms of both solution quality and solution time.

Suggested Citation

  • Hu, Qing-Mi & Hu, Yan & Li, Xiaoping, 2024. "Multi-period emergency facility location-routing problems under uncertainty and risk aversion," Socio-Economic Planning Sciences, Elsevier, vol. 96(C).
    • Handle: RePEc:eee:soceps:v:96:y:2024:i:c:s0038012124002933
    DOI: 10.1016/j.seps.2024.102093
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0038012124002933
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.seps.2024.102093?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:eee:soceps:v:96:y:2024:i:c:s0038012124002933. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/seps .

    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.