Dynamic reserve design with the union-find algorithm

Paul Harrison, Daniel A. Spring, Michael Mackenzie, Ralph MAC NALLY

Research output: Contribution to journalArticle

12 Citations (Scopus)

Abstract

When reserve networks are established over time, there is a risk that sites will be developed in areas planned for future reservation, reducing the effectiveness of reserves. We developed a dynamic reserve design model that maximizes the expected number of species conserved, taking account of the risk of future habitat loss and fragmentation. The model makes use of the union-find algorithm, which is an efficient method for maintaining a list of connected regions in a graph as nodes and edges are inserted. A simple extension of the algorithm allows us to efficiently determine, for each species, when a sequence of site selections results in a reserve in which the species can persist. The extension also allows us to determine when a sequence of deforestation events results in the species becoming non-viable. The dynamic reserve design model is much more effective than commonly used heuristics, particularly when multiple connected sites are required for species persistence. The model also is able to solve much larger problems with greater effectiveness than the only previous dynamic reserve design model that considered site connectivity relationships. The union-find algorithm has much scope for addressing ecological management problems in which dynamic connectivity needs to be considered.
Original languageEnglish
Pages (from-to)369-376
Number of pages8
JournalEcological Modelling
Volume215
DOIs
Publication statusPublished - 2008
Externally publishedYes

Fingerprint

reserve design
connectivity
habitat loss
habitat fragmentation
site selection
heuristics
deforestation
persistence

Cite this

Harrison, Paul ; Spring, Daniel A. ; Mackenzie, Michael ; MAC NALLY, Ralph. / Dynamic reserve design with the union-find algorithm. In: Ecological Modelling. 2008 ; Vol. 215. pp. 369-376.
@article{539e44eb3384415083fc573089bc8bb7,
title = "Dynamic reserve design with the union-find algorithm",
abstract = "When reserve networks are established over time, there is a risk that sites will be developed in areas planned for future reservation, reducing the effectiveness of reserves. We developed a dynamic reserve design model that maximizes the expected number of species conserved, taking account of the risk of future habitat loss and fragmentation. The model makes use of the union-find algorithm, which is an efficient method for maintaining a list of connected regions in a graph as nodes and edges are inserted. A simple extension of the algorithm allows us to efficiently determine, for each species, when a sequence of site selections results in a reserve in which the species can persist. The extension also allows us to determine when a sequence of deforestation events results in the species becoming non-viable. The dynamic reserve design model is much more effective than commonly used heuristics, particularly when multiple connected sites are required for species persistence. The model also is able to solve much larger problems with greater effectiveness than the only previous dynamic reserve design model that considered site connectivity relationships. The union-find algorithm has much scope for addressing ecological management problems in which dynamic connectivity needs to be considered.",
keywords = "Dynamic reserve design, Union-find algorithm, Connectivity, Graph theory.",
author = "Paul Harrison and Spring, {Daniel A.} and Michael Mackenzie and {MAC NALLY}, Ralph",
year = "2008",
doi = "10.1016/j.ecolmodel.2008.04.003",
language = "English",
volume = "215",
pages = "369--376",
journal = "Ecological Modelling",
issn = "0304-3800",
publisher = "Elsevier",

}

Dynamic reserve design with the union-find algorithm. / Harrison, Paul; Spring, Daniel A.; Mackenzie, Michael; MAC NALLY, Ralph.

In: Ecological Modelling, Vol. 215, 2008, p. 369-376.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Dynamic reserve design with the union-find algorithm

AU - Harrison, Paul

AU - Spring, Daniel A.

AU - Mackenzie, Michael

AU - MAC NALLY, Ralph

PY - 2008

Y1 - 2008

N2 - When reserve networks are established over time, there is a risk that sites will be developed in areas planned for future reservation, reducing the effectiveness of reserves. We developed a dynamic reserve design model that maximizes the expected number of species conserved, taking account of the risk of future habitat loss and fragmentation. The model makes use of the union-find algorithm, which is an efficient method for maintaining a list of connected regions in a graph as nodes and edges are inserted. A simple extension of the algorithm allows us to efficiently determine, for each species, when a sequence of site selections results in a reserve in which the species can persist. The extension also allows us to determine when a sequence of deforestation events results in the species becoming non-viable. The dynamic reserve design model is much more effective than commonly used heuristics, particularly when multiple connected sites are required for species persistence. The model also is able to solve much larger problems with greater effectiveness than the only previous dynamic reserve design model that considered site connectivity relationships. The union-find algorithm has much scope for addressing ecological management problems in which dynamic connectivity needs to be considered.

AB - When reserve networks are established over time, there is a risk that sites will be developed in areas planned for future reservation, reducing the effectiveness of reserves. We developed a dynamic reserve design model that maximizes the expected number of species conserved, taking account of the risk of future habitat loss and fragmentation. The model makes use of the union-find algorithm, which is an efficient method for maintaining a list of connected regions in a graph as nodes and edges are inserted. A simple extension of the algorithm allows us to efficiently determine, for each species, when a sequence of site selections results in a reserve in which the species can persist. The extension also allows us to determine when a sequence of deforestation events results in the species becoming non-viable. The dynamic reserve design model is much more effective than commonly used heuristics, particularly when multiple connected sites are required for species persistence. The model also is able to solve much larger problems with greater effectiveness than the only previous dynamic reserve design model that considered site connectivity relationships. The union-find algorithm has much scope for addressing ecological management problems in which dynamic connectivity needs to be considered.

KW - Dynamic reserve design

KW - Union-find algorithm

KW - Connectivity

KW - Graph theory.

U2 - 10.1016/j.ecolmodel.2008.04.003

DO - 10.1016/j.ecolmodel.2008.04.003

M3 - Article

VL - 215

SP - 369

EP - 376

JO - Ecological Modelling

JF - Ecological Modelling

SN - 0304-3800

ER -