Skip to main content

Political Districting for Elections to the German Bundestag: An Optimization-Based Multi-stage Heuristic Respecting Administrative Boundaries

  • Conference paper
  • First Online:
Operations Research Proceedings 2014

Part of the book series: Operations Research Proceedings ((ORP))

Abstract

According to the legal requirements for Elections to the German Bundestag the problem of partitioning Germany into electoral districts can be formulated as a multi-criteria graph partition problem. To solve this regularly current problem, an optimization-based heuristic is introduced and successfully applied to German population data.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

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

    Google Scholar 

  2. De Simone, C., Lucertini, M., Pallottino, S., Simeone, B.: Fair dissections of spiders, worms, and caterpillars. Networks 20(3), 323–344 (1990)

    Article  Google Scholar 

  3. Hess, S.W., Weaver, J.B., Siegfeldt, H.J., Whelan, J.N., Zitlau, P.A.: Nonpartisan political redistricting by computer. Oper. Res. 13(6), 998–1006 (1965)

    Article  Google Scholar 

  4. Ito, T., Zhou, X., Nishizeki, T.: Partitioning a graph of bounded tree-width to connected subgraphs of almost uniform size. J. Discret. Algorithm. 4(1), 142–154 (2006)

    Article  Google Scholar 

  5. Lucertini, M., Perl, Y., Simeone, B.: Most uniform path partitioning and its use in image processing. Discret. Appl. Math. 42(2–3), 227–256 (1993)

    Article  Google Scholar 

  6. Mehrotra, A., Johnson, E.L., Nemhauser, G.L.: An optimization based heuristic for political districting. Manag. Science. 44(8), 1100–1114 (1998)

    Article  Google Scholar 

  7. Sainte-Laguë, A.: La représentation proportionnelle et la méthode des moindres carrés. Annales scientifiques de l’École Normale Supérieure. 27, 529–542 (1910)

    Google Scholar 

  8. Shapefile der Verwaltungsgrenzen: Bundesamt für Kartographie und Geodäsie. (2013)—http://www.zensus2011.de, http://www.bkg.bund.de. Cited 30 Jul 2014

  9. Vickrey, W.S.: On the prevention of gerrymandering. Pol. Sci. Quar. 76(1), 105–110 (1961)

    Article  Google Scholar 

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

    Article  Google Scholar 

  11. Young, H.P.: Measuring the compactness of legislative districts. Legis. Stud. Q. 13(1), 105–115 (1988)

    Article  Google Scholar 

  12. Zensus 2011: Bevölkerung—Ergebnisse des Zensus am 9. Mai 2011. Statistisches Bundesamt, Wiesbaden. (2014)—http://www.zensus2011.de. Cited 30 Jul 2014

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Sebastian Goderbauer .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing Switzerland

About this paper

Cite this paper

Goderbauer, S. (2016). Political Districting for Elections to the German Bundestag: An Optimization-Based Multi-stage Heuristic Respecting Administrative Boundaries. In: Lübbecke, M., Koster, A., Letmathe, P., Madlener, R., Peis, B., Walther, G. (eds) Operations Research Proceedings 2014. Operations Research Proceedings. Springer, Cham. https://doi.org/10.1007/978-3-319-28697-6_26

Download citation

Publish with us

Policies and ethics