کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
482709 | 1446146 | 2009 | 9 صفحه PDF | دانلود رایگان |
![عکس صفحه اول مقاله: A primal–dual algorithm for the economic lot-sizing problem with multi-mode replenishment A primal–dual algorithm for the economic lot-sizing problem with multi-mode replenishment](/preview/png/482709.png)
The classical economic lot-sizing problem assumes that a single supplier and a single transportation mode are used to replenish the inventory. This paper studies an extension of this problem where several suppliers and transportation modes are available. The decision-making process in this case involves identifying (i) the timing for an order; (ii) the choice of shipment modes; and (iii) the order size for each mode. The problem is defined as a network flow problem with multiple setups cost function and additional side constraints. This study provides an MIP formulation for the problem. We also provide an additional formulation of the problem by redefining its decision variables and show that the dual of the corresponding LP-relaxation has a special structure. We take advantage of the structure of the dual problem to develop a primal–dual algorithm that generates tight lower and upper bounds. Computational results demonstrate the effectiveness of the algorithm.
Journal: European Journal of Operational Research - Volume 197, Issue 1, 16 August 2009, Pages 93–101