In today’s systems and networks, disruption is inevitable. Designing a reliable system to overcome probable facility disruptions plays crucial role in planning management. This article proposes capacitated joint inventory-location problem where location-independent may occur facilities. The tries satisfy customer’s demands considers penalty costs for unmet customer demand. aims minimize total s...

This paper proposes a discrete capacitated covering location-allocation model for pharmaceutical centers. In the presented model, two objectives are considered; the first one is minimization of costs and the second one try to maximize customer satisfaction by definition of social justice. Social justice in the model means that we consider customers satisfaction by using distance. the introduced...

The Capacitated Facility Location Problem is to locate a set of facilities with capacity constraints, with the aim of satisfying at the minimum cost the demands of a set of clients. The Single Source version (SingleCFLP ) of the problem has the additional requirement that each client must be assigned to a single facility. In this paper a reformulation of the problem based on Dicut Inequalities ...

In this paper we propose a nonlinear Generalized Disjunctive Programming (GDP) model to optimize the 2-dimensional continuous location and allocation of the potential facilities based on their maximum capacity and the given coordinates of the suppliers and customer points. The model belongs to the class of Capacitated Multi-facility Weber Problem. We propose a bilevel decomposition algorithm th...

In this paper we consider the inverse and reverse network facility location problems with considering the equity on servers. The inverse facility location with equality measure deals with modifying the weights of vertices with minimum cost, such that the difference between the maximum and minimum weights of clients allocated to the given facilities is minimized. On the other hand, the reverse c...

The Maximum static flow problem, in a single-source-single-sink network, deals with finding the maximum amount of from source to sink. Given set possible sinks, identification sink that maximizes is an important optimization problem. In this work, we consider problem when sinks have given capacities. We devise simple network transformation so algorithms uncapacitated case can be used capacitate...

j∈Si d(j, F )    , where for any F ⊆ V , d(j, F ) = minf∈F d(j, f). This is a “min-max” or “robust” version of the k-median problem. Note that in contrast to the recent papers on robust and stochastic problems, we have only one stage of decisionmaking where we select a set of k facilities to open. Once a set of open facilities is fixed, each client in the uncertain client-set connects to the...

in this paper we study finding the $(k,l)$-core problem on a tree which the vertices have positive or negative weights. let $t=(v,e)$ be a tree. the $(k,l)$-core of $t$ is a subtree with at most $k$ leaves and with a diameter of at most $l$ which the sum of the weighted distances from all vertices to this subtree is minimized. we show that, when the sum of the weights of vertices is negative, t...