The availability of GIS technology and digital boundaries of census output areas now makes it possible for users to design their own census geography. Three algorithms are described that can be used for this purpose. An Arc/Info implementation is briefly outlined and case studies presented to demonstrate some of the results of explicitly designing zoning systems for use with 1991 Census data.
Get full access to this article
View all access options for this article.
References
1.
AartsEKorstT, 1989Simulated Annealing and Boltzmann Machines (John Wiley, Chichester, Sussex)
2.
AmrheinC, 1992, “Searching for the elusive aggregation effects using age/sex specific migration data”The Operational Geographer1032–38
3.
AmrheinCFlowerdewR, 1992, “The effect of data aggregation on a Poisson regression model of Canadian migration”Environment and Planning A241381–1391
4.
ArbiaG, 1989Spatial Configuration in Statistical Analysis of Regional and Economic Related Problems (Kluwer, Dordrecht)
5.
BattitiRTecchiolliG, 1992, “Parallel biased search for combinatorial optimization: Genetic algorithms and TABU”Microprocessors and Microsystems16351–367
6.
BattitiRTecchiolliG, 1993, “Training neural nets with the reactive tabu search”, unpublished manuscript, obtained by ftp on the internet
7.
BattitiRTecchiolliR, 1994, “The reactive tabu search”ORSA Journal on Computing forthcoming
8.
BlandJ ADawsonG P, 1991, “Tabu search and design optimisation”Computer-Aided Design23195–201
9.
CharltonM ECarverSRaoL, 1995, “GIS and the Census”, in Census Users Handbook Ed. OpenshawS (Longman, Harlow, Essex)
10.
ColeK, 1993, “The 1991 ‘Local Base and Small Area Statistics’”, in The 1991 Census User's Guide Eds DaleAMarshC (HMSO, London) pp 201–247
11.
DenhamC, 1993, “Census geography: An overview”, in The 1991 Census User's Guide Eds DaleAMarshC (HMSO, London) pp 52–69
12.
DudleyG, 1991, “Scale, aggregation and the modifiable areal unit problem”The Operational Geographer928–32
13.
FotheringhamSWongD, 1991, “The modifiable areal unit problem in multivariate statistical analysis”Environment and Planning A231025–1044
14.
GloverF, 1977, “Heuristics for integer programming using surrogate constraints”Decision science8156–166
15.
GloverF, 1986, “Future paths for integer programming and links to artificial intelligence”Computers and Operations Research13533–549
16.
GloverFLagunaM, 1992, “Tabu search”, in Modern Heuristic Techniques for Combinatorial Problems Ed. ReevesC R (Basil Blackwell, Oxford) pp 70–150
17.
GoodchildM F, 1979, “The aggregation problem in location allocation”Geographical Analysis11240–255
18.
HertzAde WerraD, 1987, “Using tabu search techniques for graph colouring”Computing39345–351
19.
KendallM GYuleG U, 1950An Introduction to the Theory of Statistics (Griffin, London)
20.
KirkpatrickSGelattC DVecchiM P, 1983, “Optimisation by simulated annealing”Science220671–680
21.
MetropolisNRosenbluthA WRosenbluthM NTellerA HTellerE, 1953, “Equations for state calculations by fast computing machines”Journal of Chemical Physics211087–1092
22.
MonmomierM, 1991How to Lie With Maps (University of Chicago Press, Chicago, IL)
23.
MorphetC, 1993, “The mapping of small-area census data—a consideration of the role of enumeration district boundaries”Environment and Planning A25267–278
24.
OpenshawS, 1977a, “A geographical solution to scale and aggregation problems in region-building, partitioning, and spatial modelling”Transactions of the Institute of British Geographers, New Series2459–472
25.
OpenshawS, 1977b, “Optimal zoning systems for spatial interaction models”Environment and Planning A9169–184
26.
OpenshawS, 1977c, “Algorithm 3: A procedure to generate pseudo random aggregations of N zones into M zones where M is less than N”Environment and Planning A91423–1428
27.
OpenshawS, 1978a, “An empirical study of some zone design criteria”Environment and Planning A10781–794
28.
OpenshawS, 1978b, “An optimal zoning approach to the study of spatially aggregated data”, in Spatial Representation and Spatial Interaction Eds MasserIBrownP J B (Martinus Nijhoff, Leiden) pp 93–113
29.
OpenshawS, 1984The Modifiable Areal Unit Problem CATMOG 38 (Geoabstracts, Norwich)
30.
OpenshawS, 1988, “Building an automated modelling system to explore a universe of spatial interaction models”Geographical Analysis2031–46
31.
OpenshawS, 1989, “Learning to live with errors in spatial databases”, in The Accuracy of Spatial Databases Eds GoodchildMGopalS (Taylor and Frances, London) pp 263–276
32.
OpenshawS, 1994, “Social costs and benefits of the Census”, in Proceedings of the XVth International Conference of the Data Protection and Privacy CommissionersData Protection Registrar, Springfield House, Water Lane, Wilmslow SK9 5AX, pp 89–97
33.
OpenshawS, 1995, “The future of the census”, in The Census Users Handbook Ed. OpenshawS (Longman, Harlow, Essex) forthcoming
34.
OpenshawSGillardA, 1978, “On the stability of a spatial classification of census enumeration district data”, in Theory and Method in Urban and Regional Analysis Ed. JBateyP W (Pion, London) pp 101–119
35.
OpenshawSTaylorP J, 1979, “A million or so correlation coefficients: Three experiments on the modifiable areal unit problem”, in Statistical Applications in the Spatial Sciences Ed. WrigleyN (Pion, London) pp 127–144
36.
OpenshawSTaylorP J, 1981, “The modifiable areal unit problem”, in Quantitative Geography Eds WrigleyNBennettR J (Routledge, London) pp 60–70
