A mini–max spanning forest approach to the political districting problem
Author:
- 7 May 2009
- journal article
- research article
- Published by Taylor & Francis in International Journal of Systems Science
- Vol. 40 (5) , 471-477
Abstract
We formulate the problem of political districting as a mini–max spanning forest problem, and present some local search-based heuristics to solve the problem approximately. Through numerical experiments, we evaluate the performance of the developed algorithms. We also give a case study of a prefecture in Japan for the election of the Lower House Members of the National Diet. We observe that ‘hyperopic’ algorithm usually gives satisfactory solutions, with the resulting districts all connected and usually balanced in size.Keywords
This publication has 9 references indexed in Scilit:
- Taming the Gerrymander—Statistical physics approach to Political Districting ProblemPhysica A: Statistical Mechanics and its Applications, 2006
- Analysis and Design of Electoral SystemsOberwolfach Reports, 2004
- A tabu search heuristic and adaptive memory procedure for political districtingEuropean Journal of Operational Research, 2003
- How to divide a territory? A new simple differential formalism for optimization of set functionsInternational Journal of Intelligent Systems, 1999
- An Optimization Based Heuristic for Political DistrictingManagement Science, 1998
- A branch-and-bound algorithm for the mini-max spanning forest problemEuropean Journal of Operational Research, 1997
- Political district determination using large-scale network optimizationSocio-Economic Planning Sciences, 1997
- A heuristic algorithm for the mini-max spanning forest problemEuropean Journal of Operational Research, 1996
- How easy is local search?Journal of Computer and System Sciences, 1988