Solution Techniques for Large Regional Partitioning Problems
Geographical AnalysisPublished 1 July 1995Open access
Mark Horn
Citations68
SJR quartileQ1
SJR score1.27
SNIP1.83
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
Computer tests indicate that the best of the procedures provide an effective trade-off between solution quality and computational efficiency in electoral districting and related applications.
Abstract
This paper presents procedures for use in electoral districting and related applications. A region is to be divided into a number of “territories” formed as aggregates of discrete spatial units, subject to constraints on territory size and on intraterritorial connectivity, so as to minimize the total length of territory perimeters. The procedures are based on a hill‐climbing principle, with progressively rigorous application of the connectivity and territory‐size constraints. Computational tests indicate that the best of the procedures provide an effective trade‐off between solution quality and computational efficiency.
Keywords
Social SciencesBusiness, Management and AccountingEngineering
Mathematics and Computers in SimulationSimulated annealing: theory and applications.
3,005 Citations1988
Simulated Annealing: Theory and Applications
2,372 Citations1987Peter J. M. van Laarhoven, Emile Aarts
Performance of the simulated annealing algorithm and the relation with statistical physics and asymptotic convergence results are presented.
Management ScienceOptimal Political Districting by Implicit Enumeration Techniques
300 Citations1970Robert Garfinkel, G. L. Nemhauser
Operations ResearchNonpartisan Political Redistricting by Computer
293 Citations1965Sidney W. Hess, James B. Weaver +3 more
A compart ness measure and a "warehouse-location" heuristic to draw nonpartisan, Constitutional political districts that is particularly useful when legislative impasse or indifference forces courts to intervene.
Management ScienceConstructing School Timetables Using Simulated Annealing: Sequential and Parallel Algorithms
291 Citations1991David Abramson
This paper considers a solution to the school timetabling problem and describes the simulated annealing method, which can provide a faster solution than the equivalent sequential algorithm.
Management ScienceSales Territory Alignment: A Review and Model
180 Citations1983Andris A. Zoltners, Prabhakant Sinha
Computers & Operations ResearchSolving a large scale districting problem: a case report
101 Citations1988Bernhard Fleischmann, Jannis N. Paraschis
The problem of defining the territories for 168 sales agents of a German manufacturer of consumer goods is solved by means of a location-allocation approach involving a standard code of a primal network algorithm as well as a new heuristic for resolving split areas.
Caltech Magazine (California Institute of Technology)The reapportionment puzzle
99 Citations1984Bruce E. Cain
Environment and Planning A Economy and SpaceProgram GROUP: The Identification of All Possible Solutions to a Constituency-Delimitation Problem
56 Citations1981David Rossiter, Ron Johnston
A computer program is designed to produce all of the electoral constituencies for an English local authority, within the constraints imposed on the Parliamentary Boundary Commissioners, and introduces size constraints, evaluates shape, and evaluates the electoral consequences of swings in voter opinion.
Environment and Planning A Economy and SpaceEffects of Spatial System Design on Spatial Interaction Models. 1: The Spatial System Definition Problem
51 Citations1989Stephen H. Putman, S-H Chung
Environment and Planning A Economy and SpaceThe Size of the Region-Building Problem
41 Citations1975Michael Keane
Journal of Urban Planning and DevelopmentMultiple Subregion Allocation Models
37 Citations1992Salah Benabdallah, Jeff R. Wright
Studies in applied regional sciencesA simplistic approach to the redistricting problem
20 Citations1978Roger Sammons
From this review, one particular algorithm emerges as having considerable potential for adaptation to accommodate the specific requirements of zoning system design and its use is demonstrated using data derived from the West Midlands Transport Study.
Computers Environment and Urban SystemsLocation-allocation models as decision aids in delineating administrative regions
13 Citations1993Panagiotis Lolonis, Marc P. Armstrong
Journal of the Operational Research SocietyAn Automated Procedure to Establish Workzone Boundaries for Air Force Facilities Maintenance Operations
3 Citations1982Victor Zaloom
An algorithm is presented which assigns facilities to workzones such that facilities assigned to the same workzone satisfy two conditions: the facility must be in close geographical proximity to the other facilities in the workzone and the sum of the expected maintenance workloads should have little variation between workZones.