Designing a conservation reserve network with minimal fragmentation: A linear integer programming approach

Environmental Modeling and Assessment

Volumn 10, Issue 3, 2005, Pages 193-202

  Önal, Hayri ^a   Briers, Robert A ^b  

^a UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

^b EDINBURGH NAPIER UNIVERSITY   (United Kingdom)

Author keywords

Conservation reserve; Fragmentation; Graph; Linear integer programming; Network tree; Species representation

Indexed keywords

CONSERVATION; SITE SELECTION; TREES (MATHEMATICS);

BIOLOGICAL CONSERVATION; CONSERVATION PLANNING; FRAGMENTATION; GRAPH; HABITAT FRAGMENTATION; LINEAR INTEGER PROGRAMMING; SELECTION PROBLEMS; SPECIES REPRESENTATION;

INTEGER PROGRAMMING;

BIRD; BREEDING POPULATION; COMPUTER SIMULATION; CONSERVATION MANAGEMENT; DATA SET; FRAGMENTATION; NUMERICAL MODEL; RESERVE DESIGN; SITE SELECTION;

AVES;

EID: 29244488740     PISSN: 14202026     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10666-005-9009-3     Document Type: Article

References (36)

1. A. Ando, J.D. Camm, S. Polasky and A. Solow, Species distribution, land values and efficient conservation, Science 279 (1998) 2126-2128.
2. M. Bazaraa, J.J. Jarvis and H.D. Sherali, Linear Programming and Network Flows (John Wiley and Sons, New York, 1990).
3. P. Beier and R.F. Noss, Do habitat corridors provide connectivity? Conserv. Biol. 12 (1998) 1241-1252.
4. R.A. Briers, Incorporating connectivity into reserve selection procedures, Biol. Conserv. 103 (2002) 77-83.
5. J.D. Camm, S. Polasky, A. Solow and B. Csuti, A note on optimal algorithms for reserve site selection, Biol. Conserv. 78 (1996) 353-355.
6. R.L. Church and C. ReVelle, The maximum covering location problem, Pap. Reg. Sci. Assoc. 32 (1974) 101-118.
7. R.L. Church, D.M. Stoms and F.W. Davis, Reserve selection as a maximal covering location problem, Biol. Conserv. 76 (1996) 105-112.
8. B. Csuti, S. Polasky, P.H. Williams, R.L. Pressey, J.D. Camm, M. Kershaw, R. Kiester, B. Downs, R. Hamilton, M. Huso and K. Sahr, A comparison of reserve selection algorithms using data on terrestrial vertebrates in Oregon, Biol. Conserv. 80 (1997) 83-97.
9. C.A. Haas, Dispersal and use of corridors by birds in wooded patches on an agricultural landscape, Conserv. Biol. 9 (1995) 845-854.
10. S. Harrison, Metapopulations and conservation, in: Large-Scale Ecology and Conservation Biology, eds. P.J. Edwards, R.M. May and N.R. Webb (Blackwell Scientific, Oxford, 1994) pp. 111-128.
11. C.S. Machtans, M.-A. Villard and S.J. Hannon, Use of riparian buffer strips as movement corridors by forest birds. Conserv. Biol. 10 (1996) 1366-1379.
12. C.R. Margules, A.O. Nicholls and R.L. Pressey, Selecting networks of reserves to maximize biological diversity, Biol. Conserv. 43 (1988) 63-76.
13. D.J. Nalle, J.L. Arthur and J. Sessions, Designing compact and contiguous reserve networks with a hybrid heuristic algorithm, For. Sci. 48 (2002) 59-68.
14. A.O. Nicholls and C.R. Margules, An upgraded reserve selection algorithm, Biol. Conserv. 64 (1993) 165-169.
15. H. Önal, First best, second best, and heuristic solutions in conservation reserve selection, Biol. Conserv. 115 (2004) 55-62.
16. H. Önal and R.A. Briers, Incorporating spatial criteria in optimum reserve selection, Proc. R. Soc. Lond. B 269 (2002) 2437-2441.
17. H. Önal and R.A. Briers, Selection of a minimum-boundary reserve network using integer programming, Proc. R. Soc. Lond. B 270 (2003) 1487-1491.
18. S. Polasky, J.D. Camm and B. Garber-Yonts, Selecting biological reserves cost-effectively: an application to terrestrial vertebrate conservation in Oregon, Land Econ. 77 (2001) 68-78.
19. R.L. Pressey, C.J. Humphries, C.R. Margules, R.I. Vane-Wright and P.H. Williams, Beyond opportunism: key principles for systematic reserve selection, Trends Ecol. Evol. 8 (1993) 124-128.
20. R.L. Pressey, H.P. Possingham and J.R. Day, Effectiveness of alternative heuristic algorithms for identifying indicative minimum requirements for conservation reserves, Biol. Conserv. 80 (1997) 207-219.
21. R.L. Pressey, H.P. Possingham and C.R. Margules, Optimality in reserve selection algorithms: when does it matter and how much?, Biol. Conserv. 76 (1996) 259-267.
22. A.S.L. Rodrigues and K.J. Gaston, Optimisation in reserve selection procedures - why not?, Biol. Conserv. 107 (2002) 123-129.
23. A.A. Ruliffson, P.H. Haight, P.H. Gobster and F.R. Homans, Metropolitan natural area protection to maximize public access and species representation, Environ. Sci. Policy 6 (2003) 291-299.
24. C.L. Shafer, Inter-reserve distance, Biol. Conserv. 100 (2001) 215-227.
25. D. Simberloff, J.A. Farr, J. Cox and D.W. Moehlman, Movement corridors: conservation bargains or poor investments. Conserv. Biol. 6 (1992) 493-504.
26. P. Standley, N.J. Bucknell, A. Swash and I.D. Collins, The Birds of Berkshire (Berkshire Atlas Group, Reading, 1996).
27. L.G. Underhill, Optimal and suboptimal reserve selection algorithms, Biol. Conserv. 70 (1994) 85-87.
28. R.I. Vane-Wright, C.J. Humphries and P.H. Williams, What to protect? Systematics and the agony of choice, Biol. Conserv. 55 (1991) 235-254.
29. J.C. Williams, Delineating protected wildlife corridors with multiple-objective programming, Environ. Model. Assess. 3 (1998) 77-86.
30. J.C. Williams, A linear-size zero-one programming model for the minimum spanning tree problem in planar graphs, Networks 39 (2001) 53-60.
31. J.C. Williams, A zero-one programming model for contiguous land acquisition, Geogr. Anal. 34 (2002) 330-349.
32. J.C. Williams and C.S. ReVelle, A 0-1 programming approach to delineating protected reserves, Environ. Plann. B Plann. Des. 23 (1996) 607-624.
33. J.C. Williams and C.S. ReVelle, Applying mathematical programming to reserve selection, Environ. Model. Assess. 2 (1997) 167-175.
34. J.C. Williams and C.S. ReVelle, Reserve assemblage of critical areas: a zero-one programming approach, Eur. J. Oper. Res. 104 (1998) 497-509.
35. P.H. Williams, Complementarity, in: Encyclopedia of Biodiversity, ed. S.A. Levin (Academic Press, San Diego, 2000) pp. 813-829.
36. J. Wright, C.S. ReVelle and J. Cohon, A multiobjective integer programming model for the land acquisition problem, Reg. Sci. Urban Econ. 13 (1983) 31-53.