Designing bioreserve networks to satisfy multiple, conflicting demands
Reserve designers typically strive to create reserves that satisfy a variety of potentially conflicting criteria. Rather than optimizing with respect to just one criterion, reserve planners are likely to seek some compromise. To facilitate bioreserve design, I propose the use of multiobjective progr...
Gespeichert in:
Veröffentlicht in: | Ecological applications 1999-08, Vol.9 (3), p.741-750 |
---|---|
1. Verfasser: | |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Zusammenfassung: | Reserve designers typically strive to create reserves that satisfy a variety of potentially conflicting criteria. Rather than optimizing with respect to just one criterion, reserve planners are likely to seek some compromise. To facilitate bioreserve design, I propose the use of multiobjective programming to identify these compromise alternatives, and then the use of the simple multiattribute rating technique to rank these alternatives and to explore the sensitivity of the rankings to the relative value placed on the individual criteria. An example is provided for the selection of a reserve system in Nova Scotia, Canada, based on three criteria: (1) connectedness, (2) area, and (3) rare species representation. First, multiobjective programming was used to reduce the set of over 15 000 potential reserve-system alternatives to a list of 36 candidate systems representing the optimal trade-offs among the three criteria. The simple attribute-rating technique was then used to identify a single best solution for an arbitrary set of relative criteria values and to test the robustness of this solution to changes in relative preferences for the criteria. The techniques presented here can simplify the evaluation of reserve alternatives, enabling planners to refocus their efforts on the complex biological, social, and economic aspects of reserve design. |
---|---|
ISSN: | 1051-0761 1939-5582 |
DOI: | 10.1890/1051-0761(1999)009[0741:DBNTSM]2.0.CO;2 |