In the classical facility location problemwe are given a set of facilities, with associated opening costs, and a set of clients. The goal is to open a subset of facilities, and to connect each client to the closest open facility, so that the total connection and opening cost is minimized. In some applications, however, open facilities need to be connected via an infrastructure. Furthermore, con...

Fermat-Weber problem in its simple form (unconstrained, single facility, Euclidean metric) is well investigated. Lot of algorithms are also developed for more complicated cases. But the generalized multi-facility problem with barriers, restricted zones and an arbitrary metric has no well-known algorithm for its solving. In this paper, we consider the planar multi-facility Weber problem with res...

The facility location selection, which is one of the important activities in strategic planning for a wide range of private and public companies, is a multi-criteria decision making problem including both quantitative and qualitative criteria. Traditional methods for facility location selection can not be effectively handled because information can not be represented by precise information unde...

We address optimal group manipulation in multidimensional, multi-facility location problems. We focus on two families of mechanisms, generalized median and quantile mechanisms, evaluating the difficulty of group manipulation of these mechanisms. We show that, in the case of single-facility problems, optimal group manipulation can be formulated as a linear or second-order cone program, under the...

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

This article proposes a novel Pareto-based multiobjective meta-heuristic algorithm named non-dominated ranking genetic algorithm (NRGA) to solve multi-facility location-allocation problem. In NRGA, a fitness value representing rank is assigned to each individual of the population. Moreover, two features ranked based roulette wheel selection including select the fronts and choose solutions from ...