Production, Replenishment and Inventory Policies for Perishable Products in a Two-Echelon Distribution Network

Mingyuan Wei, Hao Guan, Yunhan Liu, Benhe Gao and Canrong Zhang
Additional contact information
Mingyuan Wei: Department of Industrial Engineering, Tsinghua University, Beijing 100084, China
Hao Guan: Research Center for Modern Logistics, Shenzhen International Graduate School, Tsinghua University, Shenzhen 518055, China
Yunhan Liu: Research Center for Modern Logistics, Shenzhen International Graduate School, Tsinghua University, Shenzhen 518055, China
Benhe Gao: Research Center for Modern Logistics, Shenzhen International Graduate School, Tsinghua University, Shenzhen 518055, China
Canrong Zhang: Research Center for Modern Logistics, Shenzhen International Graduate School, Tsinghua University, Shenzhen 518055, China

Sustainability, 2020, vol. 12, issue 11, 1-26

Abstract: The research on production, delivery and inventory strategies for perishable products in a two-echelon distribution network integrates the production routing problem (PRP) and two-echelon vehicle routing problem (2E-VRP), which mainly considers the inventory and delivery sustainability of perishable products. The problem investigated in this study is an extension of the basic problems, and it simultaneously optimizes production, replenishment, inventory, and routing decisions for perishable products that will deteriorate over the planning horizon. Additionally, the lead time has been considered in the replenishment echelon, and the unit inventory cost varying with the inventory time is considered in the inventory management. Based on a newly designed model, different inventory strategies are discussed in this study: old first (OF) and fresh first (FF) strategies both for the first echelon and second echelon, for which four propositions to model them are proposed. Then, four valid inequalities, including logical inequalities, a ( ? , S , W W ) inequality, and a replenishment-related inequality, are proposed to construct a branch-and-cut algorithm. The computational experiments are conducted to test the efficiency of valid inequalities, branch-and-cut, and policies. Experimental results show that the valid inequalities can effectively increase the relaxed lower bound by 4.80% on average and the branch-and-cut algorithm can significantly reduce the computational time by 58.18% on average when compared to CPLEX in small and medium-sized cases. For the selection of strategy combinations, OF–FF is suggested to be used in priority.

Keywords: production routing problem; two-echelon vehicle routing problem; inventory policies; branch-and-cut algorithm (search for similar items in EconPapers)
JEL-codes: O13 Q Q0 Q2 Q3 Q5 Q56 (search for similar items in EconPapers)
Date: 2020
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
https://www.mdpi.com/2071-1050/12/11/4735/pdf (application/pdf)
https://www.mdpi.com/2071-1050/12/11/4735/ (text/html)

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:gam:jsusta:v:12:y:2020:i:11:p:4735-:d:369543

Access Statistics for this article

Sustainability is currently edited by Ms. Alexandra Wu

More articles in Sustainability from MDPI
Bibliographic data for series maintained by MDPI Indexing Manager ().