Optimal and suboptimal reserve selection algorithms

doi:10.1016/0006-3207(94)90302-6

Biological Conservation

Volume 70, Issue 1, 1994, Pages 85-87

https://doi.org/10.1016/0006-3207(94)90302-6 Get rights and content

Abstract

This paper criticises some reserve selection algorithms that have recently been published in Biological Conservation and have rapidly become enshrined in the principle of complementarity. These algorithms are shown, by means of a counter-example, to be suboptimal. Integer programming techniques, available for 30 years, provide optimal solutions to the reserve selection problem. The paper appeals for closer co-operation between biologists and mathematicians in the development of algorithms.

References (19)

K.D. Cocks et al.
Using mathematical programming to address the multiple reserve selection problem: an example from the Eyre Peninsula, South Australia
Biol. Conserv.
(1989)
C.R. Margules et al.
Selecting networks of reserves to maximise biological diversity
Biol. Conserv.
(1988)
G.L. Nemhauser et al.
Integer programming
A.O. Nicholls et al.
An upgraded reserve selection algorithm
Biol. Conserv.
(1993)
R.L. Pressey et al.
Beyond opportunism: key principles for systematic reserve selection
Trends Ecol. Evolut.
(1993)
A.G. Rebelo et al.
Protection of fynbos vegetation: ideal and real world options
Biol. Conserv.
(1990)
M. Sætersdal et al.
How to maximize biological diversity in nature reserve selection: vascular plants and breeding birds in deciduous woodlands, western Norway
Biol. Conserv.
(1993)
T.J. Stewart
A critical survey on the status of multiple-criteria decision making theory and methods
OMEGA Int. J. Mgmt Sci.
(1992)
R.I. Vane-Wright et al.
What to protect? Systematics and the agony of choice
Biol. Conserv.
(1991)

There are more references available in the full text version of this article.

Cited by (221)

An accurate probabilistic step finder for time-series analysis
2024, Biophysical Journal
Noisy time-series data—from various experiments, including Förster resonance energy transfer, patch clamp, and force spectroscopy, among others—are commonly analyzed with either hidden Markov models or step-finding algorithms, both of which detect discrete transitions. Hidden Markov models, including their extensions to infinite state spaces, inherently assume exponential—or technically geometric—holding time distributions, biasing step locations toward steps with geometric holding times, especially in sparse and/or noisy data. In contrast, existing step-finding algorithms, while free of this restraint, often rely on ad hoc metrics to penalize steps recovered in time traces (by using various information criteria) and otherwise rely on approximate greedy algorithms to identify putative global optima. Here, instead, we devise a robust and general probabilistic (Bayesian) step-finding tool that neither relies on ad hoc metrics to penalize step numbers nor assumes geometric holding times in each state. As the number of steps themselves in a time-series are a priori unknown, we treat these within a Bayesian nonparametric (BNP) paradigm. We find that the method developed, BNP Step (BNP-Step), accurately determines the number and location of transitions between discrete states without any assumed kinetic model and learns the emission distribution characteristic of each state. In doing so, we verify that BNP-Step can analyze sparser data sets containing higher noise and more closely spaced states than otherwise resolved by current state-of-the-art methods. What is more, BNP-Step rigorously propagates measurement uncertainty into uncertainty over state transition locations, numbers, and emission levels as characterized by the posterior. We demonstrate the performance of BNP-Step on both synthetic data as well as data drawn from force spectroscopy experiments.
A comprehensive evaluation of flowering plant diversity and conservation priority for national park planning in China
2023, Fundamental Research
Establishment of a national park protection system in China, including the latest target proposed to protect at least 30% of the land area, calls for a comprehensive exploration of conservation priorities incorporating multiple diversity facets. We herein evaluate the spatial distribution of Chinese flowering plants from the perspectives of richness, uniqueness, vulnerability, and evolutionary history, by integrating three mega-phylogenies and comprehensive distribution data. We detect significantly high consistency among hotspots of different diversity measures for Chinese flowering plants, suggesting that multiple facets of evolutionary diversity are concentrically distributed in China. Affording legal protection to these areas is expected to maximize positive conservation outcomes. We propose two integrative diversity indices by incorporating three richness-based and three phylogeny-based measures, respectively. Both methods identify areas with high species richness, but the integrative phylogeny-based index also locates key areas with ancient and unique evolutionary histories (e.g., Ailao-Wuliang Mts, Dabie Mts, Hainan rainforest, Karst area of Yunnan-Guizhou-Guangxi, Nanling Mts, and southeast coastal regions). Of all the diversity indices explored, phylogenetic endemism maximizes the incidental protection of other indices in most cases, emphasizing its significance for conservation planning. Finally, 42 priority areas are identified by combining the 5%-criterion hotspots of two integrative indices and the minimum area to protect all threatened species analyzed. These priorities cover only 13.3% of China's land area, but host 97.1% of species richness (23,394/24,095), 96.5% of endemic species (11,841/12,274), 100% of threatened species (2,613/2,613), and 99.3% of phylogenetic diversity for flowering plants involved in this study. These frameworks provide a solid scientific basis for national park planning in China.
Optimal configuration of a wildlife corridor system
2023, Global Ecology and Conservation
Establishing wildlife corridors to link detached habitat patches is a widely advocated conservation strategy to reduce the adverse impacts of habitat fragmentation. Given the scarcity of conservation resources, designing an efficient corridor system calls for an optimization approach. The optimal configuration of a wildlife corridor system involving multiple habitat patches poses significant challenges, both methodologically and computationally. This study proposes a two-stage procedure for that purpose. In the first stage, we determine a best-quality corridor between each pair of habitat patches using the method described in Wang et al. (2022). In the second stage, we select a subset of those corridors to assemble a least-cost corridor system using a mixed integer linear programming model presented in this paper. We use an illustrative example to demonstrate the workings of the two-stage method, and then apply it to a real dataset for an area in Cumberland County, Nova Scotia, Canada, involving 1039 irregular land parcels. Results show that an efficient corridor system where each habitat patch is connected to some neighboring habitat patches through a specified minimum number of corridors can be identified conveniently in terms of both data processing and computational effort.
A visual analytics framework for conservation planning optimization
2021, Environmental Modelling and Software
Approximately 15% of global land is currently in some state of protection. Recent conservation research suggests the need for a drastic increase of protected lands by 2050. In order to reach this target, an additional 35% of lands need to be conserved or restored in a cost-effective and time-efficient manner in order to support the resiliency of our planet and its climate. While many individuals and foundations continue raising much-needed funding for the environment, the development of conservation portfolios is a complex multi-dimensional task. Agencies have limited resources for investing in new conservation areas and have differing priorities for conservation in terms of species, land cover, human activities, etc. We present an interactive conservation portfolio development system that combines visualization, multicriteria analysis, optimization, and decision making that enables conservation planners and scientists to efficiently construct, compare, and modify conservation portfolios under multiple constraints.
Understanding and Overcoming the Barriers for Cost-effective Conservation
2017, Ecological Economics
Despite extensive research demonstrating the benefits of applying cost-effective conservation techniques, such as optimization, a large gap remains between the evidence from research and the actions of professions as they design and implement conservation programs. This study examines this gap through an international survey of conservation professionals who are familiar with cost-effective conservation techniques. The primary results of this study, replicate previous results from a smaller sample of agricultural preservation professionals, and show that the vast majority of survey respondents viewed cost-effectiveness as a virtue, but ultimately do not consider it as important as other program design criteria. These results reinforce the idea that advocates of cost-effective conservation need to address concerns about fairness and transparency and remedy gaps in the knowledge and expertise of professionals involved. Finally, the lack of incentive to conservation professionals to change their practices is a challenge that calls for public pressure and encouragement for experimentation and evidence-based policy to improve the cost effectiveness of conservation.
Network connectivity value
2017, Journal of Theoretical Biology
In order to unveil the value of network connectivity, we formalize the construction of ecological networks in forest environments as an optimal control dynamic graph-theoretic problem. The network is based on a set of bioreserves and patches linked by ecological corridors. The node dynamics, built upon the consensus protocol, form a time evolutive Mahalanobis distance weighted by the opportunity costs of timber production. We consider a case of complete graph, where the ecological network is fully connected, and a case of incomplete graph, where the ecological network is partially connected. The results show that the network equilibrium depends on the size of the reception zone, while the network connectivity depends on the environmental compatibility between the ecological areas. Through shadow prices, we find that securing connectivity in partially connected networks is more expensive than in fully connected networks, but should be undertaken when the opportunity costs are significant.

View all citing articles on Scopus

View full text

Short noteOptimal and suboptimal reserve selection algorithms

Abstract

Biol. Conserv.

Biol. Conserv.

Biol. Conserv.

Trends Ecol. Evolut.

Biol. Conserv.

Biol. Conserv.

OMEGA Int. J. Mgmt Sci.

Biol. Conserv.

Short note
Optimal and suboptimal reserve selection algorithms