The problem of facility siting in a districted region is discussed and a two-stage algorithm proposed. The first stage consists of solving a particular facility siting problem (for example, a p-median problem, or a maximal location covering problem) in each district for all possible allocations of facilities to a district with respect to the number of facilities allocated in each district. The second stage is the allocation of resources (facilities) among the districts. A greedy algorithm is proposed to solve the resource allocation problem with a criterion of minimizing the sum of weighted distances under convex conditions.
Get full access to this article
View all access options for this article.
References
1.
ChurchRReVelleC, 1974, “The maximal covering location problem”Papers of Regional Science Association32101–118.
2.
ChurchRReVelleC, 1976, “Theoretical and computational links of the p-median and maximal covering location problem”Geographical Analysis8406–421.
3.
El-ShaiebA M, 1973, “A new algorithm for locating sources among destinations”Management Science20221–231.
4.
EverettH, 1963, “Generalized Lagrange multiplier method for solving problems of optimum allocation of resources”Operations Research11399–417.
5.
HakimiS L, 1965, “Optimal location of switching centers and the absolute centers and medians of a graph”Operations Research12450–459.
6.
JarvinenPRajakJSinervoH, 1972, “A branch-and-bound algorithm for seeking the p-median”Operations Research20173–178.
7.
MaranzanaF, 1964, “On the location of supply points to minimize costs”Operations Research Quarterly15261–273.
8.
NarulaSOgbuUSamuelssonH, 1977, “An algorithm for the p-median problem”Operations Research28709–711.
RosingKReVelleCRosing-VogellarH, 1979, “The p-median and its linear programming relaxation: An approach to large problems”Journal of the Operational Research Society30815–823.
11.
TeitzM BBartP, 1968, “Heuristic methods for estimating the generalized vertex median of a weighted graph”Operations Research16955–961.
