Abstract
Five classes of zero–one programming models for discrete facility location problems are compared to counterpart models for the selection of conservation reserves. The basic problem of siting facilities to cover demand for services is analogous to the problem of selecting reserves to support species diversity. The classes of models include the set covering and maximal covering models, as well as models for backup and redundant coverage. Issues of reliability and uncertainty are addressed by chance constrained covering models and maximal expected covering models. Exact and heuristic solution approaches are discussed. Multi-objective and economic issues are considered.
Similar content being viewed by others
References
A. Ando, J. Camm, S. Polasky and A. Solow, Species distributions, land values, and efficient conservation, Science 279 (1998) 2126–2128.
J.D. Camm, S. Polasky, A. Solow and B. Csuti, A note on optimal algorithms for reserve site selection, Biological Conservation 78 (1996) 353–355.
C.-H. Chung, Recent applications of the maximal covering location planning (MCLP) model, Journal of the Operational Research Society 37 (1986) 735–746.
R. Church and C. ReVelle, The maximal covering location problem, Papers of the Regional Science Association 32 (1974) 101–118.
R.L. Church, D.M. Stoms and F.W. Davis, Reserve selection as amaximal covering location problem, Biological Conservation 76 (1996) 105–112.
J.L. Cohon, Multiobjective Programming and Planning (Academic Press, New York, 1978).
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.
M. Daskin, A maximum expected covering location model: Formulation, properties, and heuristic solution, Transportation Science 17 (1983) 48–70.
M. Daskin and E. Stern, A hierarchical objective set covering model for emergency medical service deployment, Transportation Science 15 (1981) 137–152.
P. Densham and G. Rushton, A more efficient heuristic for solving large p-median problems, Papers in Regional Science 71 (1992) 307–329.
F. Dwyer and J. Evans, A branch and bound algorithm for the list selection problem in direct mail advertising, Management Science 27 (1981) 658–667.
D.J.D. Earn, S.A. Levin and P. Rohani, Coherence and conservation, Science 290 (2000) 1360–1364.
D. Eaton, U. Sanchez, H. Mi, R. Lantigua and J. Morgan, Determining ambulance deployment in Santo Domingo, Dominican Republic, Journal of the Operational Research Society 37 (1986) 113–126.
K.C. Gilbert, D.D. Holmes and R.E. Rosenthal, A multiobjective discrete optimization model for land allocation, Management Science 31 (1985) 1509–1522.
R. Haight, C. ReVelle and S. Snyder, An integer optimization approach to a probabilistic reserve site selection problem, Operations Research 48 (2000) 697–708.
J. Hof, M. Bevers, L. Joyce and B. Kent, An integer programming approach for spatially and temporally optimizing wildlife populations, Forest Science 40 (1994) 177–191.
K. Hogan and C. ReVelle, Concepts and applications of backup coverage, Management Science 32 (1986) 1434–1444.
P. Kolesar, Testing for vision loss in glaucoma suspects, Management Science 26 (1980) 439–448.
S.A. Levin, B. Grenfell, A. Hastings and A.S. Perelson, Mathematical and computational challenges in population biology and ecosystem science, Science 275 (1997) 334–342.
S. Malcolm and C. ReVelle, Models for preserving species diversity with backup and redundant coverage, in preparation.
C. Margules, A. Nichols and R. Pressey, Selecting networks of reserves to maximize biological diversity, Biological Conservation 43 (1988) 63–76.
M. McDonnell, H. Possingham, I. Ball and E. Cousins, Mathematical methods for spatially cohesive reserve design, Environmental Modeling and Assessment, this issue.
S. Polasky, J. Camm, A. Solow, B. Csuti, D. White and R. Ding, Choosing reserve networks with incomplete species information, Biological Conservation 94 (2000) 1–10.
H. Possingham, J. 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 the 12th Australian Operations Research Conference, eds. D. Sutton, E. Cousins and C. Pierce (ASOR, Adelaide, 1993) pp. 536–545.
H. Possingham, I. Ball and S. Andelman, Mathematical methods for identifying representative reserve networks, in: Quantitative Methods for Conservatin Biology, eds. S. Ferson and M. Burgman (Springer, New York, 2000) pp. 291–306.
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 (1993) 124–128.
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.
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.
R.L. Pressey, H.P. Possingham, V.S. Logan, J.R. Day and P.H. Williams, Effects of data characteristics on the results of reserve selection algorithms, Journal of Biogeography 26 (1999) 179–191.
C. ReVelle, Facility siting and integer-friendly programming, European Journal of Operational Research 65 (1993) 147–158.
C. ReVelle and K. Hogan, The maximum reliability location problem and alpha reliable p-center problem: Derivatives of the probabilistic location set covering problem, Annals of Operations Research 18 (1989) 155–174.
C. ReVelle and K. Hogan, The maximum availability location problem, Transportation Science 23 (1989) 192–200.
C. ReVelle, C. Toregas and L. Falkson, Applications of the location set covering problem, Geographical Analysis 8 (1976) 65–74.
C. ReVelle, J. Cohon and D. Shobrys, Multiple objectives in facility location: A review, in: Organizations: Multiple Agents with Multiple Criteria, ed. J.N. Morse (Springer, Berlin, 1981) pp. 320–337.
K. Rosing and C. ReVelle, Heuristic concentration: Two stage solution construction, European Journal of Operational Research 97 (1997) 75–86.
D. Schilling, R. Rosing and C. ReVelle, Network distance characteristics that affect computational effort in p-median location problems, European Journal of Operational Research 127 (2000) 525–536.
J. Sessions, Solving for habitat connections as a Steiner network problem, Forest Science 38 (1992) 203–207.
S. Snyder and C. ReVelle, Multiobjective grid packing model: An application in forest management, Location Science 5 (1997) 165–180.
C. Toregas and C. ReVelle, Binary logic solutions to a class of location problems, Geographical Analysis 5 (1973) 145–155.
C. Toregas, R. Swain, C. ReVelle and L. Bergman, The location of emergency service facilities, Operations Research 19 (1971) 1363–1373.
L. Underhill, Optimal and suboptimal reserve selection algorithms, Biological Conservation 35 (1994) 85–87.
J.C. Williams, Delineating protected wildlife corridors with multiobjective programming, Environmental Modeling and Assessment 3 (1998) 77–86.
J.C. Williams and C.S. ReVelle, A 0–1 programming approach to delineating protected reserves, Environment and Planning B 23 (1996) 607–624.
J.C. Williams and C.S. ReVelle, Applying mathematical programming to reserve selection, Environmental Modeling and Assessment 2 (1997) 167–175.
J.C. Williams and C.S. ReVelle, Reserve assemblage of critical areas: A zero–one programming approach, European Journal of Operational Research 104 (1998) 497–509.
J. Wright, C. ReVelle and J. Cohon, A multiobjective integer programming model for the land acquisition problem, Regional Science and Urban Economics 13 (1983) 31–53.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
ReVelle, C.S., Williams, J.C. & Boland, J.J. Counterpart Models in Facility Location Science and Reserve Selection Science. Environmental Modeling & Assessment 7, 71–80 (2002). https://doi.org/10.1023/A:1015641514293
Issue Date:
DOI: https://doi.org/10.1023/A:1015641514293