Stochastic inventory-routing problem with lateral transshipment for perishable product

作     者：Fattahi, Parviz Tanhatalab, Mehdi 

作者机构：Alzahra Univ Dept Ind Engn Tehran Iran Bu Ali Sina Univ Dept Ind Engn Hamadan Hamadan Iran 

出 版 物：《JOURNAL OF MODELLING IN MANAGEMENT》 (管理模型杂志)

年 卷 期：2022年第17卷第2期

页      面：539-568页

学科分类：12[管理学] 120202[管理学-企业管理（含：财务管理、市场营销、人力资源管理）] 0202[经济学-应用经济学] 02[经济学] 1202[管理学-工商管理] 1201[管理学-管理科学与工程(可授管理学、工学学位)] 

主　　题：Optimization Inventory management Mathematical programming Inventory routing problem IRP Lagrangian relaxation Transshipment Chance-constrained programming 

摘      要：Purpose This study aims to design a supply chain network in an uncertain environment while exists two options for distribution of the perishable product and production lot-sizing is concerned. Design/methodology/approach Owing to the complexity of the mathematical model, a solution approach based on a Lagrangian relaxation (LR) heuristic is developed which provides good-quality upper and lower bounds. Findings The model output is discussed through various examples. The introduction of some enhancements and using some heuristics results in better outputs in the solution procedure. Practical implications This paper covers the modeling of some real-world problems in which demand is uncertain and managers face making some concurrent decisions related to supply chain management, transportation and logistics and inventory control issues. Furthermore, considering the perishability of product in modeling makes the problem more practically significant as these days there are many supply chains handling dairy and other fresh products. Originality/value Considering uncertainty, production, transshipment and perishable product in the inventory-routing problem makes a new variant that has not yet been studied. The proposed novel solution is based on the LR approach that is enhanced by some heuristics and some valid inequalities that make it different from the current version of the LR used by other studies.