Skip to main content
SpringerLink
Log in

Political districting: from classical models to recent approaches

  • Invited Survey
  • Published:
4OR Aims and scope Submit manuscript

Abstract

The political districting problem has been studied since the 60’s and many different models and techniques have been proposed with the aim of preventing districts’ manipulation which may favor some specific political party (gerrymandering). A variety of political districting models and procedures was provided in the Operations Research literature, based on single- or multiple-objective optimization. Starting from the forerunning papers published in the 60’s, this article reviews some selected optimization models and algorithms for political districting which gave rise to the main lines of research on this topic in the Operartions Research literature of the last five decades.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Aarts E, Lenstra JK (2003) Local search in combinatorial optimization. Princeton University Press, Princeton

    Google Scholar 

  • Altman M (1997) Is automation the answer? The computational complexity of automated redistricting. Rutgers Comput Law Technol J 23: 81–142

    Google Scholar 

  • Apollonio N, Lari L, Puerto J, Ricca F, Simeone B (2008) Polynomial algorithms for partitioning a tree into single-center subtrees to minimize flat service costs. Networks 51: 78–89

    Article  Google Scholar 

  • Arcese F, Battista MG, Biasi O, Lucertini M, Simeone B (1992) Un modello multicriterio per la distrettizzazione elettorale: la metodologia C.A.P.I.R.E. A.D.E.N. (unpublished manuscript)

  • Aurenhammer F, Edelsbrunner H (1984) An optimal algorithm for constructing the weighted Voronoi diagram in the plane. Pattern Recognit 17: 251–257

    Article  Google Scholar 

  • Bação F, Lobo V, Painho M (2005) Applying genetic algorithms to zone-design. Soft Comput 9: 341–348

    Article  Google Scholar 

  • Bodin LD (1973) A district experiment with a clustering algorithm. Ann N Y Accad Sci 219: 209–214

    Article  Google Scholar 

  • Laporte G, Rousseau JM (1981) Découpage electoral automatisé: application a l’Ile de Montréal. INFOR 19: 113–124 (in French)

    Google Scholar 

  • Bozkaya B, Erkut E, Laporte G (2003) A tabu search heuristic and adaptive memory procedure for political districting. Eur J Oper Res 144: 12–26

    Article  Google Scholar 

  • Browdy MH (1990) Simulated annealing: an improved computer model for political redistricting. Yale Law Policy Rev 8: 163–179

    Google Scholar 

  • Bussamra NM, França PM, Sosa NG (1996) Legislative districting by heuristic methods. Proc of the Annual Conference of the Italian Operations Research Society

  • Carlson RC, Nemhauser GL (1966) Scheduling to minimize interaction cost. Oper Res 14: 52–58

    Article  Google Scholar 

  • Chou C, Li SP (2006) Taming the gerrymander—statistical physics approach to political districting problem. Phisica A 369: 799–808

    Article  Google Scholar 

  • Cordone R (2001) A short note on graph tree partition problems with assignment or communication objective functions. Internal Report DEI 2001.7, Politecnico di Milano, 2001

  • Duque JC, Ramos R, Suriñach J (2007) Supervised regionalization methods: a survey. Intern Reg Sci Rev 30: 195–220

    Article  Google Scholar 

  • Forman SL, Yue Y (2003) Congressional districting using a TSP-based genetic algorithm. Lect Note Comput Sci 2724: 2072–2083

    Article  Google Scholar 

  • Forrest E (1964) Apportionment by computer. Am Behav Sci 7: 23–35

    Article  Google Scholar 

  • Garey MR, Johnson DS (1979) Computers and intractability. A guide to the theory of NP-completeness. W. H. Freeman and Company, New York

    Google Scholar 

  • Garfinkel RS, Nemhauser GL (1970) Optimal political districting by implicit enumeration techniques. Manag Sci 16: 495–508

    Article  Google Scholar 

  • George JA, Lamar BW, Wallace CA (1997) Political district determination using large-scale network optimization. Socioecon Plann Sci 31: 11–28

    Article  Google Scholar 

  • Glover F, Laguna M (1997) Tabu search. Kluwer, Boston

    Book  Google Scholar 

  • Goldberg D (1989) Genetic algorithms in search, optimization and machine learning. Addison-Wesley, Reading

    Google Scholar 

  • Grilli di Cortona P, Manzi C, Pennisi A, Ricca F, Simeone B (1999) Evaluation and optimization of electoral systems, SIAM Monographs on Discrete Mathematics and Applications. SIAM (Society for Industrial and Applied Mathematics), Philadelphia

    Google Scholar 

  • Harary F (1994) Graph theory. Addison-Wesley, Reading

    Google Scholar 

  • Hess SW, Weaver JB, Siegfelatt HJ, Whelan JN, Zitlau PA (1965) Nonpartisan political redistricting by computer. Oper Res 13: 998–1006

    Article  Google Scholar 

  • Hojati M (1996) Optimal political districting. Comput Oper Res 23: 1147–1161

    Article  Google Scholar 

  • Horn DL, Hampton CR, Vandenberg AJ (1993) Practical application of district compactness. Polit Geogr 12: 103–120

    Article  Google Scholar 

  • Hu TC, Kahng AB, Tsao CWA (1995) Old bachelor acceptance: a new class of non-monotone threshold accepting methods. ORSA J Comput 7: 417–425

    Google Scholar 

  • Kaiser HF (1967) An objective method for establishing legislative districts. Midwest J Polit Sci 10: 200–213

    Article  Google Scholar 

  • Kalcsics J, Nickel S, Schröder M (2005) Towards a unified territorial design approach—applications, algorithms and GIS integration. TOP 13: 1–74

    Article  Google Scholar 

  • Li Z, Wang R, Wang Y (2007) A quadratic programming model for political districting problem. In: Proceedings of the firsst international symposium on optimization and system biology (OSB). Bejing, China, August 8–10, 2007

  • Lin S, Kernighan BW (1973) An effective heuristic algorithm for the traveling-salesman problem. Oper Res 21: 498–516

    Article  Google Scholar 

  • Mehrotra A, Johnson EL, Nemhauser GL (1998) An optimization based heuristic for political districting. Manag Sci 44: 1100–1114

    Article  Google Scholar 

  • Miller S (2007) The problem of redistricting: the use of centroidal Voronoi diagrams to build unbiased congressional districts. Master thesis, Withmann College, USA. http://www.whitman.edu/mathematics/SeniorProjectArchive/2007/millersl.pdf

  • Nemoto T, Hotta K (2003) Modelling and solution of the problem of optimal electoral districting. Commun OR Soc Jpn 48:300–306. http://www.orsj.or.jp/~archive/pdf/bul/Vol.4804300.pdf (in Japanese)

  • Niemi RG, Grofman B, Carlucci C, Hofeller T (1990) Measuring compactness and the role of a compactness standard in a test for partisan and ratial gerrymandering. J Polit 52: 1155–1182

    Article  Google Scholar 

  • Nygreen B (1988) European assembly constituencies for Wales. Comparing of methods for solving a political districting problem. Math Program 42: 159–169

    Article  Google Scholar 

  • Osman IH, Laporte G (1996) Metaheuristics: a bibliography. Ann Oper Res 63: 513–628

    Article  Google Scholar 

  • Ricca F, Scozzari A, Simeone B (2007) Weighted Voronoi region algorithms for political districting. In: Proceedings of the international seminars. Schloss Dagstuhl, 07311/2007, Frontiers of electronic voting. http://kathrin.dagstuhl.de/07311/Materials/

  • Ricca F, Scozzari A, Simeone B (2008) Weighted Voronoi region algorithms for political districting. Math Comput Model 48: 1468–1477

    Article  Google Scholar 

  • Ricca F (1996) Algoritmi di ricerca locale per la distrettizzazione elettorale. Proc of the Annual Conference of the Italian Operations Research Society

  • Ricca F, Simeone B (1997) Political districting: traps, criteria, algorithms and trade-offs. Ric Oper 27: 81–119

    Google Scholar 

  • Ricca F, Simeone B (2008) Local search algorithms for political districting. Eur J Oper Res 189: 1409–1426

    Article  Google Scholar 

  • Sahni S (1974) Computationally related problems. Siam J Comput 3: 262–279

    Article  Google Scholar 

  • Simeone B (1978) Optimal graph partitioning. Proc of the Annual Conference of the Italian Operations Research Society

  • Tavares-Pereira F, Fig JR, Mousseau V, Roy B (2007) Multiple criteria districting problem. The public transportation network pricing system of the Paris region. Ann Oper Res 154: 69–92

    Article  Google Scholar 

  • Vickrey W (1961) On the prevention of gerrymandering. Polit Sci Quart 76: 105–110

    Article  Google Scholar 

  • Weaver JB, Hess SW (1963) A procedure for nonpartisan districting: development of computer techniques. Yale Law J 73: 288–308

    Article  Google Scholar 

  • Yamada T, Takahashi H, Kataoka S (1996) A heuristic algorithm for the mini-max spanning forest problem. Eur J Oper Res 91: 565–572

    Article  Google Scholar 

  • Yamada T (2009) A mini-max spanning forest approach to the political districting problem. Int J Syst Sci 40: 471–477

    Article  Google Scholar 

  • Young HP (1988) Measuring compactness of legislative districts. Legis Stud Quart 13: 105–111

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dipartimento di Scienze Statistiche, Sapienza Università di Roma, Rome, Italy

    Federica Ricca & Bruno Simeone

  2. Facoltà di Economia, Università Telematica delle Scienze Umane “Niccolò Cusano”, Rome, Italy

    Andrea Scozzari

Authors
  1. Federica Ricca
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Andrea Scozzari
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Bruno Simeone
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Federica Ricca.

Additional information

Federica Ricca and Andrea Scozzari dedicate this work to their dear friend Bruno Simeone, who passed away unexpectedly on October 10, 2010. He was the prime mover of their common research in this field. He started productive research on electoral systems with political districting which remained throughout the years one of his main interests. This paper is meant to be both a tribute to the deep scientific oeuvre of Bruno and a wish for further developments in this area.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Ricca, F., Scozzari, A. & Simeone, B. Political districting: from classical models to recent approaches. 4OR-Q J Oper Res 9, 223–254 (2011). https://doi.org/10.1007/s10288-011-0177-5

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10288-011-0177-5

Keywords

MSC classification (2000)

Search

Navigation