An optimal solution to a three echelon supply chain network with multi-product and multi-period

被引:48
|
作者
Eduardo Cardenas-Barron, Leopoldo [1 ]
Trevino-Garza, Gerardo [2 ]
机构
[1] Tecnol Monterrey, Sch Engn, Dept Ind & Syst Engn, Monterrey 64849, NL, Mexico
[2] Tecnol Monterrey, Sch Business, Dept Mkt & Int Business, Monterrey 64849, NL, Mexico
关键词
Supply chain management; Integer linear programming; Optimization; Integration; LOT-SIZE PROBLEM; VENDOR; REWORK; POLICY;
D O I
10.1016/j.apm.2013.09.010
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
Recently, Kadadevaramath et al. (2012) [1] presented a mathematical model for optimizing a three echelon supply chain network. Their model is an integer linear programming (ILP) model. In order to solve it, they developed five algorithms; four of them are based on a particle swarm optimization (PSO) method and the other is a genetic algorithm (GA). In this paper, we develop a more general mathematical model that contains the model developed by Kadadevaramath et al. (2012) [1]. Furthermore, we show that all instances proved in Kadadevaramath et al. (2012) [1] can easily be solved optimally by any integer linear programming solver. (C) 2013 Elsevier Inc. All rights reserved.
引用
收藏
页码:1911 / 1918
页数:8
相关论文
共 50 条