Allocation models in spatial optimization
Abstract
The land allocation problem is one of selecting, from a set of available land units or parcels, a subset of units displaying certain desirable characteristics or having special morphology. The thrust of this research is to extend the state-of-the-art in land allocation modeling by developing methodologies for the explicit representation of shape through the modeling process. This is done by formulating shape constraints for use in optimization models. Several discrete programming models are presented for the problem of allocating an area of land for development when the shape of the resulting land area is a primary concern. The solution procedure is shown to be satisfactory for small to medium sized problems and can accommodate rectangular and irregular shapes. In addition, other multiobjective discrete programming models are proposed to allocate multiple areas with different geometries. The solution can accommodate regular (rectangular and square) shapes. These models are extended to address the districting problem. The districting problem is formulated as nonlinear binary model. A heuristic algorithm is developed to generate a solution for the districting problem. The results of this algorithm are presented and discussed. Numerical examples are presented for illustration.
Degree
Ph.D.
Advisors
Wright, Purdue University.
Subject Area
Civil engineering|Industrial engineering|Operations research|Urban planning|Area planning & development
Off-Campus Purdue Users:
To access this dissertation, please log in to our
proxy server.