A tabu search heuristic and adaptive memory procedure for political districting

European Journal of Operational Research

Volumn 144, Issue 1, 2003, Pages 12-26

  Bozkaya, Burcin ^a   Erkut, Erhan ^b   Laporte, Gilbert ^c,d  

^a ESRI   (United States)

^b UNIVERSITY OF ALBERTA   (Canada)

^c HEC MONTRÉAL   (Canada)

^d UNIVERSITÉ DE MONTRÉAL   (Canada)

Author keywords

Multicriteria optimization; Political districting; Tabu search heuristic

Indexed keywords

ADAPTIVE ALGORITHMS; ECONOMIC AND SOCIAL EFFECTS; HEURISTIC METHODS; OPTIMIZATION; PROBLEM SOLVING;

ADAPTIVE MEMORY HEURISTICS;

OPERATIONS RESEARCH;

EID: 0037209524     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(01)00380-0     Document Type: Article

References (39)

1. Aarts E.H.L., Lenstra J.K. Local Search in Combinatorial Optimization. 1997; Wiley, Chichester.
2. Barr R.S., Golden B.L., Kelly J.P., Resende M.G.C., Stewart W.R. Jr. Designing and reporting on computational experiments with heuristic methods. Journal of Heuristics. 1: 1995; 9-32.
3. Bourjolly J.-M., Laporte G., Rousseau J.-M. Découpage électoral automatisé: application à 1'Île de Montréal. INFOR. 19: 1981; 113-124.
4. Bozkaya, B., 1999. Political Districting: A Tabu Search Algorithm and Geographical Interfaces. Ph.D. Thesis, University of Alberta.
5. Browdy M.H. Simulated annealing: An improved computer model for political redistricting. Yale Law and Policy Review. 8: 1990; 163-179.
6. Buchanan J.T., Daellenbach H.G. A comparative evaluation of interactive solution methods for multiple objective decision models. European Journal of Operational Research. 29: 1987; 353-359.
7. Cain B.E. The Reapportionment Puzzle. 1984; University of California Press, Los Angeles.
8. Cordeau J.-F., Gendreau M., Laporte G. A tabu search heuristic for periodic and multi-depot vehicle routing problems. Networks. 30: 1997; 105-119.
9. Eiselt H.A., Laporte G. Combinatorial optimization problems with soft and hard requirements. Journal of the Operational Research Society. 38: 1987; 785-795.
10. Fleischmann B., Paraschis J.N. Solving a large scale districting problem: A case report. Computers and Operations Research. 15: 1988; 521-533.
11. Garfinkel R.S., Nemhauser G.L. Optimal political districting by implicit enumeration techniques. Management Science. 16: 1970; 495-508.
12. Gendreau M., Hertz A., Laporte G. A tabu search heuristic for the vehicle routing problem. Management Science. 40: 1994; 1276-1290.
13. Glover F. Heuristic for integer programming using surrogate constraints. Decision Sciences. 8: 1977; 156-166.
14. Glover F., Laguna M. Tabu Search. 1997; Kluwer, Boston.
15. Government of Alberta. 1997. Report of the Chief Electoral Officer: November, 1996 General Enumeration and Tuesday, March 11, 1997 General Election Twenty-Fourth Legislative Assembly, p. 76.
16. Grilli di Cortona P., Manzi C., Pennisi A., Ricca F., Simeone B. Evaluation and optimization of electoral systems. SIAM Monographs on Discrete Mathematics and Applications, Philadelphia. 1999.
17. Hess S.W., Weaver J.B., Siegfeldt J.N., Whelan J.N., Zhitlau P.A. Nonpartisan political districting by computer. Operations Research. 13: 1965; 998-1006.
18. Kaiser H. An objective method for establishing legislative districts. Midwest Journal of Political Science. 10: 1966; 200-213.
19. Lewyn M.E. How to limit gerrymandering. Florida Law Review. 45: 1993; 403-486.
20. Macmillan, W., Pierce, T., 1992. Optimization modelling in a GIS framework: the problem of political districting. Specialist meeting, April 16-18, 1992. National Center for Geographic Information and Analysis.
21. Mehrotra A., Johnson E.L., Nemhauser G.L. An optimization based heuristic for political districting. Management Science. 44: 1998; 1100-1114.
22. Moen R.D., Nolan T.W., Provost L.P. Improving Quality through Planned Experimentation. 1991; McGraw-Hill, New York.
23. Morrill R.L. Ideal and reality in reapportionment. Annals of the Association of American Geographers. 63: 1973; 463-477.
24. Morrill R.L. Redistricting revisited. Annals of the Association of American Geographers. 66: 1976; 548-556.
25. Nagel S.S. Simplified bipartisan computer redistricting. Stanford Law Review. 17: 1965; 863-899.
26. Nagel S.S. Computers and the law and politics of redistricting. Polity. 5: 1972; 77-93.
27. Niemi R.G., Grofman B., Carlucci C., Hofeller T. Measuring compactness and the role of a compactness standard in a test for partisan and racial gerrymandering. Journal of Politics. 52: 1990; 1155-1181.
28. Osman I.H., Laporte G. Metaheuristics: A bibliography. Laporte G., Osman I.H. Metaheuristics in combinatorial optimization. Annals of Operations Research. 63: 1996; 513-623.
29. Plane D.A. Redistricting reformulated: A maximum interaction/minimum separation objective. Socio-Economic Planning Sciences. 16: 1982; 241-244.
30. Rochat Y., Taillard É.D. Probabilistic diversification and intensification in local search for vehicle routing. Journal of Heuristics. 1: 1995; 147-167.
31. Roy, B., 1985. Méthodologie Multicritère d'Aid à la Décision. Economica, Paris.
32. Taillard É.D. Robust taboo search for the quadratic assignment problem. Parallel Computing. 17: 1991; 433-445.
33. Thoreson J.D., Liittschwager J.M. Legislative districting by computer simulation. Behavioral Science. 12: 1967; 237-247.
34. Vickrey W. On the prevention of gerrymandering. Political Science Quarterly. 76: 1961; 105-110.
35. Vincke P. The Multicriteria Decision Aid. 1992; Wiley, Chichester.
36. Weaver J.B., Hess S.W. A procedure for nonpartisan districting: development of computer techniques. The Yale Law Journal. 72: 1963; 288-308.
37. Williams J.C. Jr. Political redistricting: A review. Papers in Regional Science. 74: 1995; 13-40.
38. Young H.P. Measuring the compactness of legislative districts. Legislative Studies Quarterly. 13: 1988; 105-115.
39. Yu P.L. Multiple criteria decision making: Five basic concepts. Nemhauser G.L., Rinnooy Kan A.H.G., Todd M.J. Optimization. Handbooks in Operations Research and Management Science. vol. 1: 1989; 663-699 North-Holland, Amsterdam.