Political districting: from classical models to recent approaches

F Ricca, A Scozzari, B Simeone - Annals of Operations Research, 2013 - Springer
Abstract 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' …

A tabu search heuristic and adaptive memory procedure for political districting

B Bozkaya, E Erkut, G Laporte - European journal of operational research, 2003 - Elsevier
In political districting problems, the aim is to partition a territory into electoral constituencies,
subject to some side constraints. The most common side constraints include contiguity …

[BOOK][B] Cluster analysis and applications

For several years, parts of the content of this textbook have been used in undergraduate
courses in the Department of Mathematics and in the Faculty of Economics at the University …

Towards a unified territorial design approach—Applications, algorithms and GIS integration

J Kalcsics, S Nickel, M Schröder - Top, 2005 - Springer
Territory design may be viewed as the problem of grou** small geographic areas into
larger geographic clusters called territories in such a way that the latter are acceptable …

Solving a home-care districting problem in an urban setting

M Blais, SD Lapierre, G Laporte - Journal of the operational …, 2003 - Taylor & Francis
This article describes a districting study undertaken for the Côte-des-Neiges local
community health clinic in Montreal. A territory must be partitioned into six districts by …

Local search algorithms for political districting

F Ricca, B Simeone - European Journal of Operational Research, 2008 - Elsevier
Electoral district planning plays an important role in a political election, especially when a
majority voting rule is adopted, because it interferes in the translation of votes into seats. The …

Optimal political districting

M Hojati - Computers & Operations Research, 1996 - Elsevier
For the political districting problem, I propose the following solution methodology:(a) use
Lagrangian relaxation to determine the centres of the districts, then,(b) use the transportation …

Solving a large scale districting problem: a case report

B Fleischmann, JN Paraschis - Computers & Operations Research, 1988 - Elsevier
The paper deals with the problem of defining the territories for 168 sales agents of a German
manufacturer of consumer goods. About 1400 postal areas constitute the basic geographical …

Clustering algorithms for consolidation of customer orders into vehicle shipments

YA Koskosidis, WB Powell - Transportation Research Part B …, 1992 - Elsevier
The consolidation of shipments into loads arises in a number of applications, including
household moving, truckload trucking, rail and container operations. The capacitated …

Clustering for routing in densely populated areas

L Chapleau, JA Ferland, JM Rousseau - European Journal of Operational …, 1985 - Elsevier
This paper introduces a new approach for generating school bus routes in a dense urban
area. First, a districting algorithm is used to determine clusters including appropriate …