One- and two-objective approaches to an area-constrained habitat reserve site selection problem

We compare several ways to model a habitat reserve site selection problem in which an upper bound on the total area of the selected sites is included. The models are cast as optimization coverage models drawn from the location science literature. Classic covering problems typically include a constraint on the number of sites that can be selected. If potential reserve sites vary in terms of area, acquisition cost or land value, then sites need to be differentiated by these characteristics in the selection process. To address this within the optimization model, the constraint on the number of selected sites can either be replaced by one limiting the total area of the selected sites or area minimization can be incorporated as a second objective. We show that for our dataset and choice of optimization solver average solution time improves considerably when an area-constrained reserve site selection problem is modeled as a two objective rather than a single objective problem with a constraint limiting the total area of the selected sites. Computational experience is reported using a large dataset from Australia.

[1]  Richard L. Church,et al.  The fixed charge maximal covering location problem , 1992 .

[2]  P. J. Walker Land systems of western New South Wales , 1991 .

[3]  S. Polasky,et al.  Selecting Biological Reserves Cost-Effectively: An Application to Terrestrial Vertebrate Conservation in Oregon , 2001, Land Economics.

[4]  Manuela M. P. Huso,et al.  A comparison of reserve selection algorithms using data on terrestrial vertebrates in Oregon , 1997 .

[5]  Kevin J. Gaston,et al.  Optimisation in reserve selection procedures—why not? , 2002 .

[6]  C. Revelle,et al.  Counterpart Models in Facility Location Science and Reserve Selection Science , 2002 .

[7]  Stuart L. Pimm,et al.  Planning for Biodiversity , 1998, Science.

[8]  Les G. Underhill,et al.  Optimal and suboptimal reserve selection algorithms , 1994 .

[9]  Andrew R. Solow,et al.  A note on optimal algorithms for reserve site selection , 1996 .

[10]  Jeffrey L. Arthur,et al.  Finding all optimal solutions to the reserve site selection problem: formulation and computational analysis , 1997, Environmental and Ecological Statistics.

[11]  R. Haight,et al.  An optimization approach to selecting research natural areas in National Forests , 1999 .

[12]  Hugh P. Possingham,et al.  Effects of data characteristics on the results of reserve selection algorithms , 1999 .

[13]  K. D. Rothley,et al.  DESIGNING BIORESERVE NETWORKS TO SATISFY MULTIPLE, CONFLICTING DEMANDS , 1999 .

[14]  Richard L. Church,et al.  Reserve selection as a maximal covering location problem , 1996 .

[15]  Robert L. Pressey,et al.  Reserve Coverage and Requirements in Relation to Partitioning and Generalization of Land Classes: Analyses for Western New South Wales , 1995 .

[16]  C. Revelle Facility siting and integer-friendly programming , 1993 .

[17]  Richard L. Church,et al.  The maximal covering location problem , 1974 .

[18]  Jared L. Cohon,et al.  Multiobjective programming and planning , 2004 .

[19]  Hayri Önal,et al.  First-best, second-best, and heuristic solutions in conservation reserve site selection , 2004 .