Abstract
The problem tackled in this paper is as follows: consider a set ofn interacting points in a two-dimensional space. The levels of interactions between the observations are given exogenously. It is required to cluster then observations intop groups, so that the sum of squared deviations from the cluster means is as small as possible. Further, assume that the cluster means are adjusted to reflect the interaction between the entities. (It is this latter consideration which makes the problem interesting.) A useful property of the problem is that the use of a squared distance term yields a linear system of equations for the coordinates of the cluster centroids. These equations are derived and solved repeatedly for a given set of cluster allocations. A sequential reallocation of the observations between the clusters is then performed. One possible application of this problem is to the planar hub location problem, where the interacting observations are a system of cities and the interaction effects represent the levels of flow or movement between the entities. The planar hub location problem has been limited so far to problems with fewer than 100 nodes. The use of the squared distance formulation, and a powerful supercomputer (Cray Y-MP) has enabled quick solution of large systems with 250 points and four groups. The paper includes both small illustrative examples and computational results using systems with up to 500 observations and 9 clusters.
Similar content being viewed by others
References
M.R. Anderberg,Cluster Analysis for Application (Academic Press, New York, 1973).
T. Aykin, On the location of hub facilities, Transp. Sci. 22(1988)155–157.
T. Aykin and G.F. Brown, Interacting new facilities and loçation-allocation problem, Manuscript (1990).
J. Campbell, Hub location problems and thep-hub median problem, Working Paper 91-06-21, Center for Business and Industrial Studies, University of Missouri-St. Louis (1991).
J. Campbell, Integer programming formulations of discrete hub location problems, Working Paper 91-06-22, Center for Business and Industrial Studies, University of Missouri-St. Louis (1991).
L. Cooper, Location-allocation problems, Oper. Res. 11(1963)331–343.
L. Cooper,N-dimensional location models: an application to cluster analysis, J. Reg. Sci. 13(1973)41–54.
S. Ever-Hadani, Applications of cluster analysis algorithm to geostatistical series, Reg. Sci. Urban Econ. 10(1980)123–151.
E.W. Forgy, Cluster analysis of multivariate data: efficiency versus interpretability of classifications, Abstract, Biometrics 21(1965)768. (Cited in [1, p. 349].)
IMSL Inc., MATH/LIBRARY, Fortran Subroutines for Mathematical Application (1987).
R.C. Jancey, Multidimensional group analysis, Austral. J. Botany 14(1966)127–130. (Cited in [1, p. 350].)
T.D. Klastorin, Thep-median problem for cluster analysis: a comparative test using the mixture model approach, Manag. Sci. 31(1985)84–95.
G. Klein and J.E. Aronson, Optimal clustering: A model and method, Naval Res. Logist. Quart. 38(1991)449–461.
J.G. Klincewicz, Heuristics for thep-hub location problem, Manuscript (Oct. 1988).
J.G. Klincewicz, Avoiding local optima in thep-hub location problem using tabu search and GRASP, Ann. Oper. Res. (1992), this volume.
A.C. Lea, Location-allocation systems: An annotated bibliography, Discussion Paper 13, Department of Geography, University of Toronto (1973).
J.B. MacQueen, Some methods for classification and analysis of multivariate observations,Proc. 5th Symp. on Mathematical Statistics and Probability, Berkeley, Vol. 1 (University of California Press, 1967). (Cited in [1, p. 351].)
A.H. McHose, A quadratic formulation of the activity location problem, J. Ind. Eng. 12(1961)334–347. (Cited in [16, p. 128].)
J. Mulvey and H. Crowder, Cluster analysis: an application of Lagrangian relaxation, Manag. Sci. 25(1979)329–340.
M.E. O'Kelly, The location of interacting hub facilities, Transp. Sci. 20(1986)92–106.
L.M. Ostrech, An efficient algorithm for solving the two center location-allocation problem, J. Reg. Sci. 15(1975)209–216.
M.R. Rao, Cluster analysis and mathematical programming, J. Amer. Statist. Assoc. 66(1971)622–626.
S. Reiter and G.R. Sherman, Allocating indivisible resources affording external economies or diseconomies, Int. Econ. Rev. 3(1962)108–135.
C.S. ReVelle and R.W. Swain, Central facilities location, Geograph. Anal. 11(1970)30–42.
K. Rosing and C. ReVelle, Optimal clustering, Environ. Planning A18(1986)1463–1476.
H. Vinod, Integer programming and the theory of grouping, J. Amer. Statist. Assoc. (June 1969) 506–518.
R.A. Whitaker, A fast algorithm for the greedy interchange for large-scale clustering and median location problem, INFOR 21(1983)95–108, and errata 70–71.
J.A. White, A quadratic facility location problem, AIIE Trans. 3(1971)156–157.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
O'Kelly, M.E. A clustering approach to the planar hub location problem. Ann Oper Res 40, 339–353 (1992). https://doi.org/10.1007/BF02060486
Issue Date:
DOI: https://doi.org/10.1007/BF02060486