Solving a home-care districting problem in an urban setting

Journal of the Operational Research Society

Volumn 54, Issue 11, 2003, Pages 1141-1147

  Blais, M ^a   Lapierre, S D ^b,c   Laporte, G ^c,d  

^a Research Module   (Canada)

^b ÉCOLE POLYTECHNIQUE DE MONTRÉAL   (Canada)

^c UNIVERSITÉ DE MONTRÉAL   (Canada)

^d HEC MONTRÉAL   (Canada)

Author keywords

Community health clinic; Districting; Multi criteria optimization; Tabu search

Indexed keywords

ALGORITHMS; ECONOMIC AND SOCIAL EFFECTS; PERSONNEL; PROBLEM SOLVING;

HEALTH CLINICS;

HEALTH CARE;

EID: 0242494408     PISSN: 01605682     EISSN: None     Source Type: Journal    
DOI: 10.1057/palgrave.jors.2601625     Document Type: Article

References (19)

1. 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.
2. 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.
3. Skiera B and Albers S (1998). Costa: contribution optimizing sales territory alignment. Market Sci 17: 196-213.
4. Drexl A and Haase K (1999). Fast approximation methods for sales force deployment. Mngt Sci 45: 1307-1323.
5. 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.
6. Mehrotra A, Johnson EL and Nemhauser GL (1998). An optimization based heuristic for political districting. Mngt Sci 44: 1100-1114.
7. 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.
8. Minciardi R, Puliafito PP and Zoppoli R (1981). A districting procedure for social organization. Eur J Oper Res 8: 47-57.
9. Muyldermans L, Cattrysse D, Van Oudheusden D and Lotan T (2002). Districting for salt spreading operations. Eur J Oper Res 139: 521-532.
10. Hess SW, Weaver JB, Siegfeldt JN, Whelan JN and Zhitlan PA (1965). Nonpartisan political districting by computer. Oper Res 13: 998-1006.
11. Garfinkel RS and Nemhauser GL (1970). Optimal political districting by implicit enumeration techniques. Mngt Sci 16: 495-508.
12. Bourjolly J-M, Laporte G and Rousseau J-M (1981). Découpage électoral automatisé: application àl'Île de Montréal. INFOR 19: 113-124.
13. Browdy MH (1990). Simulated annealing: an improved computer model for political districting. Yale Law Policy Rev 8: 163-179.
14. 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.
15. Eiselt HA and Laporte G (1987). Combinatorial optimization problems with soft and hard requirements. J Oper Res Soc 38: 785-795.
16. 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.
17. Young HP (1988). Measuring the compactness of legislative districts. Legislative Stud Q 13: 105-115.
18. Glover F and Laguna M (1997). Tabu Search. Kluwer: Boston.
19. Gendreau M, Hertz A and Laporte G (1994). A tabu search heuristic for the vehicle routing problem. Mngt Sci 40: 1276-1290.