A center-based modeling approach to solve the districting problem

ABSTRACT This article deals with the districting problem arising in applications such as political districting, police patrol area delineation and sales territory design. The aim of districting is to group basic areal units into geographic districts such that some set of criteria are satisfied, with basic criteria being district balance, compactness and contiguity. This article proposes a center-based mixed-integer linear programming model to solve the districting problem. Given the central units of districts, the model optimizes weighted objectives of district balance and compactness while satisfying contiguous constraints on districts. The performance of the model was tested using three study areas with 297, 324 and 1297 areal units, respectively. Experimentation shows that, using the district centers identified by a multistart weighted K-medoids algorithm, the model instances can be solved optimally or near-optimally. Compared with local search-based algorithms, the center-based approach outperforms metaheuristics such as simulated annealing, variable neighborhood descent, iterative local search and old bachelor acceptance search in terms of solution quality.

[1]  Bruno Simeone,et al.  Local search algorithms for political districting , 2008, Eur. J. Oper. Res..

[2]  Richard L. Church,et al.  The p-Compact-regions Problem , 2014 .

[3]  Andrea Scozzari,et al.  Political districting: from classical models to recent approaches , 2011, 4OR.

[5]  Bruce W. Lamar,et al.  Political district determination using large-scale network optimization , 1997 .

[6]  Francesco Maffioli,et al.  On the complexity of graph tree partition problems , 2004, Discret. Appl. Math..

[7]  J. Weaver,et al.  Nonpartisan Political Redistricting by Computer , 1965 .

[8]  G. Gallego,et al.  How to avoid stockouts when producing several items on a single facility? What to do if you can't? , 1996, Computers & Operations Research.

[9]  Clemens Puppe,et al.  A Computational Approach to Unbiased Districting , 2008, Math. Comput. Model..

[10]  Stefan Nickel,et al.  Towards a unified territorial design approach — Applications, algorithms and GIS integration , 2005 .

[11]  Fernando Ordóñez,et al.  Shape and Balance in Police Districting , 2015 .

[12]  Yong Wang,et al.  A Quadratic Programming Model for Political Districting Problem , 2007 .

[13]  M. Angélica Salazar-Aguilar,et al.  A bi-objective programming model for designing compact and balanced territories in commercial districting , 2011 .

[14]  P. Tseng,et al.  Statistical Data Analysis Based on the L1-Norm and Related Methods , 2002 .

[15]  Peter J. Rousseeuw,et al.  Clustering by means of medoids , 1987 .

[16]  Mehran Hojati,et al.  Optimal political districting , 1996, Comput. Oper. Res..

[17]  Hyun Kim,et al.  Delimitation of Functional Regions Using a p-Regions Problem Approach , 2015 .

[18]  Shaw v.,et al.  THE COMPUTATIONAL COMPLEXITY OF AUTOMATED REDISTRICTING : IS AUTOMATION THE ANSWER ? , 2013 .

[19]  Takeshi Shirabe,et al.  A Model of Contiguity for Spatial Unit Allocation , 2005 .

[20]  M Keane,et al.  The Size of the Region-Building Problem , 1975 .