An Exact Solution for Joint Optimization of Inventory and Routing Decisions in Blood Supply Chains: A Case Study

Seyed Mahmood Kazemi, Masoud Rabbani (), Reza Tavakkoli-Moghaddam () and Farid Abolhassani Shahreza ()
Additional contact information
Seyed Mahmood Kazemi: School of Industrial Engineering, College of Engineering University of Tehran, Tehran, Iran
Masoud Rabbani: School of Industrial Engineering, College of Engineering University of Tehran, Tehran, Iran
Reza Tavakkoli-Moghaddam: School of Industrial Engineering, College of Engineering University of Tehran, Tehran, Iran
Farid Abolhassani Shahreza: National Institute of Health Research Tehran University of Medical Sciences

ECONOMIC COMPUTATION AND ECONOMIC CYBERNETICS STUDIES AND RESEARCH, 2017, vol. 51, issue 4, 315-333

Abstract: In this paper, blood inventory-routing problem (Blood-IRP) is for the first time introduced and its unique characteristics that distinguish the problem from traditional IRPs are discussed. The perishability of blood products, the need to use older-first policy, the necessity of establishing order-up-to level policy for safety issues, the need for minimizing blood wastages, and the existence of new concepts such as assigned and unassigned inventories, crossmatch release period and crossmatch to transfusion ratio are among the especial aspects of Blood-IRP. Afterward, a strong mixed integer linear programming (MILP) formulation for solving the Blood-IRP is proposed. Moreover, a novel iterative Branch-and-Cut (B&C) is developed to solve a real case study with 8 customers, 3 vehicles, 3 periods and a product shelf life of 2 periods to optimality. Furthermore, the shortcomings of traditional IRP models with regard to blood logistics are discussed. The blood product considered in this paper is platelet; the highest perishable blood product. The obtained results emphasize the need for conducting this study. Finally, a conclusion is provided and future research directions are discussed.

Keywords: Blood inventory-routing; Multi-vehicle IRP; perishable products; platelet; branch-and-cut algorithm. (search for similar items in EconPapers)
JEL-codes: C61 I11 (search for similar items in EconPapers)
Date: 2017
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
ftp://www.eadr.ro/RePEc/cys/ecocyb_pdf/ecocyb4_2017p315-333.pdf

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:cys:ecocyb:v:50:y:2017:i:4:p:315-333

Access Statistics for this article

ECONOMIC COMPUTATION AND ECONOMIC CYBERNETICS STUDIES AND RESEARCH is currently edited by Gheorghe RUXANDA

More articles in ECONOMIC COMPUTATION AND ECONOMIC CYBERNETICS STUDIES AND RESEARCH from Faculty of Economic Cybernetics, Statistics and Informatics Contact information at EDIRC.
Bibliographic data for series maintained by Corina Saman ().