Geoscience Reference
In-Depth Information
References
Aurenhammar F, Klein R, Lee DT (2013) Voronoi diagrams and Delaunay triangulations. World
Scientific, Singapore
Bação F, Lobo V, Painho M (2005) Applying genetic algorithms to zone design. Soft Comput
9:341-348
Baker J, Clayton E, Moore L (1989) Redesign of primary response areas for county ambulance
services. Eur J Oper Res 41:23-32
Bard JF, Jarrah AI (2009) Large-scale constrained clustering for rationalizing pickup and delivery
operations. Transp Res B Methodol 43:542-561
Benzarti E, Sahin E, Dallery Y (2013) Operations management applied to home care services:
analysis of the districting problem. Decis Support Syst 55:587-598
Bergey P, Ragsdale C, Hoskote M (2003) A simulated annealing genetic algorithm for the electrical
power districting problem. Ann Oper Res 121:33-55
Blais M, Lapierre S, Laporte G (2003) Solving a home-care districting problem in an urban setting.
J Oper Res Soc 54:1141-1147
Bodin L, Levy L (1991) The arc partitioning problem. Eur J Oper Res 53:393-401
Bozkaya B, Erkut E, Laporte G (2003) A tabu search heuristic and adaptive memory procedure for
political districting. Eur J Oper Res 144:12-26
Bozkaya B, Erkut E, Haight D, Laporte G (2011) Designing new electoral districts for the city of
Edmonton. Interfaces 41:534-547
Butsch A, Kalcsics J, Laporte G (2014) Districting for arc routing. INFORMS J Comput 26:809-
824
Carlsson J, Delage E (2013) Robust partitioning for stochastic multivehicle routing. Oper Res
61:727-744
D'Amico S, Wang S, Batta R, Rump C (2002) A simulated annealing approach to police district
design. Comput Oper Res 29:667-684
Deckro R (1977) Multiple objective districting: a general heuristic approach using multiple criteria.
Oper Res Q 28:953-961
Dixon RJ (1968) Democratic representation: reapportionment in law and politics. Oxford Univer-
sity Press, New York
Drexl A, Haase K (1999) Fast approximation methods for sales force deployment. Manag Sci
45:1307-1323
Duckham M, Kulik L, Worboys M, Galton A (2008) Efficient generation of simple polygons for
characterizing the shape of a set of points in the plane. Pattern Recognit 41:3224-3236
Elizondo-Amaya M, Ríos-Mercado R, Díaz J (2014) A dual bounding scheme for a territory design
problem. Comput Oper Res 44:193-205
Ferland J, Guénette G (1990) Decision support system for a school districting problem. Oper Res
38:15-21
Fleischmann B, Paraschis J (1988) Solving a large scale districting problem: a case report. Comput
Oper Res 15:521-533
Forman S, Yue Y (2003) Congressional districting using a TSP-based genetic algorithm. In:
Proceedings of the 2003 international conference on genetic and evolutionary computation:
Part II, GECCO'03, pp 2072-2083
Galvão L, Novaes A, Souza de Cursi J, Souza J (2006) A multiplicatively-weighted Voronoi
diagram approach to logistics districting. Comput Oper Res 33:93-114
Garfinkel R, Nemhauser G (1970) Optimal political districting by implicit enumeration techniques.
Manag Sci 16:495-508
George J, Lamar B, Wallace C (1997) Political district determination using large-scale network
optimization. Socio Econ Plan Sci 31:11-28
Glaze T, Weinberg C (1979) A sales territory alignment program and account planning system. In:
Sales management: new developments from behavioral and decision model research. Marketing
Science Institute, Cambridge, pp 325-343
