Research Output

Incorporating connectivity into reserve selection procedures.

  Methods for selecting sites to be included in reserve networks generally neglect the spatial location of sites, often resulting in highly fragmented networks. This restricts the possibility of dispersal between sites, which for many species may be essential for long-term persistence. Here I describe iterative reserve selection algorithms which incorporate considerations of reserve connectivity and evaluate their performance using a data set for macroinvertebrates in ponds. Methods where spatial criteria were only invoked when ties between sites occurred did not perform significantly better than a simple greedy algorithm in terms of reserve connectivity. An algorithm based on a composite measure of species added and changes in reserve connectivity produced a reserve network with higher connectivity, but needed more sites to represent all species. A trade-off between connectivity and efficiency may be inevitable, but the costs in terms of efficiency may be justified if long-term persistence of species is more likely.

  • Type:

    Article

  • Date:

    01 January 2002

  • Publication Status:

    Published

  • Publisher

    Elsevier

  • DOI:

    10.1016/S0006-3207(01)00123-9

  • ISSN:

    0006-3207

  • Dewey Decimal Classification:

    570 Life sciences; biology

Citation

Briers, R. A. (2002). Incorporating connectivity into reserve selection procedures. Biological Conservation. 103, 77-83. doi:10.1016/S0006-3207(01)00123-9. ISSN 0006-3207

Authors

Keywords

Iterative algorithm; Spatial criteria; Efficiency; Pond conservation

Available Documents