Maximizing species representation under limited resources: A new and efficient heuristic

Environmental Modeling and Assessment

Volumn 7, Issue 2, 2002, Pages 91-98

  Rosing, K E ^a   ReVelle, C S ^b   Williams, J C ^b  

^a ERASMUS UNIVERSITY ROTTERDAM   (Netherlands)

^b JOHNS HOPKINS UNIVERSITY   (United States)

Author keywords

Interchange heuristic; Maximal covering problem; Species preservation

Indexed keywords

MAXIMAL COVERING PROBLEMS; NEAR-OPTIMAL SOLUTIONS; OBJECTIVE FUNCTIONS; SATISFACTORY SOLUTIONS;

OPTIMIZATION;

HABITAT MANAGEMENT; HABITAT STRUCTURE; HEURISTICS; NUMERICAL MODEL; SPECIES CONSERVATION; SPECIES DIVERSITY; SPECIES RICHNESS;

EID: 0036275487     PISSN: 14202026     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1015645615202     Document Type: Article

References (24)

1. J.D. Camm, S. Polasky, A.R. Solow and B. Csuti, A note on optimal algorithms for reserve site selection, Biological Conservation 78 (1996) 353-355.
2. R.L. Church, Synthesis of a Class of Public Facilities Location Models, unpublished Ph.D. thesis (The Johns Hopkins University, Baltimore, 1974).
3. R.L. Church and C.S. ReVelle, The maximum covering location problem, Papers in Regional Science 32 (1974) 101-118.
4. R.L. Church, D.M. Stoms and F.W. Davis, Reserve selection as a maximal covering location problem, Biological Conservation 76 (1996) 105-112.
5. K.D. Cocks and I.A. Baird, Using mathematical programming to address the multiple reserve selection problem: an example from the Eyre Peninsula, South Australia, Biological Conservation 49 (1989) 113-130.
6. G. Cornuejols, M.L. Fisher and G.L. Nemhauser, Location of bank accounts to optimize float: an analytic study of exact and approximate algorithms, Management Science 23 (1977) 789-810.
7. B. Csuti, S. Polasky, P.H. Williams, R.L. Pressey, J.D. Camm, M. Kershaw, A.R. Kiester, B. Downs, R. Hamilton, M. Huso and K. Sahr, A comparison of reserve selection algorithms using data on terrestrial vertebrates in Oregon, Biological Conservation 80 (1997) 83-97.
8. L. Masters, N. Clupper, E. Gaines, C. Bogert, R. Solomon and M. Ormes, Biodiversity Research Consortium Species Database Manual (The Nature Conservancy, Boston, MA, 1995).
9. Microsoft, Microsoft Fortran (Microsoft Corporation, Redmond, WA, 1993).
10. R.F. Noss and B. Csuti, Habitat fragmentation, in: Principles of Conservation Biology, eds. G.K. Meffe and C.R. Carrol (Sinauer Ass., Sunderland, MA, 1994) pp. 237-264.
11. S. Polasky, J.D. Camm, A.R. Solow, B. Csuti, D. White and R. Ding, Choosing reserve networks with incomplete species information, Biological Conservation 94 (2000) 1-10.
12. H. Possingham, J. Day, M. Goldfinch and F. Salborn, The mathematics of designing a network of protected areas for conservation, in: Decisions Sciences: Tools for Today, Proceedings of the 12th Australian Operations Research Conference, eds. D. Sutton, E. Cousins and C. Pierce (ASOR, Adelaide, 1993).
13. 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 in Ecology and Evolution 8(4) (1993) 124-128.
14. 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.
15. 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.
16. C.S. ReVelle and K.E. Rosing, Defenders imperium romanum: a classical problem in military strategy, American Mathematical Monthly 107 (2000) 585-594.
17. K.E. Rosing, C.S. ReVelle and H. Rosing-Vogelaar, Fractions in the location set covering problem, Environment and Planning B 19 (1992) 125-130.
18. K.E. Rosing and C.S. ReVelle, Integers in the location set covering problem, Environment and Planning B 20 (1993) 481-482.
19. D.A. Schilling, C.S. ReVelle, C. Cohon and D.J. Elzinga, Some models for fire protection location decisions, European Journal of Operational Research 5 (1980) 1-7.
20. D.A. Schilling, K.E. Rosing and C.S. ReVelle, Network distance characteristics that affect computational effort in p-median location problems, European Journal of Operational Research 127 (2000) 525-536.
21. S.A. Snyder, L.E. Tyrrell and R.G. Haight, An optimization approach to selecting research natural areas in national forests, Forest Science 45(3) (1999) 458-469.
22. L.G. Underhill, Optimal and suboptimal reserve selection algorithms, Biological Conservation 70 (1994) 85-87.
23. R.A. Whitaker, A fast algorithm for the greedy interchange for large-scale clustering and median problems, INFOR 21 (1983) 95-108.
24. B.A. Wilcox and D.D. Murphy, Conservation strategies: the effect of fragmentation on extinction, American Naturalist 125 (1985) 879-887.