A set of efficient heuristics and metaheuristics to solve a two-stage stochastic bi-level decision-making model for the distribution network problem

被引:74
作者
Hajiaghaei-Keshteli, Mostafa [1 ]
Fathollahi-Fard, Amir Mohammad [1 ]
机构
[1] Univ Sci & Technol Mazandaran, Dept Ind Engn, Behshahr, Iran
关键词
Heuristic algorithm; Hybrid metaheuristic; Two-stage stochastic bi-level programming; Distribution network problem; Location-allocation models; SUPPLY CHAIN NETWORK; KTH-BEST APPROACH; TRANSPORTATION PROBLEM; PROGRAMMING APPROACH; FACILITY LOCATION; GENETIC ALGORITHM; DESIGN; OPTIMIZATION; LOGISTICS; METHODOLOGY;
D O I
10.1016/j.cie.2018.07.009
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
The performance of supply chain systems directly depends on the design of distribution networks. On the other hand, uncertainty is one of important and challenging subjects in distribution networks. Another real supposition is that the decisions in a distribution network are usually adopted in a hierarchical manner. By adopting these topics and contrary to previous works, this study firstly develops a two-stage stochastic bi-level decision-making model to simulate the behavior of a distribution network, more efficiently. Generally, the proposed problem is based on the static Stackelberg game between the Distribution Centers (DCs) in the upper-level and Customer Zones (CZs) in the lower-level of the model. Due to the uncertainty of the proposed problem, a financial risk model has been considered as well. The literature reveals that the most of different exact methods are not recommended to solve the bi-level models for large-scale problems. Another contribution of this study is to propose a set of quick heuristics along with two new hybrid metaheuristics based on the benefits of recent and traditional algorithms to solve the developed model in large-scale networks. In order to check the quality of algorithms' results, an explicit enumeration algorithm structured by E-constraint method is considered in small sizes. A comparative study reveals that although the proposed heuristics reach the optimal solution in less time, the solution quality of hybrid metaheuristics is strongly better than others. Finally, the efficiency of the proposed model is validated by a set of sensitivity analyses through a real industrial example.
引用
收藏
页码:378 / 395
页数:18
相关论文
共 76 条
[1]   A survey of healthcare facility location [J].
Ahmadi-Javid, Amir ;
Seyedi, Pardis ;
Syam, Siddhartha S. .
COMPUTERS & OPERATIONS RESEARCH, 2017, 79 :223-263
[2]   FACILITY LOCATION MODELS FOR DISTRIBUTION PLANNING [J].
AIKENS, CH .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1985, 22 (03) :263-279
[3]   Finding the most efficient DMUs in DEA: An improved integrated model [J].
Amin, Gholam R. ;
Toloo, M. .
COMPUTERS & INDUSTRIAL ENGINEERING, 2007, 52 (01) :71-77
[4]   An exact penalty on bilevel programs with linear vector optimization lower level [J].
Ankhili, Z. ;
Mansouri, A. .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2009, 197 (01) :36-41
[5]  
[Anonymous], 2018, J NAME
[6]   Disjunctive cuts for continuous linear bilevel programming [J].
Audet, Charles ;
Haddad, Jean ;
Savard, Gilles .
OPTIMIZATION LETTERS, 2007, 1 (03) :259-267
[7]   AN EXPLICIT SOLUTION TO THE MULTILEVEL PROGRAMMING PROBLEM [J].
BARD, JF ;
FALK, JE .
COMPUTERS & OPERATIONS RESEARCH, 1982, 9 (01) :77-100
[8]   AN INVESTIGATION OF THE LINEAR 3 LEVEL PROGRAMMING PROBLEM [J].
BARD, JF .
IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS, 1984, 14 (05) :711-717
[9]  
BEALE EML, 1955, J ROY STAT SOC B, V17, P173
[10]   Hybrid flowshop scheduling with machine and resource-dependent processing times [J].
Behnamian, J. ;
Ghomi, S. M. T. Fatemi .
APPLIED MATHEMATICAL MODELLING, 2011, 35 (03) :1107-1123