A primal–dual algorithm for the economic lot-sizing problem with multi-mode replenishment |
| |
Authors: | Sandra Duni Ek?io?lu |
| |
Institution: | Department of Industrial and Systems Engineering, Mississippi State University, P.O. Box 9542, Mississippi State, MS 39762, USA |
| |
Abstract: | 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. |
| |
Keywords: | Inventory Economic lot-sizing Primal&ndash dual algorithm Multi-setups costs Network flows |
本文献已被 ScienceDirect 等数据库收录! |