Skip to main content
Log in

Solving a home-care districting problem in an urban setting

  • Case-oriented Paper
  • Published:
Journal of the Operational Research Society

Abstract

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.

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

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Figure 1
Figure 2
Figure 3
Figure 4
Figure 5

Similar content being viewed by others

References

  • Lapierre SD, Myrick JA and Russell G (1999). The public health care planning problem: a case study using geographic information systems. J Med Systems 23: 401–417.

    Article  Google Scholar 

  • D'Amico SJ, Wang S-J, Batta R and Rump CM (2002). A simulated annealing approach to police district design. Comput Oper Res 29: 667–684.

    Article  Google Scholar 

  • Skiera B and Albers S (1998). Costa: contribution optimizing sales territory alignment. Market Sci 17: 196–213.

    Article  Google Scholar 

  • Drexl A and Haase K (1999). Fast approximation methods for sales force deployment. Mngt Sci 45: 1307–1323.

    Article  Google Scholar 

  • Bozkaya B, Erkut E and Laporte G (2003). A tabu search heuristic and adaptive memory procedure for political districting. Eur J Oper Res 144: 12–26.

    Article  Google Scholar 

  • Mehrotra A, Johnson EL and Nemhauser GL (1998). An optimization based heuristic for political districting. Mngt Sci 44: 1100–1114.

    Article  Google Scholar 

  • Grilli di Cortona P, Manzi C, Pennisi A, Ricca F and Simeone B (1999). Evaluation and Optimization of Electoral Systems. SIAM Monographs on Discrete Mathematics and Applications: Philadelphia.

  • Minciardi R, Puliafito PP and Zoppoli R (1981). A districting procedure for social organization. Eur J Oper Res 8: 47–57.

    Article  Google Scholar 

  • Muyldermans L, Cattrysse D, Van Oudheusden D and Lotan T (2002). Districting for salt spreading operations. Eur J Oper Res 139: 521–532.

    Article  Google Scholar 

  • Hess SW, Weaver JB, Siegfeldt JN, Whelan JN and Zhitlan PA (1965). Nonpartisan political districting by computer. Oper Res 13: 998–1006.

    Article  Google Scholar 

  • Garfinkel RS and Nemhauser GL (1970). Optimal political districting by implicit enumeration techniques. Mngt Sci 16: 495–508.

    Article  Google Scholar 

  • Bourjolly J-M, Laporte G and Rousseau J-M (1981). Découpage électoral automatisé: application à l'Île de Montréal. INFOR 19: 113–124.

    Google Scholar 

  • Browdy MH (1990). Simulated annealing: an improved computer model for political districting. Yale Law Policy Rev 8: 163–179.

    Google Scholar 

  • Macmillan W and Pierce T (1994). Optimization modelling in a GIS framework: the problem of political districting. In: Fotheringham S and Rogerson P. Spatial Analysis and GIS. Taylor and Francis: London.

    Google Scholar 

  • Eiselt HA and Laporte G (1987). Combinatorial optimization problems with soft and hard requirements. J Oper Res Soc 38: 785–795.

    Article  Google Scholar 

  • Niemi RG, Grofman B, Carlucci C and Hofeller T (1990). Measuring compactness and the role of a compactness standard in a test for partisan and racial gerrymandering. J Polit 52: 1155–1181.

    Article  Google Scholar 

  • Young HP (1988). Measuring the compactness of legislative districts. Legislative Stud Q 13: 105–115.

    Article  Google Scholar 

  • Glover F and Laguna M (1997). Tabu Search. Kluwer: Boston.

  • Gendreau M, Hertz A and Laporte G (1994). A tabu search heuristic for the vehicle routing problem. Mngt Sci 40: 1276–1290.

    Article  Google Scholar 

Download references

Acknowledgements

This research was partly supported by the Canadian Natural Sciences and Engineering Research Council under Grants OGP0184219 and OGP0039682, by the Quebec FCAR program and by the Côte-des-Neiges CLSC. This support is gratefully acknowledged. Thanks are also due to the staff of the Côte-des-Neiges CLSC for their support and to ESRI Canada for their complimentary provision of ArcView. Finally, we thank the referees for their valuable comments.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to G Laporte.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Blais, M., Lapierre, S. & Laporte, G. Solving a home-care districting problem in an urban setting. J Oper Res Soc 54, 1141–1147 (2003). https://doi.org/10.1057/palgrave.jors.2601625

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1057/palgrave.jors.2601625

Keywords

Navigation