The differential evolution algorithm is an evolutionary for global optimization and the un-capacitated facility location problem (UFL) one of classic NP-Hard problems. In this paper, combined with specific characteristics UFL problem, we introduce activation function to solving name it improved adaptive (IADEA). Next, improve efficiency alleviate being stuck in a local optimum, operator was add...

Capacitated covering models aim at covering the maximum amount of customers’ demand using a set of capacitated facilities. Based on the assumptions made in such models, there is a unique scenario to open a facility in which each facility has a pre-specified capacity and an operating budget. In this paper, we propose a generalization of the maximal covering location problem, in which facilities ...

Facility location is a complex real-world problem which needs a strategic management decision. This paper provides a general review on studies, efforts and developments in Facility Location Problems which are classical optimization problems having a wide-spread applications in various areas such as transportation, distribution, production, supply chain decisions and telecommunication. Our goal ...

In this paper a capacitated dynamic location problem with opening, closure and reopening of facilities is formulated and a primal-dual heuristic that can solve this problem is described. The problem formulated considers the situation where a facility is open (or reopens) with a certain maximum capacity that decreases as clients are assigned to that facility during its operating periods. This pr...

Location-Routing Problem (LRP) can model several life situations. In this paper we study The Capacitated Location Routing Problem (CLRP) which is defined as a combination of two problems: the Facility Location Problem (FLP) and the Vehicle Routing problem (VRP). We propose a twophase approach to solve the CLRP. The approach is based on Simulated Annealing algorithm (SA) and Ant Colony System (A...

We present a nested local search algorithm to approximate several variants of metric two-stage stochastic facility location problems. These problems are generalizations of the well-studied metric uncapacitated facility location problem, taking uncertainties in demand values and costs into account. The proposed nested local search procedure uses three facility operations: adding, dropping, and s...

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 o...