Using linear integer programming for multi-site land-use allocation

Research in the area of spatial decision support (SDS) and resource allocation has recently generated increased attention for integrating optimization techniques with GIS. In this paper we address the use of spatial optimization techniques for solving multi-site land-use allocation (MLUA) problems, where MLUA refers to the optimal allocation of multiple sites of different land uses to an area. We solve an MLUA problem, using four different integer programs (IP), of which three are linear integer programs. The IPs are formulated for a raster-based GIS environment and are designed to minimize development costs and to maximize compactness of the allocated land use. The preference for either minimizing costs or maximizing compactness has been made operational by including a weighting factor. The IPs are evaluated on their speed and their efficacy for handling large databases. All four IPs yielded the optimal solution within a reasonable amount of thne, for all area of 8 x 8 cells. The fastest model was successfully applied to a case study involving an area of 30 x 30 cells. The case study demonstrates the practical use of linear IPs for spatial decision support issues