چکیده:
Proposing a robust designed facility location is one of the most effective ways to hedge against
unexpected disruptions and failures in a transportation network system. This paper considers the
combined facility location/network design problem with regard to transportation link disruptions
and develops a mixed integer linear programming formulation to model it. With respect to the
probability of link disruptions, the objective function of the model minimizes the total costs,
including location costs, link construction costs and also the expected transportation costs. An
efficient hybrid algorithm based on LP relaxation and variable neighborhood search metaheuristic
is developed in order to solve the mathematical model. Numerical results demonstrate that the
proposed hybrid algorithm has suitable efficiency in terms of duration of solution time and
determining excellent solution quality.
خلاصه ماشینی:
This paper considers the combined facility location/network design problem with regard to transportation link disruptions and develops a mixed integer linear programming formulation to model it.
(Bigotte, Krass, Antunes, & Berman, 2010) studied the FLNDP in which, the multiple levels of urban centers and multiple levels of network links were considered simultaneously for developing of a mixed integer mathematical model.
(Berman, Krass, & Menezes, 2007) relaxed the assumption of uniform failure probabilities, modeled the stochastic fixed-charged facility location problem as a nonlinear mixed integer program, and proposed several heuristic solution algorithms.
(2010) (Cui, Ouyang, & Shen, 2010) proposed a mixed integer program (MIP) formulation and a continuum approximation (CA) model to study the reliable uncapacitated fixed charge location problem (RUFL) which seeks to optimize the initial set up costs and expected transportation costs in normal and failure scenarios.
Accordingly, proposing a new mathematical model formulation, which can obtain optimal facility location and link construction under some special conditions such as system reliability, can lead decision makers to more accurate solutions for the considered problem.
Percentage of applying several solution methods for reliable facility location problem As a brief review, variable neighborhood search (VNS) is a meta-heuristic for creating heuristics whose basic idea is a systematic variation of neighborhood structures within the local search algorithm without guaranteeing the solution’s optimality (Mladenović, UroÅ¡ević, Hanafi, & Ilić, 2012; Mladenović & Hansen, 1997).