Applying genetic algorithms to zone design

Soft Computing

Volumn 9, Issue 5, 2005, Pages 341-348

  Bação, Fernando ^a   Lobo, Victor ^a   Painho, Marco ^a  

^a NOVA INFORMATION MANAGEMENT SCHOOL NOVA IMS   (Portugal)

Author keywords

Electoral districting; Genetical gorithms; Zone design

Indexed keywords

C (PROGRAMMING LANGUAGE); COMPUTATIONAL COMPLEXITY; ENCODING (SYMBOLS); HEURISTIC METHODS; LEARNING SYSTEMS; OPTIMIZATION;

ELECTORAL DISTRICTING; ZONE DESIGN;

GENETIC ALGORITHMS;

EID: 17244379243     PISSN: 14327643     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00500-004-0413-4     Document Type: Article

References (37)

1. Openshaw S (1996) Developing GIS-relevant zone-based spatial analysis methods. In: Longley P, Batty M, (eds) Spatial Analysis: Modelling in a GIS environment, GeoInformation International, Cambridge, pp. 55-73
2. Macmillan B, Pierce T (1994) Optimization Modelling in a GIS Framework: The Problem of Political Redistricting. In: Fotheringham S, Rogerson P (eds) Spatial analysis and GIS. Taylor&Francis Inc, Bristol, pp. 221-246
3. George JA, Lamar BW, Wallace CA (1997) Political District Determination Using Large-Scale Network Optimization. Socio-Economic Plan Sci 31 (1):11-28
4. Horn MET, (1995) Solution techniques for large regional partitioning problems. Geographical Anal, 27, pp. 230-248
5. Mehrotra A, Johnson EL, Nemhauser GL (1998) An optimization based heuristic for political districting. Manage Sci, 44, pp. 1100-1114
6. Martin D, (2000) Automated zone design in GIS. In: Atkinson P, Martin D (eds) GIS and Geocomputation, Innovations in GIS 7: Taylor and Francis, London, pp. 103-113
7. Ferland JA, Guénette G (1990) Decision support system for a school districting problem. Operations Res. 38 15-21
8. Openshaw S, Rao L (1995) Algorithms for reengineering 1991 Census Geography. Environ Plan A 27 425-446
9. Openshaw S Alvanides S, (1999) Applying geocomputation to the analysis of spatial distributions, In: Longley PA, Goodchild MF, Maguire DJ, Rhind DW (eds) Geographical Information Systems Principles, Techniques, Management and Applications, Wiley, Chichester, pp. 267-282
10. Haining R, Wise S, Blake M (1994) Constructing regions for small-area analysis-material deprivation and colorectal cancer. J. Public Health Med, 16, pp. 457-469
11. Fleischmann BJ, Paraschis N (1988) Solving a large scale districting problem: A case report. Comput. Operations Res 15:521-533
12. Martin D (1997) From enumeration districts to output areas: experiments in the automated creation of a census output geography. Popul Trends 88 pp. 36-42
13. Martin D (1998) 2001 Census output areas: From concept to prototype. Population Trends, 94 pp. 19-24
14. Williams JC (1995) Political Redistricting - A Review. Pap Reg Sci 74(1):13-39
15. Vickrey W (1961) On The Prevention of Gerrymandering. Political Sci Q 76 pp. 105-110
16. Harris CC (1964) A scientific method of districting. Behav Sci 9 pp. 219-225
17. Thoreson JD, Liittschwager JM (1967) Legislative districting by computer simulation. Behav Sci 12 pp. 237-247
18. Garfinkel RS, Nemhauser GL(1970) Optimal political districting by implicit enumeration techniques. Manage Sci 16 pp. 495-508
19. Nagel SS, (1972) Computers and the law and politics of redistricting. Polity 5: Pp. 77-93
20. Weaver JB, Hess SW, (1963) A procedure for nonpartisan districting: development of computer techniques. Yale Law J 72 pp. 288-308
21. Altman M (1998) Modeling the Effect of Mandatory District Compactness on Partisan Gerrymanders. Political Geography 17 (8): 989-1012
22. Correa ES, Steiner MTA, Freitas AA, Carnieri C (2001) A genetic algorithm for the P-median problem. Proc. 2001 Genetic and Evolutionary Computation Conf. (GECCO-2001), pp. 1268-1275. Morgan Kaufmann
23. Murthy CA, Chowdhury N (1996) In search of optimal clusters using genetic algorithms. Pattern Recognit Lett, vol. 17, pp. 825-832
24. Ankenbrandt CA, Buckles BP, Petry FE, (1990) Scene recognition using genetic algorithms with semantic nets. Pattern Recognit Lett 11(4), pp. 285-293
25. Belew RK, Booker LB (eds) (1991) Proceedings of the Fourth International Conference on Genetic Algorithms. La Jolla, CA: Morgan Kaufmann
26. Back T, Fogel DB, Michalewicz Z (eds) (1997) Handbook of Evolutionary Computation. Oxford University Press, NewYork
27. Morril RL (1981) Political redistricting and geographic theory. Association of American Geographers, Seattle
28. Hayes B (1996) Computing Science: Machine Politics. American Scientist, vol. 84, No. 6, November-December, pp. 522-526
29. Altman M, (1997) The Computational Complexity of Automated Redistricting: Is Automation the Answer?. Rutgers Comput and Technol Law J 23 (1):81-142
30. Rossiter DJ, Johnston RJ (1981) Program GROUP: The identification of all possible solutions to a constituency-delimitation problem. Environ Plan A 13:231-8
31. Cliff AD, Hagget P (1970) On the efficiency of alternative aggregations in region-building problems. Environ Plan 2, pp. 285-294
32. Anderberg MR (1973) Cluster Analysis for Applications. Academic Press
33. Vilares M, Nazareth M, Painho M, Bacao F, Coelho P (1998) Gis And The Design Of Electoral Districts. in Gisplanet 98, International Conference And Exhibition On Geographic Information, Lisboa 7-11 September 1998
34. Keane M (1975) The size of the region-building problem. Environ Plan A 7, pp. 575-577
35. Fogel DB (2000) Evolutionary Computation: Toward a New Philosophy of Machine Intelligence. 2nd edn, IEEE Press, Piscataway, NJ
36. Goldberg DE, (1989) Genetic Algorithms in Search, Optimization and Machine Learning. Addison-Wesley, Reading, Mass
37. University of Leeds, (2003) ZDES, http://www.geog.leeds.ac.uk/pgrads/ s.alvanides/zdes3.html, (June 2003)