Supply chain network design with efficiency, location, and inventory policy using a multiobjective evolutionary algorithm

被引:21
|
作者
Perez Loaiza, Rodolfo Eleazar [1 ]
Olivares-Benitez, Elias [1 ]
Miranda Gonzalez, Pablo A. [2 ]
Guerrero Campanur, Aaron [3 ]
Martinez Flores, Jose Luis [1 ]
机构
[1] UPAEP Univ, Puebla, Mexico
[2] Pontificia Univ Catolica Valparaiso, Valparaiso, Chile
[3] Inst Tecnol Super Uruapan, Uruapan, Michoacan, Mexico
关键词
multiobjective; evolutionary algorithm; Pareto front; OEE; OPTIMIZATION; MULTIECHELON; DECISIONS;
D O I
10.1111/itor.12287
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
This study presents a metaheuristic based on a multiobjective evolutionary algorithm to solve a biobjective mixed-integer nonlinear programming model for supply chain design with location-inventory decisions and supplier selection. The supply chain has four echelons with suppliers, plants, distribution centers, and retailers. The decision variables are the opening of plants and distribution centers and the flow of materials between the different facilities, considering a continuous review inventory policy. The conflicting objectives are to minimize total costs on the entire chain, and to maximize a combined value of overall equipment effectiveness from suppliers. Small- and medium-sized scenarios are solved and compared with Pareto fronts obtained with commercial optimization software applying the epsilon-constraint method. The numerical results show the effectiveness of the proposed metaheuristic. The main contributions of this work are a new practical problem that has not been analyzed before, and the development of the evolutionary algorithm.
引用
收藏
页码:251 / 275
页数:25
相关论文
共 50 条
  • [1] Integrated optimization of location, inventory and routing in supply chain network design
    Zheng, Xiaojin
    Yin, Meixia
    Zhang, Yanxia
    [J]. TRANSPORTATION RESEARCH PART B-METHODOLOGICAL, 2019, 121 : 1 - 20
  • [2] Incorporating location, routing and inventory decisions in supply chain network design
    Javid, Amir Ahmadi
    Azad, Nader
    [J]. TRANSPORTATION RESEARCH PART E-LOGISTICS AND TRANSPORTATION REVIEW, 2010, 46 (05) : 582 - 597
  • [3] A Location-inventory Model with Echelon Stock Policy for Four-echelon Supply Chain Network Design
    Shui Wenbing
    [J]. 2013 THIRD INTERNATIONAL CONFERENCE ON INTELLIGENT SYSTEM DESIGN AND ENGINEERING APPLICATIONS (ISDEA), 2013, : 86 - 89
  • [4] An evolutionary algorithm for supply chain network design with assembly line balancing
    Koc, Cagri
    [J]. NEURAL COMPUTING & APPLICATIONS, 2017, 28 (11): : 3183 - 3195
  • [5] An evolutionary algorithm for supply chain network design with assembly line balancing
    Çağrı Koç
    [J]. Neural Computing and Applications, 2017, 28 : 3183 - 3195
  • [6] Incorporating location, inventory and price decisions into a supply chain distribution network design problem
    Ahmadi-Javid, Amir
    Hoseinpour, Pooya
    [J]. COMPUTERS & OPERATIONS RESEARCH, 2015, 56 : 110 - 119
  • [7] Modified Harmony Search Algorithm for Location-Inventory-Routing Problem in Supply Chain Network Design with Product Returns
    Misni, F.
    Lee, L. S.
    [J]. MALAYSIAN JOURNAL OF MATHEMATICAL SCIENCES, 2021, 15 (01): : 1 - 20
  • [8] Evolutionary Algorithm for Inventory Levels Selection in a Distribution Supply Chain
    Cannavo, Flavio
    Nunnari, Valeria
    [J]. ETFA 2005: 10TH IEEE INTERNATIONAL CONFERENCE ON EMERGING TECHNOLOGIES AND FACTORY AUTOMATION, VOL 2, PROCEEDINGS, 2005,
  • [9] A DISTRIBUTED EVOLUTIONARY ALGORITHM FOR SOLVING THE GREEN SUPPLY CHAIN NETWORK DESIGN PROBLEM
    Li, Xinyuan
    Wang, Dan
    Jiang, Yanji
    Cao, Maojun
    [J]. UPB Scientific Bulletin, Series C: Electrical Engineering and Computer Science, 2022, 84 (01): : 33 - 50
  • [10] A DISTRIBUTED EVOLUTIONARY ALGORITHM FOR SOLVING THE GREEN SUPPLY CHAIN NETWORK DESIGN PROBLEM
    LI, Xinyuan
    WANG, Dan
    JIANG, Yanji
    CAO, Maojun
    [J]. UNIVERSITY POLITEHNICA OF BUCHAREST SCIENTIFIC BULLETIN SERIES C-ELECTRICAL ENGINEERING AND COMPUTER SCIENCE, 2022, 84 (01): : 33 - 50