Flexibility, efficiency, and accountability: adapting reserve selection algorithms to more complex conservation problems

被引:101
作者
Rodrigues, AS [1 ]
Cerdeira, JO
Gaston, KJ
机构
[1] Univ Sheffield, Dept Anim & Plant Sci, Sheffield S10 2TN, S Yorkshire, England
[2] Inst Super Agron, Dept Math, P-1349018 Lisbon, Portugal
关键词
D O I
10.1034/j.1600-0587.2000.230507.x
中图分类号
X176 [生物多样性保护];
学科分类号
090705 ;
摘要
Flexibility, efficiency and accountability are considered key attributes of good reserve selection methods. Flexibility, the ability to incorporate all the diversity of considerations, concerns and information that typically impinge on real conservation problems, is fundamental if the particulars of any given situation are to be addressed and land use conflicts are to be effectively resolved. High efficiency, the representation of the maximum diversity of the relevant Features (e.g. species) at the minimum cost, is important because reserves will commonly be in direct competition with other forms of land use. Accountability means that the solutions are obtained in a transparent way, allowing others to understand why and how the result was arrived at. Because of the robustness of the general integer linear model, a remarkably rich variety of problems concerning the management and efficient use of scarce resources can be represented as problems of this type. This study starts by analysing a simple representation problem and then develops more general problems that can be applied to a variety of conservation planning exercises. It is illustrated how high flexibility can be attained, while simultaneously addressing efficiency and accountability, by modelling reserve selection questions as integer linear problems.
引用
收藏
页码:565 / 574
页数:10
相关论文
共 47 条
[1]   Species distributions, land values, and efficient conservation [J].
Ando, A ;
Camm, J ;
Polasky, S ;
Solow, A .
SCIENCE, 1998, 279 (5359) :2126-2128
[2]  
[Anonymous], 1979, Computers and Intractablity: A Guide to the Theoryof NP-Completeness
[3]  
BALAS E, 1980, MATH PROGRAM STUD, V12, P19, DOI 10.1007/BFb0120885
[4]  
BALAS E, 1980, MATH PROG STUD, V12, P27
[5]   A NEW APPROACH FOR SELECTING FULLY REPRESENTATIVE RESERVE NETWORKS - ADDRESSING EFFICIENCY, RESERVE DESIGN AND LAND SUITABILITY WITH AN ITERATIVE ANALYSIS [J].
BEDWARD, M ;
PRESSEY, RL ;
KEITH, DA .
BIOLOGICAL CONSERVATION, 1992, 62 (02) :115-125
[6]   A note on optimal algorithms for reserve site selection [J].
Camm, JD ;
Polasky, S ;
Solow, A ;
Csuti, B .
BIOLOGICAL CONSERVATION, 1996, 78 (03) :353-355
[7]   Reserve selection as a maximal covering location problem [J].
Church, RL ;
Stoms, DM ;
Davis, FW .
BIOLOGICAL CONSERVATION, 1996, 76 (02) :105-112
[8]   USING MATHEMATICAL-PROGRAMMING TO ADDRESS THE MULTIPLE RESERVE SELECTION PROBLEM - AN EXAMPLE FROM THE EYRE PENINSULA, SOUTH-AUSTRALIA [J].
COCKS, KD ;
BAIRD, IA .
BIOLOGICAL CONSERVATION, 1989, 49 (02) :113-130
[9]   A comparison of reserve selection algorithms using data on terrestrial vertebrates in Oregon [J].
Csuti, B ;
Polasky, S ;
Williams, PH ;
Pressey, RL ;
Camm, JD ;
Kershaw, M ;
Kiester, AR ;
Downs, B ;
Hamilton, R ;
Huso, M ;
Sahr, K .
BIOLOGICAL CONSERVATION, 1997, 80 (01) :83-97
[10]  
Freitag S, 1998, S AFR J SCI, V94, P79