An efficient heuristic for solving the region aggregation problem
Abstract
The region aggregation problem is one of selecting, from the region of interest, that sub-set of grid cells that best meets the need for a particular use or purpose, and that does so within a set of pre-specified physical and logical constraints. The goal of this research is to extend the methodologies presently available to solve the region aggregation problem. This is particularly important in light of parallel advances in the use of spatial grid-based databases afforded by geographic information systems (GIS) and new developments in the area of suitability assessment. An efficient heuristic procedure is developed to generate a solution that provides a good starting point for Tabu Search and Simulated Annealing to identify a global optimum. The heuristic is shown to be satisfactory for handling large sized problems with up to 10,000 cells. Potential applications of the region aggregation problem that will benefit from the current research are discussed.
Degree
Ph.D.
Advisors
Wright, Purdue University.
Subject Area
Civil engineering|Operations research|Urban planning|Area planning & development
Off-Campus Purdue Users:
To access this dissertation, please log in to our
proxy server.