Math-Heuristic for a Territory Design Problem

In this work, we study a territory design problem. This type of problem consists of dividing a geographic area into territories that meet certain characteristics or planning criteria. The problem studied in this paper considers the division of a geographical area into compact, contiguous and balanced territories, with respect to one or several measures of activity. To find feasible solutions for the problem, we propose a math-heuristic. The method first constructs solutions, using a minisum objective as measure of dispersion, that are balanced with respect to the different activity measures. Subsequently, the solutions are modified so that they satisfy the contiguity constraints. To test the performance of the proposed method, we use a set of test instances available in the literature. The results obtained are compared with the optimal solutions of the test instances. According to this comparison, the proposed method provides optimal solutions or solutions very close to the optimal solution with a reasonable computational effort compared to that required by an exact solution method.

[1]  Miguel Constantino,et al.  Imposing Connectivity Constraints in Forest Planning Models , 2013, Oper. Res..

[2]  David Ronen.  Sales territory alignment for sparse accounts , 1983 .

[3]  Juan A. Díaz,et al.  A dual bounding scheme for a territory design problem , 2014, Comput. Oper. Res..

[4]  M. A. Salazar-Aguilar,et al.  New Models for Commercial Territory Design , 2011 .

[5]  Gilbert Laporte,et al.  Solving a home-care districting problem in an urban setting , 2003, J. Oper. Res. Soc..

[6]  Takeshi Shirabe,et al.  Districting Modeling with Exact Contiguity Constraints , 2009 .

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

[8]  Jörg Kalcsics,et al.  A novel maximum dispersion territory design model arising in the implementation of the WEEE-directive , 2010, J. Oper. Res. Soc..

[9]  Gary King,et al.  Compactness: An R Package for Measuring Legislative District Compactness If You Only Know it When You See It , 2018 .

[10]  Wei Xu,et al.  A non-dominated sorting genetic algorithm for the location and districting planning of earthquake shelters , 2014, Int. J. Geogr. Inf. Sci..

[11]  Sidney W. Hess,et al.  Experiences with a Sales Districting Model: Criteria and Implementation , 1971 .

[12]  Federico Liberatore,et al.  A multi-criteria Police Districting Problem for the efficient and effective design of patrol sector , 2015, Eur. J. Oper. Res..

[13]  M. Fisher,et al.  A multiplier adjustment method for the generalized assignment problem , 1986 .

[14]  Wilfredo F. Yushimito,et al.  A hybrid K-means and integer programming method for commercial territory design: a case study in meat distribution , 2020, Ann. Oper. Res..

[15]  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.

[16]  Elena Fernández,et al.  A reactive GRASP for a commercial territory design problem with multiple balancing requirements , 2009, Comput. Oper. Res..

[17]  Eric Alfredo Rincón García,et al.  A comparative study of population-based algorithms for a political districting problem , 2017, Kybernetes.

[18]  G. Nemhauser,et al.  Optimal Political Districting by Implicit Enumeration Techniques , 1970 .

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