An Integer Programming Model for Multi-Echelon Supply Chain Decision Problem Considering Inventories

4th International Conference on Operational Research

Harahap, Amin^1 ; Mawengkang, Herman^2 ; Siswadi^1 ; Effendi, Syahril^3

Graduate School of Mathematics, University of Sumatera Utara, Medan, Indonesia^1

Department of Mathematics, University Sumatera Utara, Medan, Indonesia^2

Faculty of Computer Science and Information Technology, University of Sumatera Utara, Medan, Indonesia^3

关键词: Active constraints;    Integer programming models;    Inventory;    Mixed integer linear programming;    Multi echelon supply chains;    Multi-echelon inventory;    Multiechelon;    Programming models;   

Others  :  https://iopscience.iop.org/article/10.1088/1757-899X/300/1/012026/pdf
DOI  :  10.1088/1757-899X/300/1/012026

来源: IOP

【 摘 要 】

In this paper we address a problem that is of significance to the industry, namely the optimal decision of a multi-echelon supply chain and the associated inventory systems. By using the guaranteed service approach to model the multi-echelon inventory system, we develop a mixed integer; programming model to simultaneously optimize the transportation, inventory and network structure of a multi-echelon supply chain. To solve the model we develop a direct search approach using a strategy of releasing nonbasic variables from their bounds, combined with the "active constraint" method. This strategy is used to force the appropriate non-integer basic variables to move to their neighbourhood integer points.