This paper proposes a new location problem of competitive facilities, e.g. shops and stores, with uncertainty and vagueness including demands for the facilities in a plain. By representing the demands for facilities as fuzzy random variables, the location problem can be formulated as a fuzzy random programming problem. For solving the fuzzy random programming problem, first the α-level sets for...

In this paper we deal with the location of extensive facilities on trees, both discrete and continuous, under the condition that existing facilities are already located. We require that the selected new server is a subtree, although we also specialize to the case of paths. We study the problem with the two most widely used criteria in Location Analysis: center and median. Our main results under...

In this paper, we study a budget constrained location problem in which we simultaneously consider opening some new facilities and closing some existing facilities. Motivations for this problem stem from applications where, due to a change in the distribution of customer demand, the existing facility system no longer provides adequate service. The objective is to minimize the total weighted trav...

This paper is devoted to the location of public facilities in a metric space. Selfish agents are located in this metric space, and their aim is to minimize their own cost, which is the distance from their location to the nearest facility. A central authority has to locate the facilities in the space, but she is ignorant of the true locations of the agents. The agents will therefore report their...

Solving the problem of locating services in a given context requires a methematical abstraction so that its complexity can be managed by means of an iterative search through context simulations. Keeping the interface between planners and the model within planners’ knowledge domain is achieved by an interactive tool that encourages exploration and comparison among different possible solutions. A...

In this paper we formalize and initiate the study of heterogeneous k-facility location without money, a problem akin to the classical k-facility location problem but encompassing a richer model and featuring multi-parameter agents. In particular, we consider truthful mechanisms without money for the problem in which heterogeneous (i.e. serving different purposes) facilities have to be located a...

This paper develops a model for determining locations of undesirable facilities. It is formulated as multiobjective since the problem of locating undesirable facilities faces many conflicting criteria. A method is also proposed to appropriately address uncertainty associated with this class of location problems. The methodology developed in this study is tested using the real-world data. 2003 E...

In this paper we propose and discuss different models to include capacity constraints into the Reliability Fixed-Charge Location Problem. In all cases, the proposed models represent a tradeoff between the extreme models that can be found in the literature, where a priori assignments are either fixed, or can be fully modified at each scenario. In a series of computational experiments we analyze ...

In this paper, we deal with competitive facility location problems in which the demand of each customer depends on the facilities. In our models two competitive companies intend to locate their facilities on the market in order to maximize the total demand acquired from the market. The distances between the facilities and the demand points are measured by rectangular distance. At first we consi...

In this paper, we deal with single facility location problems in a general normed space in which the existing facilities are represented by convex sets of points. The criterion to be satisfied by the service facility is the minimization of an increasing, convex function of the distances from the service facility to the closest point of each demand set. We obtain a geometrical characterization o...