A 0 - 1 programming approach to delineating protected reserves

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.