본문 바로가기
  • Home

A Heuristic Approach with New Contiguity Checking Method to Congressional Redistricting

  • Journal of the Korean Cartographic Association
  • Abbr : JKCA
  • 2012, 12(3), pp.81-94
  • Publisher : The Korean Cartographic Association
  • Research Area : Social Science > Geography > Geography in general > Cartography

김명진 1

1경기과학기술 진흥원

Accredited

ABSTRACT

Political redistricting problems are the way of aggregating a set of population units into contiguous geographical area with redistricting criteria. Political redistricting problems are very difficult because they can be lead to political debate because the drafter may take part in redistricting process with subjective opinions. Also, these problems are complicated because the number of feasible redistricting plans is exponentially increased with the problem size. Especially, US constitution requires that the congressional district should be redrawn to make populations strictly equal and make population units successfully contiguous. However, existing approaches such as transportation problems, local search based methods and metaheuristic approaches may show the difficulty to find strict population equality redistricting plans and the inefficiency to ensure contiguity. The purpose of this paper is to develop a heuristic approach to congressional redistricting using contiguity checking. Computational experiments show that the new heuristic shows various spatial configurations in a most strict equal population plan and finds a better plan than the official plan in terms of strict population equality. This new plan may be proposed as a new plan for the congressional plan. Also, it is significant that the research studied in the paper can be applied to the redrawing of member of the National Assembly in Korea in the near future.

Citation status

* References for papers published after 2023 are currently being built.