The quadratic assignment problem (QAP) was first proposed by Koopmans and Beckman [5] in the context of the plant location problem. Given n facilities, represented by the set F f1 fn , and n locations represented by the set L l1 ln , one must determine to which location each facility must be assigned. Let An n ai j be a matrix where ai j represents the flow between facilities fi and f j. Let Bn...

In many service and industrial applications of the facility location problem, the number of required facilities along with allocation of the customers to the facilities are the two major questions that need to be answered. In this paper, a facility location problem with stochastic customer demand and immobile servers is studied. Two objectives considered in this problem are: (1) minimizing the ...

different decisions, including location decisions of companies which are operating in international dynamic environment are subject to significant uncertainty.so in this research an international facility location problem under uncertainty is considered and an integrated model for strategic and operational planning is presented. in strategic level countries are assessed according to internation...

The facility location problem in a market environment where other similar facilities are already activated has been studied extensively in the international bibliography. What has not been materialized however, with only a few incomplete exceptions, is software specialized on the specific problem. Given the huge number of models of the problem, the even greater number of their solution methods ...

Previous research is classified into four broad categories in this paper: the study of a university’s impact on the location choice of high technology facilities, the investigation of university impact on the spatial distribution of high technology production, the analysis of the spatial pattern of industrial research and development activities, and the modeling of local knowledge transfers ema...

This paper derives the distribution of the difference between the distances to the first and the second nearest facilities. Facilities are represented as points of regular and random patterns, and distance is measured as Euclidean and rectilinear distances on a continuous plane. Since the difference between the distances is regarded as the additional travel distance of customers when the neares...

We present e cient algorithms for two problems of facility location. In both problems we want to optimize the location of two facilities with respect to n given sites. The rst problem, the continuous version, has no restrictions for facility locations but in the second one, the discrete version, facilities are chosen from a speci ed set of possible locations. We consider the rectilinear metric ...

The Simple Plant Location Problem is well known in the literature: it consists in deciding which facilities to open among a set of potential nodes and allocating a set of customers to the open facilities in such a way that the total cost is minimum, allocation process which is carried out by the locator. However, customers may be free to choose the facility they will be allocated to. This fact ...

W analyze the problem of optimal location of a set of facilities in the presence of stochastic demand and congestion. Customers travel to the closest facility to obtain service; the problem is to determine the number, locations, and capacity of the facilities. Under rather general assumptions (spatially distributed continuous demand, general arrival and service processes, and nonlinear location...

In this paper, we propose two exact algorithms for the GQAP (generalized quadratic assignment problem). In this problem, given M facilities and N locations, the facility space requirements, the location available space, the facility installation costs, the flows between facilities, and the distance costs between locations, one must assign each facility to exactly one location so that each locat...