Place prioritization for biodiversity conservation using probabilistic surrogate distribution data

Abstract

We analyse optimal and heuristic place prioritization algorithms for biodiversity conservation area network design which can use probabilistic data on the distribution of surrogates for biodiversity. We show how an Expected Surrogate Set Covering Problem (ESSCP) and a Maximal Expected Surrogate Covering Problem (MESCP) can be linearized for computationally efficient solution. For the ESSCP, we study the performance of two optimization software packages (XPRESS and CPLEX) and five heuristic algorithms based on traditional measures of complementarity and rarity as well as the Shannon and Simpson indices of α‐diversity which are being used in this context for the first time. On small artificial data sets the optimal place prioritization algorithms often produced more economical solutions than the heuristic algorithms, though not always ones guaranteed to be optimal. However, with large data sets, the optimal algorithms often required long computation times and produced no better results than heuristic ones. Thus there is generally little reason to prefer optimal to heuristic algorithms with probabilistic data sets.

Applying Niche-Based Models to Predict Endangered-Hylid Potential Distributions: Are Neotropical Protected Areas Effective Enough?

“…Combination of niche-based distribution modeling and reserve selection algorithms is also a promising approach [67][68]. It works as an effective tool that should be applied in systematic conservation planning to identify and interconnect priority regions, particularly those already covered by natural protected areas [69].…”

Reserve Selection Based on Vegetation in the Brazilian Atlantic Forest

“…There is a long discussion about whether reserves selected using vegetation types represent species biodiversity data (Brooks et al 2004). For instance, in a review of articles on reserve selection in South America, Pinto & Grelle (2009b) found only one indexed article that uses vegetation types as target (Sarkar et al 2004), although there are other non-indexed reserve selection studies done in Brazil (e.g. Albernaz & Souza 2007).…”

Optimisation and the selection of conservation contracts*

“…Consequently, they focused on the design of robust heuristics. Similarly, Sarkar et al (2004) found little reason to prefer optimal to heuristic areaselection algorithms for their probabilistic data sets. For their large data sets, the optimal algorithms often required long computation times and produced no better results than the heuristic ones.…”