%0 Journal Article
%T A Benders-Decomposition and Meta-Heuristic Algorithm for a Bi- Objective Stochastic Reliable Capacitated Facility Location Problem Not Dealing with Benders Feasibility-Cut Stage
%J Journal of Optimization in Industrial Engineering
%I QIAU
%Z 2251-9904
%A ZahediAnaraki, AmirHossien
%A Esmaeilian, Gholamreza
%D 2021
%\ 07/01/2021
%V 14
%N 2
%P 307-319
%! A Benders-Decomposition and Meta-Heuristic Algorithm for a Bi- Objective Stochastic Reliable Capacitated Facility Location Problem Not Dealing with Benders Feasibility-Cut Stage
%K Capacitated facility location
%K reliability
%K Stochastic programming
%K Benders decomposition
%R 10.22094/joie.2021.578550.1599
%X This paper addresses a bi-objective two-stage stochastic mixed-integer linear programming model for a stochastic reliable capacitated facility location in which the optimum numbers, locations and as well as shipment quantity of the product between the network nodes for all scenarios should be determined. Unlike most of previous relevant works, multiple levels of capacities available to the manufacturers in different scenarios are permitted in this study. The proposed objectives of the model include: the minimization of expected sum of installation, production, transportation under uncertainty of parameters, such as transportation and production and disruption of facilities, as well as minimizing expected standard deviation of network costs for whole scenarios. Since one of the most important reasons for researchers' reluctance to apply Benders-decomposition algorithm in facility-location concept is the time-consuming nature of its feasibility-cut stage, one of the most outstanding innovation in this paper is to add a strengthening redundant constraint to the proposed model in order to eliminate the mechanism related to feasibility cuts in master problem. to the best of our knowledge, it is the first time that this technique, not being involved in keeping master-problem feasibility, is used to solve a reliable capacitated facility location problem. In this approach, in terms of time-consuming the Benders algorithm is able to powerfully compete with metaheuristic algorithms, but with an exact solution. To prove advantage of this algorithm satisfying both ultimate solution optimality and appropriate running time compared to metaheuristic algorithms at the same time, one metaheuristic algorithm, namely Imperialist Competitive Algorithm (ICA), is presented. Usefulness and practicality of the proposed model and solution method demonstrated through a case example in different class with variable size.
%U http://www.qjie.ir/article_678991_c0bba46d4c6882f649adb38160f9b763.pdf