Modeling and solving a one-supplier multi-vehicle production-inventory-distribution problem with clustered retailers

被引:0
作者
Ahmed Senoussi
Nadia Kinza Mouss
Bernard Penz
Nadjib Brahimi
Stéphane Dauzère-Pérès
机构
[1] Université Batna 2,Laboratoire d’Automatique et Productique, Département de Génie Industriel
[2] University of Grenoble Alpes,Département Automatique et Productique
[3] G-SCOP,Department of Manufacturing Sciences and Logistics, CMP
[4] CNRS,undefined
[5] G-SCOP,undefined
[6] Ecole des Mines de Nantes,undefined
[7] Ecole des Mines de Saint-Etienne,undefined
来源
The International Journal of Advanced Manufacturing Technology | 2016年 / 85卷
关键词
Production-inventory-distribution problem; Mixed integer linear programming; Lot sizing;
D O I
暂无
中图分类号
学科分类号
摘要
This paper considers a supply chain management problem which integrates production, inventory, and distribution decisions. The supply chain is composed of one supplier production facility and several retailers located in a given geographic region. The supplier is responsible for the production and the replenishment of the inventory of retailers, in a vendor managed inventory (VMI) context. The distance between retailers is negligible compared to the distance between the supplier and the retailers’ region. Thus, for each vehicle, there is a major fixed cost for traveling to the cluster of retailers and a minor fixed cost for visiting each individual retailer. The problem consists of determining quantities to be produced, quantities to be delivered to retailers, vehicles to be used, and retailers to be serviced by each vehicle. This problem is an extension of the one warehouse multi-retailer problem with the consideration of production planning and storage and vehicle capacity limitations in addition to fixed vehicle utilization costs and retailer servicing costs. The objective is to minimize a total cost composed of production, transportation, and inventory holding costs at the supplier and at the retailers. Two mixed integer linear programming formulations are proposed and six families of valid inequalities are added to strengthen these formulations. Two of these families are new and the others are adapted from the literature. The numerical results show that the valid inequalities considerably improve the quality of the formulations. Moreover, the parameters that influence the most computational times are analyzed.
引用
收藏
页码:971 / 989
页数:18
相关论文
共 84 条
[1]  
Adulyasak Y(2014)Optimization-based adaptive large neighborhood search for the production routing problem Transp Sci 48 20-45
[2]  
Cordeau JF(2005)Shipping multiple items by capacitated vehicles Transp Sci 39 233-248
[3]  
Jans J(2011)Analysis of the maximum level policy in a production-distribution system Comput Oper Res 38 1731-1746
[4]  
Anily S(1989)Computational complexity of uncapacitated multiechelon production planning problems Oper Res Lett 8 61-66
[5]  
Tzur M(1984)Uncapacitated lot sizing: the convex hull of solutions Math Program Stud 22 32-43
[6]  
Archetti C(2009)The integrated production-inventory-distribution-routing problem J Sched 12 257-280
[7]  
Bertazzi L(2010)A branch-and-price algorithm for an integrated production and inventory routing problem Comput Oper Res 37 2202-2217
[8]  
Paletta G(2005)Minimizing the total cost in an integrated vendor-managed inventory system J Heuristics 11 393-419
[9]  
Speranza MG(1993)Models for multi-plant coordination Eur J Oper Res 67 141-160
[10]  
Arkin E(2007)A reactive GRASP and path relinking for a combined production-distribution problem Comput Oper Res 34 3402-3419