Political district determination using large-scale network optimization

George, John A.; Lamar, Bruce W.; Wallace, Chris A.

doi:10.1016/s0038-0121(96)00016-x

Cited by 54 publications

(35 citation statements)

References 15 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…George et al (1997) The procedure proposed in George et al (1997) follows the iterative location/allocation approach pioneered by Hess et al (1965), but with the main difference that a new method for assigning territorial units to districts is adopted. For this step, the authors introduce a minimum cost network flow problem defined on the following network.…”

Section: Locationmentioning

confidence: 99%

“…In the other three versions also costs associated to center-sink pairs are introduced. They are functions of the flow passing through the corresponding arc and consist of penalties graduated according to the actual deviation of the district population from the target value (for details about the cost functions, (see, George et al (1997), p. 20, Table 1). The proposed iterative procedure alternates the location of the centers of the k districts with the allocation of the population of the units to such districts via the solution of the above minimum cost network flow problem.…”

Section: Locationmentioning

confidence: 99%

See 1 more Smart Citation

Political districting: from classical models to recent approaches

2011

View full text Add to dashboard Cite

The political districting problem has been studied since the 60's and many different models and techniques have been proposed with the aim of preventing districts' manipulation which may favor some specific political party (gerrymandering). A variety of political districting models and procedures was provided in the Operations Research literature, based on single- or multiple-objective optimization. Starting from the forerunning papers published in the 60's, this article reviews some selected optimization models and algorithms for political districting which gave rise to the main lines of research on this topic in the Operartions Research literature of the last five decades

show abstract

Section: Locationmentioning

confidence: 99%

Section: Locationmentioning

confidence: 99%

Political districting: from classical models to recent approaches

2011

View full text Add to dashboard Cite

show abstract

“…8 George et al (1997) incorporated modifications to Hess et al (1965) and presented three new versions of the model. The first one incorporated nonlinear penalty functions for deviations from the target regional population, in such a way that the bigger the deviation from the desired regional population, the bigger the penalty.…”

Section: Regionalization Via Maximization Of Regional Compactnessmentioning

confidence: 99%

Supervised Regionalization Methods: A Survey

Duque

Ramos

Suriñach

2007

International Regional Science Review

257

182

View full text Add to dashboard Cite

This paper reviews almost four decades of contributions on the subject of supervised regionalization methods. These methods aggregate a set of areas into a predefined number of spatially contiguous regions while optimizing certain aggregation criteria. The authors present a taxonomic scheme that classifies a wide range of regionalization methods into eight groups, based on the strategy applied for satisfying the spatial contiguity constraint. The paper concludes by providing a qualitative comparison of these groups in terms of a set of certain characteristics, and by suggesting future lines of research for extending and improving these methods.

show abstract

“…They tend to result from explicit needs of institutions that have to manage territorial dispersed activities, providing a management perspective on zone design. Examples of this are the problem of electoral districting (Horn 1995;George et al 1997;Mehrotra et al 1998;Macmillan and Pierce 1994), sales territories (Leischmann and Paraschis 1998), police reporting areas (Sarac et al 1999), and census output Areas (Martin 1997;Martin 1998). Uniform and nodal regions can be viewed as having a fairly exploratory nature, as they usually assist research and discovery processes.…”

Section: Discovery and Exploration Through Zone Designmentioning

confidence: 99%

Geo-Self-Organizing Map (Geo-SOM) for Building and Exploring Homogeneous Regions

Bação

Lobo

Paìnho

2004

Geographic Information Science

View full text Add to dashboard Cite

Abstract. Regionalization and uniform/homogeneous region building constitutes one of the most longstanding concerns of geographers. In this paper we explore the Geo-Self-Organizing Map (Geo-SOM) as a tool to develop homogeneous regions and perform geographic pattern detection. The Geo-SOM presents several advantages over other available methods. The possibility of "whatif" analysis, coupled with powerful visualization tools and the accommodation of spatial constraints, constitute some of the most relevant features of the Geo-SOM. In this paper we show the opportunities made available by this tool and explore different features which allow rich exploratory spatial data analysis.

show abstract

Political district determination using large-scale network optimization

Cited by 54 publications

References 15 publications

Political districting: from classical models to recent approaches

Political districting: from classical models to recent approaches

Supervised Regionalization Methods: A Survey

Geo-Self-Organizing Map (Geo-SOM) for Building and Exploring Homogeneous Regions

Contact Info

Product

Resources

About