Solving a home-care districting problem in an urban setting

This article describes a districting study undertaken for the Côte-des-Neiges local community health clinic in Montreal. A territory must be partitioned into six districts by suitably grouping territorial basic units. Five districting criteria must be respected: indivisibility of basic units, respect for borough boundaries, connectivity, visiting personnel mobility, and workload equilibrium. The last two criteria are combined into a single objective function and the problem is solved by means of a tabu search technique that iteratively moves a basic unit to an adjacent district or swaps two basic units between adjacent districts. The problem was solved and the clinic management confirmed its satisfaction after a 2 year implementation period.

[1]  Gilbert Laporte,et al.  A tabu search heuristic and adaptive memory procedure for political districting , 2003, Eur. J. Oper. Res..

[2]  Bruno Simeone,et al.  Evaluation and Optimization of Electoral Systems , 1987 .

[3]  Gilbert Laporte,et al.  Combinatorial Optimization Problems with Soft and Hard Requirements , 1987 .

[4]  Justin A. Myrick,et al.  The Public Health Care Planning Problem: A Case Study using Geographic Information Systems , 1999, Journal of Medical Systems.

[5]  B. Grofman,et al.  Measuring Compactness and the Role of a Compactness Standard in a Test for Partisan and Racial Gerrymandering , 1990, The Journal of Politics.

[6]  G. Laporte,et al.  Decoupage Electoral Automatise: Application A L’Lle De Montreal , 1981 .

[7]  Michelle H Browdy Simulated Annealing: An Improved Computer Model for Political Redistricting , 1990 .

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

[9]  Sönke Albers,et al.  COSTA: Contribution Optimizing Sales Territory Alignment , 1998 .

[10]  Gilbert Laporte,et al.  A Tabu Search Heuristic for the Vehicle Routing Problem , 1991 .

[11]  R. Minciardi,et al.  A districting procedure for social organizations , 1981 .

[12]  Rajan Batta,et al.  A simulated annealing approach to police district design , 2002, Comput. Oper. Res..

[13]  W. Macmillan Optimization modelling in a GIS framework:The problem of political redistricting. , 1994 .

[14]  H. Young Measuring the Compactness of Legislative Districts , 1988 .

[15]  G. Nemhauser,et al.  An Optimization Based Heuristic for Political Districting , 1998 .

[16]  Peter A. Rogerson,et al.  Spatial Analysis and GIS , 1994 .

[17]  Andreas Drexl,et al.  Fast Approximation Methods for Sales Force Deployment , 1999 .

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

[19]  Luc Muyldermans,et al.  Districting for salt spreading operations , 2002, Eur. J. Oper. Res..