IDEAS home Printed from https://ideas.repec.org/a/bao/ijimes/v1y2021i4p32-49id31.html
   My bibliography  Save this article

Designing and Solving Location-Routing-Allocation Problems in a Sustainable Blood Supply Chain Network of Blood Transport in Uncertainty Conditions

Author

Listed:
  • Ramin Eskandari
  • Hamid Reza Feili

Abstract

Purpose: In this paper, a location-routing-allocation problem in a multi-objective blood supply chain network was designed to reduce the total cost of the supply chain network, the maximum unmet demand from distribution of goods, and decline greenhouse gas emissions due to the transport of goods among different levels of the network. The network levels considered for modeling include blood donation clusters, permanent and temporary blood transfusion centers, major laboratory centers and blood supply points. Other objectives included determining the optimal number and location of potential facilities, optimal allocation of the flow of goods between the selected facilities and determining the most suitable transport route to distribute the goods to customer areas in uncertainty conditions. Methodology: Given that the model was NP-hard, the NSGA II and MOPSO algorithms were used to solve the model with a priority-based solution. Findings: The results of the design of the experiments showed the high efficiency of the NSGA II algorithm in comparison with the MOPSO algorithm in finding efficient solutions. Originality/Value: This study addresses the issue of blood perishability from blood sampling to distribution to customer demand areas.

Suggested Citation

  • Ramin Eskandari & Hamid Reza Feili, 2021. "Designing and Solving Location-Routing-Allocation Problems in a Sustainable Blood Supply Chain Network of Blood Transport in Uncertainty Conditions," International Journal of Innovation in Management, Economics and Social Sciences, International Scientific Network (ISNet), vol. 1(4), pages 32-49.
  • Handle: RePEc:bao:ijimes:v:1:y:2021:i:4:p:32-49:id:31
    as

    Download full text from publisher

    File URL: https://ijimes.ir/index.php/ijimes/article/view/31/44
    Download Restriction: no
    ---><---

    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:bao:ijimes:v:1:y:2021:i:4:p:32-49:id:31. 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: International Scientific Network (ISNet) (email available below). General contact details of provider: https://ijimes.ir/index.php/ijimes/ .

    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.