Partitioning a Map into Homogeneous Contiguous Regions: A Branch-And-Bound Approach Using Decision Diagrams

Golenvaux;Gillard, Xavier;Nijssen, Siegfried;Schaus, Pierre
(2023) 29th International Conference on Principles and Practice of Constraint Programming (CP 2023) — Location: Toronto, Canada (27.August.2023)

Files

CP2023_map_partitioning.pdf
  • Open Access
  • Adobe PDF
  • 738.55 KB
Download

Details

Authors
Abstract
Regionalization is a crucial spatial analysis technique used for partitioning a map divided into zones into k continuous areas, optimizing the similarity of zone attributes within each area. This technique has a variety of applications in fields like urban planning, environmental management, and geographic information systems. The REDCAP algorithm is a well-known approach for addressing the regionalization problem. It consists of two main steps: first, it generates a spatially contiguous tree (SCT) representing the neighborhood structure of the set of spatial objects using a contiguity-constrained hierarchical clustering method. Second, it greedily removes k-1 edges from the SCT to create k regions. While this approach has proven to be effective, it may not always produce the most optimal solutions. We propose an alternative method for the second step, an exact dynamic programming (DP) formulation for the k-1 edges removal problem. This DP is solved using a multi-valued decision diagram (MDD)-based branch and bound solver leading to a more optimal solution. We compared our proposed method with the REDCAP state-of-the-art technique on real data and synthetic ones, using different instances of the regionalization problem and different supervised and unsupervised metrics. Our results indicate that our approach provides higher quality partitions than those produced by REDCAP at acceptable computational costs. This suggests that our method could be a viable alternative for addressing the regionalization problem in various applications.
Affiliations

Citations

  • APA
  • Chicago
  • FWB

Golenvaux, Gillard, X., Nijssen, S., & Schaus, P. (2023). Partitioning a Map into Homogeneous Contiguous Regions: A Branch-And-Bound Approach Using Decision Diagrams. Leibniz International Proceedings in Informatics (LIPIcs). Published. 29th International Conference on Principles and Practice of Constraint Programming (CP 2023), Toronto, Canada. https://doi.org/10.4230/LIPIcs.CP.2023.45 (Original work published 2023)