Districting Problems

  • Jörg KalcsicsEmail author
  • Roger Z. Ríos-Mercado


Districting is the problem of grouping small geographic areas, called basic units, into larger geographic clusters, called districts, such that the latter are balanced, contiguous, and compact. Balance describes the desire for districts of equitable size, for example with respect to workload, sales potential, or number of eligible voters. A district is said to be geographically compact if it is somewhat round-shaped and undistorted. Typical examples for basic units are customers, streets, or zip code areas. Districting problems are motivated by very diverse applications, ranging from political districting over the design of districts for schools, social facilities, waste collection, or winter services, to sales and service territory design. Despite the considerable number of publications on districting problems, there is no consensus on which criteria are eligible and important and, moreover, on how to measure them appropriately. Thus, one aim of this chapter is to give a broad overview of typical criteria and restrictions that can be found in various districting applications as well as ways and means to quantify and model these criteria. In addition, an overview of the different areas of application for districting problems is given and the various solution approaches for districting problems that have been used are reviewed.


Political districting Sales territory design Service districting Districting criteria 



This work was partly supported by grant NI 521/6-1 of the German Research Foundation (DFG). This support is gratefully acknowledged.


  1. Aurenhammar F, Klein R, Lee DT (2013) Voronoi diagrams and Delaunay triangulations. World Scientific, SingaporezbMATHCrossRefGoogle Scholar
  2. Bação F, Lobo V, Painho M (2005) Applying genetic algorithms to zone design. Soft Comput 9:341–348CrossRefGoogle Scholar
  3. Baker JR, Clayton ER, Moore LJ (1989) Redesign of primary response areas for county ambulance services. Eur J Oper Res 41:23–32CrossRefGoogle Scholar
  4. Bard JF, Jarrah AI (2009) Large-scale constrained clustering for rationalizing pickup and delivery operations. Transp Res B Methodol 43:542–561CrossRefGoogle Scholar
  5. Bender M, Meyer A, Kalcsics J, Nickel S (2016) The multi-period service territory design problem – an introduction, a model and a heuristic approach. Transp Res E Logist 96:135–57CrossRefGoogle Scholar
  6. Bender M, Kalcsics J, Nickel S, Pouls M (2018) A branch-and-price algorithm for the scheduling of customer visits in the context of multi-period service territory design. Eur J Oper Res 269:382–396MathSciNetzbMATHCrossRefGoogle Scholar
  7. Benzarti E, Sahin E, Dallery Y (2013) Operations management applied to home care services: analysis of the districting problem. Decis Support Syst 55:587–598CrossRefGoogle Scholar
  8. Bergey PK, Ragsdale CT, Hoskote M (2003) A simulated annealing genetic algorithm for the electrical power districting problem. Ann Oper Res 121:33–55MathSciNetzbMATHCrossRefGoogle Scholar
  9. Blais M, Lapierre SD, Laporte G (2003) Solving a home-care districting problem in an urban setting. J Oper Res Soc 54:1141–1147zbMATHCrossRefGoogle Scholar
  10. Bodin L, Levy L (1991) The arc partitioning problem. Eur J Oper Res 53:393–401zbMATHCrossRefGoogle Scholar
  11. Bong CW, Wang YC (2006) A multi-objective hybrid metaheuristic for zone definition procedure. Int J Ser Oper Inf 1:146–164Google Scholar
  12. Bozkaya B, Erkut E, Laporte G (2003) A tabu search heuristic and adaptive memory procedure for political districting. Eur J Oper Res 144:12–26zbMATHCrossRefGoogle Scholar
  13. Bozkaya B, Erkut E, Haight D, Laporte G (2011) Designing new electoral districts for the city of Edmonton. Interfaces 41:534–547CrossRefGoogle Scholar
  14. Butsch A, Kalcsics J, Laporte G (2014) Districting for arc routing. INFORMS J Comput 26:809–824MathSciNetzbMATHCrossRefGoogle Scholar
  15. Camacho-Collados M, Liberatore J, Angulo JM (2015) A multi-criteria police districting problem for the efficient and effective design of patrol sector. Eur J Oper Res 246:674–684zbMATHCrossRefGoogle Scholar
  16. Carlsson JG, Delage E (2013) Robust partitioning for stochastic multivehicle routing. Oper Res 61:727–744MathSciNetzbMATHCrossRefGoogle Scholar
  17. D’Amico SJ, Wang SJ, Batta R, Rump CM (2002) A simulated annealing approach to police district design. Comput Oper Res 29:667–684zbMATHCrossRefGoogle Scholar
  18. de Assis LS, Franca PM, Usberti FL (2014) A redistricting problem applied to meter reading in power distribution networks. Comput Oper Res 41:65–75MathSciNetzbMATHCrossRefGoogle Scholar
  19. Deb K, Pratap A, Agarwal S, Meyerivan T (2002) A fast elitist multiobjective genetic algorithm: NSGA-II. IEEE Trans Evol Comput 6(2):182–197CrossRefGoogle Scholar
  20. Deckro RF (1977) Multiple objective districting: a general heuristic approach using multiple criteria. Oper Res Q 28:953–961zbMATHCrossRefGoogle Scholar
  21. Dixon RG (1968) Democratic representation: reapportionment in law and politics. Oxford University Press, New YorkGoogle Scholar
  22. Drexl A, Haase K (1999) Fast approximation methods for sales force deployment. Manag Sci 45:1307–1323zbMATHCrossRefGoogle Scholar
  23. Duckham M, Kulik L, Worboys M, Galton A (2008) Efficient generation of simple polygons for characterizing the shape of a set of points in the plane. Pattern Recogn 41:3224–3236zbMATHCrossRefGoogle Scholar
  24. Elizondo-Amaya MG, Ríos-Mercado RZ, Díaz JA (2014) A dual bounding scheme for a territory design problem. Comput Oper Res 44:193–205MathSciNetzbMATHCrossRefGoogle Scholar
  25. Ferland JA, Guénette G (1990) Decision support system for a school districting problem. Oper Res 38:15–21CrossRefGoogle Scholar
  26. Fernández E, Kalcsics J, Nickel S, Ríos-Mercado RZ (2010) A novel maximum dispersion territory design model arising in the implementation of the WEEE-directive. J Oper Res Soc 61:503–514zbMATHCrossRefGoogle Scholar
  27. Fernández E, Kalcsics J, Nickel S (2013) The maximum dispersion problem. Omega 41:721–730CrossRefGoogle Scholar
  28. Fleischmann B, Paraschis JN (1988) Solving a large scale districting problem: a case report. Comput Oper Res 15:521–533zbMATHCrossRefGoogle Scholar
  29. Forman SL, Yue Y (2003) Congressional districting using a TSP-based genetic algorithm. In: Cantú-Paz E, Foster JA, Deb K, David L, Rajkumar R (eds) Genetic and evolutionary computation – GECCO 2003. Lecture Notes in Computer Science, vol 2723. Springer, Berlin, Germany, pp 2072–2083zbMATHCrossRefGoogle Scholar
  30. Galvão LC, Novaes AGN, Souza de Cursi JE, Souza JC (2006) A multiplicatively-weighted Voronoi diagram approach to logistics districting. Comput Oper Res 33:93–114zbMATHCrossRefGoogle Scholar
  31. García-Ayala MG, González-Velarde JL, Ríos-Mercado RZ, Fernández E (2016) A novel model for arc territory design: promoting Eulerian districts. Int Trans Oper Res 23:433–458MathSciNetzbMATHCrossRefGoogle Scholar
  32. Garfinkel RS, Nemhauser GL (1970) Optimal political districting by implicit enumeration techniques. Manag Sci 16:495–508zbMATHCrossRefGoogle Scholar
  33. Gentry S, Chow E, Massie A, Segev D (2015) Gerrymandering for justice: redistricting U.S. liver allocation. Interfaces 45:462–480CrossRefGoogle Scholar
  34. George JA, Lamar BW, Wallace CA (1997) Political district determination using large-scale network optimization. Socio Econ Plan Sci 31:11–28CrossRefGoogle Scholar
  35. Glaze T, Weinberg C (1979) A sales territory alignment program and account planning system. In: Bagozzi RP (ed) Sales management: new developments from behavioral and decision model research. Marketing Science Institute, Cambridge, pp 325–343Google Scholar
  36. Gross JL, Yellen J (2003) Handbook of graph theory. CRC Press, Boca RatonzbMATHCrossRefGoogle Scholar
  37. Hanafi S, Fréville A, Vaca P (1999) Municipal solid waste collection: an effective data structure for solving the sectorization problem with local search methods. INFOR 37:236–254Google Scholar
  38. Handley L, Grofmann B (eds) (2008) Redistricting in comparative perspective. Oxford University Press, New YorkGoogle Scholar
  39. Haugland D, Ho SC, Laporte G (2007) Designing delivery districts for the vehicle routing problem with stochastic demands. Eur J Oper Res 180:997–1010MathSciNetzbMATHCrossRefGoogle Scholar
  40. Hess SW, Samuels SA (1971) Experiences with a sales districting model: criteria and implementation. Manag Sci 18:41–54CrossRefGoogle Scholar
  41. Hess SW, Weaver JB, Siegfeldt HJ, Whelan JN, Zitlau PA (1965) Nonpartisan political redistricting by computer. Oper Res 13:998–1008CrossRefGoogle Scholar
  42. Hojati M (1996) Optimal political districting. Comput Oper Res 23:1147–1161zbMATHCrossRefGoogle Scholar
  43. Horn DL, Hampton CR, Vandenberg AJ (1993) Practical application of district compactness. Polit Geogr 12:103–120CrossRefGoogle Scholar
  44. Howick RS, Pidd M (1990) Sales force deployment models. Eur J Oper Res 48:295–310CrossRefGoogle Scholar
  45. Jarrah AI, Bard JF (2012) Large-scale pickup and delivery work area design. Comput Oper Res 39:3102–3118MathSciNetzbMATHCrossRefGoogle Scholar
  46. Kalcsics J, Nickel S, Schröder M (2005) Towards a unified territorial design approach – applications, algorithms and GIS integration. Top 13:1–74MathSciNetzbMATHCrossRefGoogle Scholar
  47. King DM, Jacobson SH, Sewell EC, Tam Cho WK (2012) Geo-graphs: an efficient model for enforcing contiguity and hole constraints in planar graph partitioning. Oper Res 60:1213–1228MathSciNetzbMATHCrossRefGoogle Scholar
  48. Lei H, Laporte G, Guo B (2012) Districting for routing with stochastic customers. Eur J Transp Logist 1:67–85CrossRefGoogle Scholar
  49. Lei H, Laporte G, Liu Y, Zhang T (2015) Dynamic design of sales territories. Comput Oper Res 56:84–92MathSciNetzbMATHCrossRefGoogle Scholar
  50. Lewyn ME (1993) How to limit gerrymandering. Florida Law Rev 45:403–486Google Scholar
  51. Lin HY, Kao JJ (2008) Subregion districting analysis for municipal solid waste collection privatization. J Air Waste Manag 58:104–111CrossRefGoogle Scholar
  52. Lodish LM (1975) Sales territory alignment to maximize profit. J Mark Res 12:30–36CrossRefGoogle Scholar
  53. López-Pérez JF, Ríos-Mercado RZ (2013) Embotelladoras ARCA uses operations research to improve territory design plans. Interfaces 43:209–220CrossRefGoogle Scholar
  54. Mayorga ME, Bandara D, McLay LA (2013) Districting and dispatching policies for emergency medical service systems to improve patient survival. IIE Trans Healthc Syst Eng 3:39–56CrossRefGoogle Scholar
  55. Mehrotra A, Johnson EL, Nemhauser GL (1998) An optimization based heuristic for political districting. Manag Sci 44:1100–1114zbMATHCrossRefGoogle Scholar
  56. Minciardi R, Puliafito PP, Zoppoli R (1981) A districting procedure for social organizations. Eur J Oper Res 8:47–57zbMATHCrossRefGoogle Scholar
  57. Molina J, Martí R, Caballero R (2007) SSPMO: a scatter tabu search procedure for non-linear multiobjective optimization. INFORMS J Comput 19:91–100MathSciNetzbMATHCrossRefGoogle Scholar
  58. Muyldermans L, Cattrysse D, Van Oudheusden D, Lotan T (2002) Districting for salt spreading operations. Eur J Oper Res 139:521–532zbMATHCrossRefGoogle Scholar
  59. Muyldermans L, Cattrysse D, Van Oudheusden D (2003) District design for arc-routing applications. J Oper Res Soc 54:1209–1221zbMATHCrossRefGoogle Scholar
  60. Nagel SS (1965) Simplified bipartisan computer redistricting. Stanford Law Rev 17:863–899CrossRefGoogle Scholar
  61. Niemi RG, Grofman B, Carlucci C, Hofeller T (1990) Measuring compactness and the role of a compactness standard in a test for partisan and racial gerrymandering. J Polit 52:1155–1181CrossRefGoogle Scholar
  62. Parker FR (1990) Black votes count: political empowerment in Mississippi after 1965. The University of North Carolina Press, Chapel HillCrossRefGoogle Scholar
  63. Puppe C, Tasnádi A (2008) A computational approach to unbiased districting. Math Comput Model 48:1455–1460MathSciNetzbMATHCrossRefGoogle Scholar
  64. Ricca F, Simeone B (2008) Local search algorithms for political districting. Eur J Oper Res 189:1409–1426zbMATHCrossRefGoogle Scholar
  65. Ricca F, Scozzari A, Simeone B (2008) Weighted Voronoi region algorithms for political districting. Math Comput Model 48:1468–1477MathSciNetzbMATHCrossRefGoogle Scholar
  66. Ricca F, Scozzari A, Simeone B (2013) Political districting: from classical models to recent approaches. Ann Oper Res 204:271–299MathSciNetzbMATHCrossRefGoogle Scholar
  67. Ríos-Mercado RZ (2016) Assessing a metaheuristic for large scale commercial districting. Cybern Syst 47:321–338CrossRefGoogle Scholar
  68. Ríos-Mercado RZ, Bard JF (2019) An exact algorithm for designing optimal districts in the collection of waste electric and electronic equipment through an improved reformulation. Eur J Oper Res 276:259–271MathSciNetzbMATHCrossRefGoogle Scholar
  69. Ríos-Mercado RZ, Escalante HJ (2016) GRASP with path relinking for commercial districting. Expert Syst Appl 44:102–113CrossRefGoogle Scholar
  70. Ríos-Mercado RZ, Fernández E (2009) A reactive GRASP for a commercial territory design problem with multiple balancing requirements. Comput Oper Res 36:755–776zbMATHCrossRefGoogle Scholar
  71. Ríos-Mercado RZ, López-Pérez JF (2013) Commercial territory design planning with realignment and disjoint assignment requirements. Omega 41:525–535CrossRefGoogle Scholar
  72. Ríos-Mercado RZ, Salazar-Acosta JC (2011) A GRASP with strategic oscillation for a commercial territory design problem with a routing budget constraint. In: Batyrshin I, Sidorov G (eds) Advances in soft computing: proceedings of the 10th Mexican international conference on artificial intelligence (MICAI 2011), Part II. Lecture Notes in Computer Science, vol 7095, Springer, Heidelberg, pp 307–318Google Scholar
  73. Ríos-Mercado RZ, González-Velarde JL, Maldonado-Flores JR (2017) Tabu search with strategic oscillation for improving collection assignment plans of waste electric and electronic equipment. Technical report PISIS-2017-01, Graduate Program in Systems Engineering, UANL, San Nicolas de los Garza, Mexico, May 2017Google Scholar
  74. Salazar-Aguilar MA, Ríos-Mercado RZ, Cabrera-Ríos M (2011a) New models for commercial territory design. Netw Spat Econ 11:487–507MathSciNetzbMATHCrossRefGoogle Scholar
  75. Salazar-Aguilar MA, Ríos-Mercado RZ, González-Velarde JL (2011b) A bi-objective programming model for designing compact and balanced territories in commercial districting. Transp Res C Emerg Technol 19:885-895CrossRefGoogle Scholar
  76. Salazar-Aguilar MA, Ríos-Mercado RZ, González-Velarde JL, Molina J (2012) Multiobjective scatter search for a commercial territory design problem. Ann Oper Res 199:343–360MathSciNetzbMATHCrossRefGoogle Scholar
  77. Salazar-Aguilar MA, González-Velarde JL, Ríos-Mercado RZ (2013a) A divide-and-conquer approach for a commercial territory design problem. Computación y Sistemas 16:309–320Google Scholar
  78. Salazar-Aguilar MA, Ríos-Mercado RZ, González-Velarde JL (2013b) GRASP strategies for a bi-objective commercial territory design problem. J Heuristics 19:179–200CrossRefGoogle Scholar
  79. Schoepfle OB, Church RL (1991) A new network representation of a “classic” school districting problem. Socio Econ Plan Sci 25:189–197CrossRefGoogle Scholar
  80. Schröder M (2001) Gebiete optimal aufteilen. PhD thesis, Universität Karlsruhe, Karlsruhe, Germany (in German)Google Scholar
  81. Shirabe T (2009) Districting modeling with exact contiguity constraints. Environ Plan B 36:1053–1066CrossRefGoogle Scholar
  82. Simchi-Levi D, Kaminsky P, Simchi-Levi E (2003) Designing and managing the supply chain: concepts, strategies, and case studies, 2nd edn. McGraw-Hill, New YorkzbMATHGoogle Scholar
  83. Steiner MTA, Datta D, Neto PJS, Scarpin CT, Figueira JR (2015) Multi-objective optimization in partitioning the healthcare system of Parana State in Brazil. Omega 52:53–64CrossRefGoogle Scholar
  84. Tavares-Pereira F, Figueira JR, Mousseau V, Roy B (2007) Multiple criteria districting problems: the public transportation network pricing system of the Paris region. Ann Oper Res 154:69–92MathSciNetzbMATHCrossRefGoogle Scholar
  85. Vickrey W (1961) On the prevention of gerrymandering. Polit Sci Q 76:105–110CrossRefGoogle Scholar
  86. Webster G (2013) Reflections on current criteria to evaluate redistricting plans. Polit Geogr 32:3–14CrossRefGoogle Scholar
  87. Wei BC, Chai WY (2004) A multiobjective hybrid metaheuristic approach for GIS-based spatial zoning model. J Math Model Algorithms 3:245–261zbMATHCrossRefGoogle Scholar
  88. Williams JC Jr (1995) Political redistricting: a review. Pap Reg Sci 74:13–40CrossRefGoogle Scholar
  89. Young HP (1988) Measuring the compactness of legislative districts. Legis Stud Q 13:105–115CrossRefGoogle Scholar
  90. Zhong H, Hall RW, Dessouky M (2007) Territory planning and vehicle dispatching with driver learning. Transp Sci 41:74–89CrossRefGoogle Scholar
  91. Zhou G, Min H, Gen M (2002) The balanced allocation of customers to multiple distribution centers in a supply chain network: a genetic algorithm approach. Comput Ind Eng 43:251–261CrossRefGoogle Scholar
  92. Zoltners AA, Sinha P (1983) Sales territory alignment: a review and model. Manag Sci 29:1237–1256zbMATHCrossRefGoogle Scholar
  93. Zoltners AA, Sinha P (2005) Sales territory design: thirty years of modeling and implementation. Mark Sci 24:313–331CrossRefGoogle Scholar

Copyright information

© Springer Nature Switzerland AG 2019

Authors and Affiliations

  1. 1.School of MathematicsThe University of EdinburghEdinburghUK
  2. 2.Universidad Autónoma de Nuevo León (UANL), Department of Mechanical and Electrical EngineeringSan Nicolas de los GarzaMexico

Personalised recommendations