An extendable heuristic framework to solve the p-compact-regions problem for urban economic modeling

WenWen Li, Richard L. Church, Michael Goodchild

Research output: Contribution to journalArticle

15 Citations (Scopus)

Abstract

The p-compact-regions problem, defined by Li, Church, and Goodchild (forthcoming) involves generating a fixed number ( p) of regions from n atomic polygonal units with the objective of maximizing the compactness of each region. Compactness is a shape factor measuring how closely and firmly the polygonal units in a region are packed together. A compact polygonal region has the advantages of being homogeneous and maximizing the accessibility of all points within that region, therefore it is useful in a large number of real-world applications, such as in conservation planning, political district partitioning, and the proposed application in this paper concerning regionalization for urban economic modeling. This paper reports our efforts in designing an object-oriented heuristic framework that integrates semi-greedy growth and local search to solve a real-world applied p-compact-regions problem to optimality or near-optimality. We apply this model to support urban economic simulation, in which activities need to be aggregated from the 4109 Transportation Analysis Zones (TAZs) of six southern California counties into 100 regions to achieve desired computational feasibility of the economic simulation model. Spatial contiguity, physiography, political boundaries, the presence of local centers, and intra-zonal and inter-zonal traffic are considered, and efforts are made to ensure consistency of selected properties between the disaggregated and aggregated regions. This work makes an original contribution in the development of a highly extendable and effective solution framework to allow researchers to investigate large, real, non-linear regionalization problems and find practical solutions.

Original languageEnglish (US)
Pages (from-to)1-13
Number of pages13
JournalComputers, Environment and Urban Systems
Volume43
DOIs
StatePublished - Jan 2014

Fingerprint

heuristics
economics
modeling
regionalization
political planning
political boundary
conservation planning
economic model
simulation model
accessibility
simulation
partitioning
church
conservation
traffic
district

Keywords

  • Clustering
  • Compactness
  • GRASP
  • Greedy
  • Heuristic
  • Moment of inertia
  • Regionalization
  • Simulated annealing
  • Spatial optimization
  • TABU
  • Zoning

ASJC Scopus subject areas

  • Ecological Modeling
  • Environmental Science(all)
  • Geography, Planning and Development

Cite this

@article{da0cfbe0d4924d5c8a7b67969953f814,
title = "An extendable heuristic framework to solve the p-compact-regions problem for urban economic modeling",
abstract = "The p-compact-regions problem, defined by Li, Church, and Goodchild (forthcoming) involves generating a fixed number ( p) of regions from n atomic polygonal units with the objective of maximizing the compactness of each region. Compactness is a shape factor measuring how closely and firmly the polygonal units in a region are packed together. A compact polygonal region has the advantages of being homogeneous and maximizing the accessibility of all points within that region, therefore it is useful in a large number of real-world applications, such as in conservation planning, political district partitioning, and the proposed application in this paper concerning regionalization for urban economic modeling. This paper reports our efforts in designing an object-oriented heuristic framework that integrates semi-greedy growth and local search to solve a real-world applied p-compact-regions problem to optimality or near-optimality. We apply this model to support urban economic simulation, in which activities need to be aggregated from the 4109 Transportation Analysis Zones (TAZs) of six southern California counties into 100 regions to achieve desired computational feasibility of the economic simulation model. Spatial contiguity, physiography, political boundaries, the presence of local centers, and intra-zonal and inter-zonal traffic are considered, and efforts are made to ensure consistency of selected properties between the disaggregated and aggregated regions. This work makes an original contribution in the development of a highly extendable and effective solution framework to allow researchers to investigate large, real, non-linear regionalization problems and find practical solutions.",
keywords = "Clustering, Compactness, GRASP, Greedy, Heuristic, Moment of inertia, Regionalization, Simulated annealing, Spatial optimization, TABU, Zoning",
author = "WenWen Li and Church, {Richard L.} and Michael Goodchild",
year = "2014",
month = "1",
doi = "10.1016/j.compenvurbsys.2013.10.002",
language = "English (US)",
volume = "43",
pages = "1--13",
journal = "Computers, Environment and Urban Systems",
issn = "0198-9715",
publisher = "Elsevier Limited",

}

TY - JOUR

T1 - An extendable heuristic framework to solve the p-compact-regions problem for urban economic modeling

AU - Li, WenWen

AU - Church, Richard L.

AU - Goodchild, Michael

PY - 2014/1

Y1 - 2014/1

N2 - The p-compact-regions problem, defined by Li, Church, and Goodchild (forthcoming) involves generating a fixed number ( p) of regions from n atomic polygonal units with the objective of maximizing the compactness of each region. Compactness is a shape factor measuring how closely and firmly the polygonal units in a region are packed together. A compact polygonal region has the advantages of being homogeneous and maximizing the accessibility of all points within that region, therefore it is useful in a large number of real-world applications, such as in conservation planning, political district partitioning, and the proposed application in this paper concerning regionalization for urban economic modeling. This paper reports our efforts in designing an object-oriented heuristic framework that integrates semi-greedy growth and local search to solve a real-world applied p-compact-regions problem to optimality or near-optimality. We apply this model to support urban economic simulation, in which activities need to be aggregated from the 4109 Transportation Analysis Zones (TAZs) of six southern California counties into 100 regions to achieve desired computational feasibility of the economic simulation model. Spatial contiguity, physiography, political boundaries, the presence of local centers, and intra-zonal and inter-zonal traffic are considered, and efforts are made to ensure consistency of selected properties between the disaggregated and aggregated regions. This work makes an original contribution in the development of a highly extendable and effective solution framework to allow researchers to investigate large, real, non-linear regionalization problems and find practical solutions.

AB - The p-compact-regions problem, defined by Li, Church, and Goodchild (forthcoming) involves generating a fixed number ( p) of regions from n atomic polygonal units with the objective of maximizing the compactness of each region. Compactness is a shape factor measuring how closely and firmly the polygonal units in a region are packed together. A compact polygonal region has the advantages of being homogeneous and maximizing the accessibility of all points within that region, therefore it is useful in a large number of real-world applications, such as in conservation planning, political district partitioning, and the proposed application in this paper concerning regionalization for urban economic modeling. This paper reports our efforts in designing an object-oriented heuristic framework that integrates semi-greedy growth and local search to solve a real-world applied p-compact-regions problem to optimality or near-optimality. We apply this model to support urban economic simulation, in which activities need to be aggregated from the 4109 Transportation Analysis Zones (TAZs) of six southern California counties into 100 regions to achieve desired computational feasibility of the economic simulation model. Spatial contiguity, physiography, political boundaries, the presence of local centers, and intra-zonal and inter-zonal traffic are considered, and efforts are made to ensure consistency of selected properties between the disaggregated and aggregated regions. This work makes an original contribution in the development of a highly extendable and effective solution framework to allow researchers to investigate large, real, non-linear regionalization problems and find practical solutions.

KW - Clustering

KW - Compactness

KW - GRASP

KW - Greedy

KW - Heuristic

KW - Moment of inertia

KW - Regionalization

KW - Simulated annealing

KW - Spatial optimization

KW - TABU

KW - Zoning

UR - http://www.scopus.com/inward/record.url?scp=84886602130&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84886602130&partnerID=8YFLogxK

U2 - 10.1016/j.compenvurbsys.2013.10.002

DO - 10.1016/j.compenvurbsys.2013.10.002

M3 - Article

VL - 43

SP - 1

EP - 13

JO - Computers, Environment and Urban Systems

JF - Computers, Environment and Urban Systems

SN - 0198-9715

ER -