شماره ركورد كنفرانس
4191
عنوان مقاله
A robust possibilistic programming approach to blood inventory-routing problem
پديدآورندگان
Kazemi Seyed Mahmood mrabani@ut.ac.ir School of Industrial Engineering, College of Engineering, University of Tehran, Tehran, Iran , Rabbani Masoud School of Industrial Engineering, College of Engineering, University of Tehran, Tehran, Iran , Tavakkoli Moghaddam Reza School of Industrial Engineering, College of Engineering, University of Tehran, Tehran, Iran
تعداد صفحه
13
كليدواژه
Blood inventory , routing , Perishable products , Robust possibilistic programming , Branch , and , cut algorithm
سال انتشار
1394
عنوان كنفرانس
دوازدهمين كنفرانس بين المللي مهندسي صنايع
زبان مدرك
انگليسي
چكيده فارسي
In this paper, a blood inventory-routing problem is formally described and its important features are discussed. Afterwards, theproblem is formulated using a mixed integer linear programming (MILP) formulation. Then, to handle the inherent uncertainties, anovel robust possibilistic programming (RPP) approach is proposed. To solve the proposed MILP formulation exactly, a novelbranch-and-cut (B C) is also developed and delineated in detail. Finally, by implementing a test scenario on the data inspired froma real Iranian blood supply chain, the significance and applicability of the proposed model and RPP approach is proven.
كشور
ايران
لينک به اين مدرک