A 0–1 Programming Approach to Delineating Protected Reserves

J C Williams and C S ReVelle

Environment and Planning B, 1996, vol. 23, issue 5, 607-624

Abstract: The problem of selecting parcels of land for inclusion within a protected reserve is formulated as a 0–1 programming model. The formulation addresses the objectives of minimizing cost and maximizing reserve area, while providing buffer zones around interior or core areas and promoting contiguity and compactness. The model is developed for a regular grid spatial setting. An exact method is presented for generating all noninferior solutions, and a heuristic solution procedure is also provided. A hypothetical example demonstrates that medium-sized problems can be solved exactly in reasonable amounts of computer time. Exact and heuristic solutions are compared and applications of the model are discussed.

Date: 1996
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
https://journals.sagepub.com/doi/10.1068/b230607 (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:sae:envirb:v:23:y:1996:i:5:p:607-624

DOI: 10.1068/b230607

Access Statistics for this article

More articles in Environment and Planning B
Bibliographic data for series maintained by SAGE Publications ().