Dynamic reserve design with the union-find algorithm |
| |
Authors: | Paul Harrison Daniel Spring Michael MacKenzie Ralph Mac Nally |
| |
Institution: | 1. Victorian Bioinformatics Consortium, Monash University. C/- Building 53, Monash University, Clayton, Victoria 3800, Australia;2. Australian Centre for Biodiversity, School of Biological Sciences, PO Box 18, Monash University, Clayton, Victoria 3800, Australia;3. School of Economics, Finance and Marketing, Faculty of Business, RMIT University, GPO Box 2476V, Melbourne 3000, Victoria, Australia |
| |
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 |
本文献已被 ScienceDirect 等数据库收录! |
|