Place prioritization for biodiversity conservation using probabilistic surrogate distribution data

48Citations
Citations of this article
180Readers
Mendeley users who have this article in their library.

This article is free to access.

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.

Cite

CITATION STYLE

APA

Sarkar, S., Pappas, C., Garson, J., Aggarwal, A., & Cameron, S. (2004). Place prioritization for biodiversity conservation using probabilistic surrogate distribution data. Diversity and Distributions, 10(2), 125–133. https://doi.org/10.1111/j.1366-9516.2004.00060.x

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free