Methods for reserve selection: Interior point search

Spatial reserve design concerns the planning of biological reserves for conservation. Typical reserve selection formulations operate on a large set of landscape elements, which could be grid cells or irregular sites, and selection algorithms aim to select the set of sites that achieves biodiversity target levels with minimum cost. This study presents a completely different optimization approach to reserve design. The reserve selection problem can be considerably simplified given the reasonable assumptions that: (i) maximum reserve cost is known; (ii) the approximate number of new reserves to be established is known; (iii) individual reserves need to be spatially contiguous. Further assuming the ability to construct a set of reserves in an efficient and close to optimal manner around designated reserve locations, the reserve selection problem can be turned into a search for a single interior point and area for each reserve. The utility of the proposed method is demonstrated for a data set of seven indicator species living in an conservation priority area in Southern Australia consisting of ca 73,000 selection units, with up to 10,000 cells chosen for inclusion in a reserve network. Requirements (ii) and (iii) above make interior point search computationally very efficient, allowing use with landscapes in the order of millions of elements. The method could also be used with non-linear species distribution models.

[1]  Heather M. Leslie,et al.  Using siting algorithms in the design of marine reserve networks , 2003 .

[2]  Jane Elith,et al.  Sensitivity of conservation planning to different approaches to using predicted species distribution data , 2005 .

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

[4]  Robert A. Briers,et al.  Incorporating connectivity into reserve selection procedures , 2002 .

[5]  Atte Moilanen,et al.  Site‐Selection Algorithms and Habitat Loss , 2003 .

[6]  Mar Cabeza,et al.  Habitat loss and connectivity of reserve networks in probability approaches to reserve design , 2003 .

[7]  Robert L. Pressey,et al.  The cost of ad hoc reservation: a case study in western New South Wales. , 1994 .

[8]  Mark D. McDonnell,et al.  Mathematical Methods for Spatially Cohesive Reserve Design , 2002 .

[9]  S. Andelman,et al.  Mathematical Methods for Identifying Representative Reserve Networks , 2000 .

[10]  Hugh P. Possingham,et al.  Effectiveness of alternative heuristic algorithms for identifying indicative minimum requirements for conservation reserves , 1997 .

[11]  Charles ReVelle,et al.  Using mathematical optimization models to design nature reserves , 2004 .

[12]  Atte Moilanen,et al.  Connectivity, Probabilities and Persistence: Comparing Reserve Selection Strategies , 2006, Biodiversity & Conservation.

[13]  Richard L. Church,et al.  Clustering and Compactness in Reserve Site Selection: An Extension of the Biodiversity Management Area Selection Model , 2003, Forest Science.

[14]  Andrew R. Solow,et al.  Nature Reserve Site Selection to Maximize Expected Species Covered , 2002, Oper. Res..

[15]  John Sessions,et al.  Designing Compact and Contiguous Reserve Networks with a Hybrid Heuristic Algorithm , 2002, Forest Science.

[16]  A. O. Nicholls,et al.  Selecting networks of reserves to maximise biological diversity , 1988 .

[17]  Anshu Aggarwal,et al.  Place prioritization for biodiversity conservation using probabilistic surrogate distribution data , 2004 .

[18]  H. Bibelriether,et al.  Bayerischer Wald National Park threatened by air pollution. , 1984 .

[19]  I. R. Johnson,et al.  Shades of irreplaceability: towards a measure of the contribution of sites to a reservation goal , 1994, Biodiversity & Conservation.

[20]  S. Ferson,et al.  Quantitative Methods for Conservation Biology , 2002, Springer New York.

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

[22]  Kevin J. Gaston,et al.  Maximising phylogenetic diversity in the selection of networks of conservation areas , 2002 .

[23]  M Cabeza,et al.  Design of reserve networks and the persistence of biodiversity. , 2001, Trends in ecology & evolution.

[24]  S. Sarkar,et al.  Systematic conservation planning , 2000, Nature.

[25]  Jamie B. Kirkpatrick,et al.  An iterative method for establishing priorities for the selection of nature reserves: An example from Tasmania , 1983 .

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

[27]  Robert G. Haight,et al.  An Integer Optimization Approach to a Probabilistic Reserve Site Selection Problem , 2000, Oper. Res..

[28]  Andrew R. Solow,et al.  Choosing reserve networks with incomplete species information , 2000 .

[29]  John H. Holland,et al.  Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .

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

[31]  Atte Moilanen,et al.  Combining probabilities of occurrence with spatial reserve design , 2004 .

[32]  H. Possingham,et al.  Applying a Decision‐Theory Framework to Landscape Planning for Biodiversity: Follow‐Up to Watson et al. , 2003 .

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

[34]  Jane Elith,et al.  Fauna habitat modelling and mapping: A review and case study in the Lower Hunter Central Coast region of NSW , 2005 .

[35]  Atte Moilanen,et al.  Single‐species dynamic site selection , 2002 .

[36]  K. D. Cocks,et al.  Using mathematical programming to address the multiple reserve selection problem: An example from the Eyre Peninsula, South Australia , 1989 .

[37]  Paul H. Williams,et al.  Using probability of persistence to identify important areas for biodiversity conservation , 2000, Proceedings of the Royal Society of London. Series B: Biological Sciences.