Mathematical methods for spatially cohesive reserve design

Environmental Modeling and Assessment

Volumn 7, Issue 2, 2002, Pages 107-114

  McDonnell, Mark D ^a   Possingham, Hugh P ^b   Ball, Ian R ^c   Cousins, Elizabeth A ^a  

^a UNIVERSITY OF ADELAIDE   (Australia)

^b UNIVERSITY OF QUEENSLAND   (Australia)

^c AUSTRALIAN ANTARCTIC DIVISION   (Australia)

Author keywords

Clustering; Fragmentation; Multiobjective optimisation; Optimisation heuristics; Reserve design; Set covering problem; Simulated annealing; Spatial

Indexed keywords

BIODIVERSITY; HEURISTIC ALGORITHMS; INTEGER PROGRAMMING; MULTIOBJECTIVE OPTIMIZATION; SIMULATED ANNEALING;

CLUSTERING; FRAGMENTATION; OPTIMISATIONS; RESERVE DESIGN; SET COVERING PROBLEM; SPATIAL;

HEURISTIC METHODS;

ALGORITHM; BIODIVERSITY; NATURE RESERVE; NUMERICAL METHOD; RESERVE DESIGN; SIMULATED ANNEALING;

AUSTRALIA; NORTHERN TERRITORY;

EID: 0036274208     PISSN: 14202026     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1015649716111     Document Type: Article

References (18)

1. J.A. McNeely, K.R. Miller, W.V. Reid, R.A. Mittermeier and T.B. Werner, Conserving the World's Biodiversity (IUCN Publication Services, Gland, 1990).
2. M.E. Soule, Conservation: Tactics for a constant crisis, Science 253 (1991) 744-750.
3. H. Possingham, I. Ball and S. Andelman, Mathematical methods for identifying representative reserve networks, in: Quantitative Methods for Conservation Biology, eds. S. Ferson and M. Burgman (Springer, New York, 2000) pp. 291-305.
4. H.P. Possingham, J.R. Day, M. Goldfinch and F. Salzborn, The mathematics of designing a network of protected areas for conservation, in: Decision Sciences: Tools for Today. Proceedings of 12th National ASOR Conference, eds. D.J. Sutton, C.E.M. Pearce and E.A. Cousins (ASOR, Adelaide, 1993) pp. 536-545.
5. H.A. Taha, Operations Research, An Introduction, 5th Ed. (MacMillan Publishing Company, 1992).
6. R.L. Pressey, H.P. Possingham and J.R. Day, Effectiveness of alternative heuristic algorithms for identifying indicative minimum requirements for conservation reserves, Biological Conservation 80 (1997) 207-219.
7. I. Ball, A. Smith, J.R. Day, R.L. Pressey and H.P. Possingham, Comparison of mathematical algorithms for the design of a reserve system for nature conservation: An application of genetic algorithms and simulated annealing, Journal of Environmental Management (1998), in press.
8. R.L. Pressey, H.P. Possingham and C.R. Margules, Optimality in reserve selection algorithms: When does it matter and how much?, Biological Conservation 76 (1996) 259-267.
9. W.F. Fagan, R.S. Cantrell and C. Cosner, How habitat edges change species interactions, American Naturalist (1999), in press.
10. A.O. Nicholls and C.R. Margules, An upgraded reserve selection algorithm, Biological Conservation 64 (1993) 165-169.
11. I.R. Ball, Mathematical applications for conservation ecology: The dynamics of tree hollows and the design of nature reserves, Ph.D. thesis, The University of Adelaide (2000).
12. J.L. Cohen, Multiobjective Programming and Planning (Academic Press, 1978).
13. J. Wright, C. ReVelle and J. Cohen, A multiobjective integer programming model for the land acquisition problem, Regional Science and Urban Economics 13 (1983) 31-53.
14. K.C. Gilbert, D.D. Holmes and R.E. Rosenthal, A mutliobjective discrete optimization model for land allocation, Management Science 31 (1985) 1509-1522.
15. M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness (Freeman, San Fransisco, CA, 1979).
16. S. Kirkpatrick, C.D. Gelatt, Jr. and M.P. Vecchi, Optimisation by simulated annealing, Science 220 (1983) 671-680.
17. R.H.J.M. Otten and L.P.P.P. Van Ginneken, The Annealing Algorithm (Kluwer Academic Publishers, 1989).
18. M. Lundy and A. Mees, Convergence of an annealing algorithm, Mathematical Programming 34 (1986) 111-124.