Integrated optimization of location, inventory and routing in supply chain network design

被引:81
作者
Zheng, Xiaojin [1 ]
Yin, Meixia [1 ]
Zhang, Yanxia [1 ]
机构
[1] Tongji Univ, Sch Econ & Management, Shanghai 200092, Peoples R China
基金
中国国家自然科学基金;
关键词
Supply chain network design; Location; inventory and routing; Integrated optimization; Generalized benders decomposition; BRANCH-AND-CUT; BENDERS DECOMPOSITION; DISTRIBUTION-SYSTEM; FACILITY LOCATION; HEURISTIC METHOD; ALGORITHM; FORMULATION; GENERATION; MANAGEMENT; DECISIONS;
D O I
10.1016/j.trb.2019.01.003
中图分类号
F [经济];
学科分类号
02 ;
摘要
We study the integrated optimization of location, inventory and routing in supply chain network design (SCDN) problem. The SCND decision has significant impact on the performance of the supply chain. The major obstacles of the integrated optimization are the high non-linearity and the huge amount of variables and constraints caused by routing. In this paper, we introduce real-world constraints into the integrated model to characterize the model much more precisely, which simultaneously reduce the dimension of the problem. We propose an exact algorithm based on the Generalized Benders Decomposition (GBD) method to solve the model. We can obtain the Benders Cuts (BC) explicitly. We verify the effectiveness of the model and method by a real-life case: A passenger car supply chain network design case. (C) 2019 Elsevier Ltd. All rights reserved.
引用
收藏
页码:1 / 20
页数:20
相关论文
共 57 条
[1]  
Abmadi A., 2012, ENG OPTIM, V44, P637
[2]   Hybrid heuristics for a short sea inventory routing problem [J].
Agra, Agostinho ;
Christiansen, Marielle ;
Delgado, Alexandrino ;
Simonetti, Luidi .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2014, 236 (03) :924-935
[3]   Industrial aspects and literature survey: Combined inventory management and routing [J].
Andersson, Henrik ;
Hoff, Arild ;
Christiansen, Marielle ;
Hasle, Geir ;
Lokketangen, Arne .
COMPUTERS & OPERATIONS RESEARCH, 2010, 37 (09) :1515-1536
[4]   A branch-and-cut algorithm for a vendor-managed inventory-routing problem [J].
Archetti, Claudia ;
Bertazzi, Luca ;
Laporte, Gilbert ;
Speranza, Maria Grazia .
TRANSPORTATION SCIENCE, 2007, 41 (03) :382-391
[5]   A Conic Integer Programming Approach to Stochastic Joint Location-Inventory Problems [J].
Atamtuerk, Alper ;
Berenguer, Gemma ;
Shen, Zuo-Jun .
OPERATIONS RESEARCH, 2012, 60 (02) :366-381
[6]   Dimension reduction of large-scale second-order dynamical systems via a second-order Arnoldi method [J].
Bai, ZJ ;
Su, YF .
SIAM JOURNAL ON SCIENTIFIC COMPUTING, 2005, 26 (05) :1692-1709
[7]   An Exact Algorithm for the Two-Echelon Capacitated Vehicle Routing Problem [J].
Baldacci, Roberto ;
Mingozzi, Aristide ;
Roberti, Roberto ;
Clavo, Roberto Wolfler .
OPERATIONS RESEARCH, 2013, 61 (02) :298-314
[8]   An Exact Method for the Capacitated Location-Routing Problem [J].
Baldacci, Roberto ;
Mingozzi, Aristide ;
Calvo, Roberto Wolfler .
OPERATIONS RESEARCH, 2011, 59 (05) :1284-1296
[9]   A branch-and-price algorithm for an integrated production and inventory routing problem [J].
Bard, Jonathan F. ;
Nananukul, Narameth .
COMPUTERS & OPERATIONS RESEARCH, 2010, 37 (12) :2202-2217
[10]   Partitioning procedures for solving mixed-variables programming problems [J].
Benders, J. F. .
COMPUTATIONAL MANAGEMENT SCIENCE, 2005, 2 (01) :3-19