A continuous districting model focusing on intra- and inter-zonal squared distances and its Voronoi-based heuristic

Keitaro Morimoto, Ken ichi Tanaka

Research output: Contribution to journalArticlepeer-review

Abstract

We consider the problem of dividing a given convex polygon into p convex polygons called zones, each of which receives a designated land area. The position and shape of each zone is determined so that intra- and inter-zonal trips for the resulting zones are conducted efficiently. To evaluate the compactness of the resulting zones, we derive the average squared distance between two points uniformly distributed in each zone, as well as the average squared distance between two points uniformly distributed in two zones. The weighted sum of these measures is used as the objective function, and a Voronoi-based heuristic algorithm is proposed that iteratively updates the positions of p generator points placed inside a convex polygon. The method is used to divide several regular polygons, and the results show that zones become (i) rounded when intra-zonal trips are prioritized and (ii) elongated with longer boundary lines when inter-zonal trips are prioritized.

Original languageEnglish
Pages (from-to)1109-1134
Number of pages26
JournalInternational Transactions in Operational Research
Volume28
Issue number3
DOIs
Publication statusPublished - 2021 May

Keywords

  • Voronoi tessellation
  • continuous districting problem
  • intra- and inter-zonal trips
  • squared distance

ASJC Scopus subject areas

  • Business and International Management
  • Computer Science Applications
  • Strategy and Management
  • Management Science and Operations Research
  • Management of Technology and Innovation

Fingerprint

Dive into the research topics of 'A continuous districting model focusing on intra- and inter-zonal squared distances and its Voronoi-based heuristic'. Together they form a unique fingerprint.

Cite this