Using siting algorithms in the design of marine reserve networks

Leslie, Heather, Ruckelshaus, Mary, Ball, Ian R., Andelman, Sandy and Possingham, Hugh P. (2003) Using siting algorithms in the design of marine reserve networks. Ecological Applications, 13 sp1: 185-198. doi:10.1890/1051-0761(2003)013[0185:USAITD]2.0.CO;2

Attached Files (Some files may be inaccessible until you login with your UQ eSpace credentials)
Name Description MIMEType Size Downloads
UQ64471_OA.pdf Full text (open access) application/pdf 484.79KB 54

Author Leslie, Heather
Ruckelshaus, Mary
Ball, Ian R.
Andelman, Sandy
Possingham, Hugh P.
Title Using siting algorithms in the design of marine reserve networks
Journal name Ecological Applications   Check publisher's open access policy
ISSN 1051-0761
1939-5582
Publication date 2003
Sub-type Article (original research)
DOI 10.1890/1051-0761(2003)013[0185:USAITD]2.0.CO;2
Open Access Status File (Publisher version)
Volume 13
Issue sp1
Start page 185
End page 198
Total pages 14
Place of publication Washington, DC, United States
Publisher Ecological Society of America
Collection year 2003
Language eng
Abstract Using benthic habitat data from the Florida Keys (USA), we demonstrate how siting algorithms can help identify potential networks of marine reserves that comprehensively represent target habitat types. We applied a flexible optimization tool-simulated annealing-to represent a fixed proportion of different marine habitat types within a geographic area. We investigated the relative influence of spatial information, planning-unit size, detail of habitat classification, and magnitude of the overall conservation goal on the resulting network scenarios. With this method, we were able to identify many adequate reserve systems that met the conservation goals, e.g., representing at least 20% of each conservation target (i.e., habitat type) while fulfilling the overall aim of minimizing the system area and perimeter. One of the most useful types of information provided by this siting algorithm comes from an irreplaceability analysis, which is a count of the number of, times unique planning units were included in reserve system scenarios. This analysis indicated that many different combinations of sites produced networks that met the conservation goals. While individual 1-km(2) areas were fairly interchangeable, the irreplaceability analysis highlighted larger areas within the planning region that were chosen consistently to meet the goals incorporated into the algorithm. Additionally, we found that reserve systems designed with a high degree of spatial clustering tended to have considerably less perimeter and larger overall areas in reserve-a configuration that may be preferable particularly for sociopolitical reasons. This exercise illustrates the value of using the simulated annealing algorithm to help site marine reserves: the approach makes efficient use of;available resources, can be used interactively by conservation decision makers, and offers biologically suitable alternative networks from which an effective system of marine reserves can be crafted.
Keyword Ecology
Conservation Planning
Florida Keys
Habitat Diversity
Marine Reserves
Optimization
Representative
Reserve Selection
Simulated Annealing
Siting Algorithms
Spatial Clustering
Selection Algorithms
Biological Diversity
Conservation
Connectivity
Sites
Q-Index Code C1

 
Versions
Version Filter Type
Citation counts: TR Web of Science Citation Count  Cited 98 times in Thomson Reuters Web of Science Article | Citations
Scopus Citation Count Cited 0 times in Scopus Article
Google Scholar Search Google Scholar
Created: Tue, 14 Aug 2007, 19:10:23 EST