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

J.C.J.H. Aerts, E. Eisinger, G.B.M. Heuvelink, Th.J. Stewart

Research output: Contribution to journalArticleAcademicpeer-review

145 Citations (Scopus)

Abstract

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.
Original languageEnglish
Pages (from-to)148-169
JournalGeographical Analysis
Volume35
Issue number2
DOIs
Publication statusPublished - 2003

Fingerprint

linear programing
land use
programming
Geographical Information System
GIS
cost minimizing
raster
resource allocation
weighting
cost
allocation
costs
resources
programme
decision

Keywords

  • decision-support
  • optimization
  • gis
  • constraints
  • models
  • clarification

Cite this

Aerts, J.C.J.H. ; Eisinger, E. ; Heuvelink, G.B.M. ; Stewart, Th.J. / Using linear integer programming for multi-site land-use allocation. In: Geographical Analysis. 2003 ; Vol. 35, No. 2. pp. 148-169.
@article{27fc55cbb9204008bce1da41a2350971,
title = "Using linear integer programming for multi-site land-use allocation",
abstract = "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.",
keywords = "decision-support, optimization, gis, constraints, models, clarification",
author = "J.C.J.H. Aerts and E. Eisinger and G.B.M. Heuvelink and Th.J. Stewart",
year = "2003",
doi = "10.1111/j.1538-4632.2003.tb01106.x",
language = "English",
volume = "35",
pages = "148--169",
journal = "Geographical Analysis",
issn = "0016-7363",
publisher = "Wiley",
number = "2",

}

Using linear integer programming for multi-site land-use allocation. / Aerts, J.C.J.H.; Eisinger, E.; Heuvelink, G.B.M.; Stewart, Th.J.

In: Geographical Analysis, Vol. 35, No. 2, 2003, p. 148-169.

Research output: Contribution to journalArticleAcademicpeer-review

TY - JOUR

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

AU - Aerts, J.C.J.H.

AU - Eisinger, E.

AU - Heuvelink, G.B.M.

AU - Stewart, Th.J.

PY - 2003

Y1 - 2003

N2 - 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.

AB - 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.

KW - decision-support

KW - optimization

KW - gis

KW - constraints

KW - models

KW - clarification

U2 - 10.1111/j.1538-4632.2003.tb01106.x

DO - 10.1111/j.1538-4632.2003.tb01106.x

M3 - Article

VL - 35

SP - 148

EP - 169

JO - Geographical Analysis

JF - Geographical Analysis

SN - 0016-7363

IS - 2

ER -