Supervised regionalization methods: A survey

This paper reviews almost four decades of contributions on the subject of supervised regionalization methods. These methods aggregate a set of areas into a predefined number of spatially contiguous regions while optimizing certain aggregation criteria. The authors present a taxonomic scheme that classifies a wide range of regionalization methods into eight groups, based on the strategy applied for satisfying the spatial contiguity constraint. The paper concludes by providing a qualitative comparison of these groups in terms of a set of certain characteristics, and by suggesting future lines of research for extending and improving these methods.

[1]  R. A. Zemlin,et al.  Integer Programming Formulation of Traveling Salesman Problems , 1960, JACM.

[2]  W. Vickrey.  On the Prevention of Gerrymandering , 1961 .

[3]  J. Weaver,et al.  A Procedure for Nonpartisan Districting: Development of Computer Techniques , 1963 .

[4]  J. Weaver,et al.  Nonpartisan Political Redistricting by Computer , 1965 .

[5]  S. Nagel.  Simplified Bipartisan Computer Redistricting , 1965 .

[6]  W. Bunge,et al.  Gerrymandering, Geography, and Grouping , 1966 .

[7]  Henry F. Kaiser,et al.  An Objective Method for Establishing Legislative Districts , 1966 .

[8]  S. C. Johnson.  Hierarchical clustering schemes , 1967, Psychometrika.

[9]  G. Mills,et al.  The Determination of Local Government Electoral Boundaries , 1967 .

[10]  J. MacQueen.  Some methods for classification and analysis of multivariate observations , 1967 .

[11]  Ron Johnston,et al.  CHOICE IN CLASSIFICATION: THE SUBJECTIVITY OFOBJECTIVE METHODS1 , 1968 .

[12]  N. Spence,et al.  A multifactor uniform regionalization of British counties on the basis of employment data for 1961 , 1968 .

[13]  John M. Liittschwager,et al.  Legislative districting by computer , 1969 .

[14]  G. Nemhauser,et al.  Optimal Political Districting by Implicit Enumeration Techniques , 1970 .

[15]  Peter Haggett,et al.  On the Efficiency of Alternative Aggregations in Region-Building Problems , 1970 .

[16]  W. Tobler.  A Computer Movie Simulating Urban Growth in the Detroit Region , 1970 .

[17]  Sidney W. Hess,et al.  Experiences with a Sales Districting Model: Criteria and Implementation , 1971 .

[18]  Robert R. Roediger,et al.  Political redistricting by computer , 1972, CACM.

[19]  R. Webster,et al.  COMPUTER‐BASED SOIL MAPPING OF SMALL AREAS FROM SAMPLE DATA , 1972 .

[20]  Michael R. Anderberg,et al.  Cluster Analysis for Applications , 1973 .

[21]  J. Byfuglien,et al.  Region-Building — a Comparison of Methods , 1973 .

[22]  Peter J. Taylor,et al.  Some implications of the spatial organization of elections , 1973 .

[23]  M Keane,et al.  The Size of the Region-Building Problem , 1975 .

[24]  J. K. Ord,et al.  Elements of spatial structure : a quantitative approach , 1976 .

[25]  Stan Openshaw,et al.  Optimal Zoning Systems for Spatial Interaction Models , 1977 .

[26]  F. Glover.  HEURISTICS FOR INTEGER PROGRAMMING USING SURROGATE CONSTRAINTS , 1977 .

[27]  Stan Openshaw,et al.  A geographical solution to scale and aggregation problems in region-building, partitioning and spatial modelling , 1977 .

[28]  Stan Openshaw,et al.  An optimal zoning approach to the study of spatially aggregated data , 1978 .

[29]  Roger Sammons.  A simplistic approach to the redistricting problem , 1978 .

[30]  Manfred M. Fischer,et al.  Regional taxonomy: A comparison of some hierarchic and non-hierarchic strategies , 1980 .

[31]  David Rossiter,et al.  Program GROUP: The Identification of All Possible Solutions to a Constituency-Delimitation Problem , 1981 .

[32]  A. Ferligoj,et al.  Clustering with relational constraint , 1982 .

[33]  A. Zoltners,et al.  Sales Territory Alignment: A Review and Model , 1983 .

[34]  Christophe Perruchet,et al.  Constrained agglomerative hierarchical classification , 1983, Pattern Recognit..

[35]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[36]  Charles ReVelle,et al.  SYMPOSIUM ON LOCATION PROBLEMS: IN MEMORY OF LEON COOPER.: THE SHORTEST COVERING PATH PROBLEM: AN APPLICATION OF LOCATIONAL CONSTRAINTS TO NETWORK DESIGN , 1984 .

[37]  Fionn Murtagh,et al.  A Survey of Algorithms for Contiguity-Constrained Clustering and Related Problems , 1985, Comput. J..

[38]  C. Margules,et al.  An Adjacency Constraint in Agglomerative Hierarchical Classifications of Geographic Data , 1985 .

[39]  Giuseppe Arbia,et al.  Spatial Data Configuration in Statistical Analysis of Regional Economic and Related Problems , 1989 .

[40]  Fred W. Glover,et al.  Tabu Search - Part I , 1989, INFORMS J. Comput..

[41]  Fred Glover,et al.  Tabu Search - Part II , 1989, INFORMS J. Comput..

[42]  Michelle H Browdy.  Simulated Annealing: An Improved Computer Model for Political Redistricting , 1990 .

[43]  A S Fotheringham,et al.  The Modifiable Areal Unit Problem in Multivariate Statistical Analysis , 1991 .

[44]  Gilbert Laporte,et al.  Improvements and extensions to the Miller-Tucker-Zemlin subtour elimination constraints , 1991, Oper. Res. Lett..

[45]  Carl Amrhein,et al.  The Effect of Data Aggregation on a Poisson Regression Model of Canadian Migration , 1992 .

[46]  Ravindra K. Ahuja,et al.  Network Flows: Theory, Algorithms, and Applications , 1993 .

[47]  Roberto Battiti,et al.  The Reactive Tabu Search , 1994, INFORMS J. Comput..

[48]  W. Macmillan.  Optimization modelling in a GIS framework:The problem of political redistricting. , 1994 .

[49]  Bruno Simeone,et al.  A spanning tree heuristic for regional clustering , 1995 .

[50]  S Openshaw,et al.  Algorithms for Reengineering 1991 Census Geography , 1995, Environment & planning A.

[51]  A. D. Gordon.  A survey of constrained classification , 1996 .

[52]  C. Revelle,et al.  Heuristic concentration: Two stage solution construction , 1997 .

[53]  Bruce W. Lamar,et al.  Political district determination using large-scale network optimization , 1997 .

[54]  Micah Altman,et al.  Districting principles and democratic representation , 1998 .

[55]  Martin W. P. Savelsbergh,et al.  Branch-and-Price: Column Generation for Solving Huge Integer Programs , 1998, Oper. Res..

[56]  G. Nemhauser,et al.  An Optimization Based Heuristic for Political Districting , 1998 .

[57]  Robert E. Bixby,et al.  MIP: Theory and Practice - Closing the Gap , 1999, System Modelling and Optimization.

[58]  Jean H. P. Paelinck,et al.  On aggregation in spatial econometric modelling , 2000, J. Geogr. Syst..

[59]  Robert Haining,et al.  Providing spatial statistical data analysis functionality for the GIS user: the SAGE project , 2001, Int. J. Geogr. Inf. Sci..

[60]  W. Macmillan,et al.  Redistricting in a GIS environment: An optimisation algorithm using switching-points , 2001, J. Geogr. Syst..

[61]  David Martin,et al.  The Application of Zone-Design Methodology in the 2001 UK Census , 2001 .

[62]  Robert E. Bixby,et al.  Solving Real-World Linear Programs: A Decade and More of Progress , 2002, Oper. Res..

[63]  Rick Gillman.  Geometry and Gerrymandering , 2002 .

[64]  Juan Carlos,et al.  Design of Homogenous Territorial Units. A Methodological Proposal and Applications , 2004 .

[65]  Fernando Bação,et al.  Applying genetic algorithms to zone design , 2005, Soft Comput..

[66]  Takeshi Shirabe,et al.  A Model of Contiguity for Spatial Unit Allocation , 2005 .

[67]  David T. Stern,et al.  Turfing , 1999, Journal of General Internal Medicine.

[68]  Stan Openshaw,et al.  Modifiable Areal Unit Problem , 2008, Encyclopedia of GIS.