IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v50y2002i6p946-955.html

Nature Reserve Site Selection to Maximize Expected Species Covered

Author

Listed:
  • Jeffrey D. Camm

    (Department of Quantitative Analysis and Operations Management, University of Cincinnati, Cincinnati, Ohio 45221-0130)

  • Susan K. Norman

    (College of Business Administration, Northern Arizona University, Flagstaff, Arizona 86011-5066)

  • Stephen Polasky

    (Department of Applied Economics, University of Minnesota, St. Paul, Minnesota 55108-6040)

  • Andrew R. Solow

    (Woods Hole Oceanographic Institution, Woods Hole, Massachusetts 02543)

Abstract

We analyze the problem of maximizing the expected number of species in a nature reserve network, subject to a constraint on the number of sites in the network, given probabilistic information about species occurrences. The problem is a nonlinear binary integer program that is NP-hard. We develop a linear integer programming approximation that may be solved with standard integer programming software. We compare the approximation with two other approaches, an expected greedy approach and a probability hurdle approach, using probabilistic data on occurrences of terrestrial vertebrates in the state of Oregon. Results of the approximation and an exact algorithm are compared by using samples from the North American Breeding Bird Survey.

Suggested Citation

  • Jeffrey D. Camm & Susan K. Norman & Stephen Polasky & Andrew R. Solow, 2002. "Nature Reserve Site Selection to Maximize Expected Species Covered," Operations Research, INFORMS, vol. 50(6), pages 946-955, December.
    • Handle: RePEc:inm:oropre:v:50:y:2002:i:6:p:946-955
    DOI: 10.1287/opre.50.6.946.351
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.50.6.946.351
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.50.6.946.351?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    References listed on IDEAS

    as
    1. Mark S. Daskin, 1983. "A Maximum Expected Covering Location Model: Formulation, Properties and Heuristic Solution," Transportation Science, INFORMS, vol. 17(1), pages 48-70, February.
    2. Charles ReVelle & Kathleen Hogan, 1989. "The Maximum Availability Location Problem," Transportation Science, INFORMS, vol. 23(3), pages 192-200, August.
    3. F. Robert Dwyer & James R. Evans, 1981. "A Branch and Bound Algorithm for the List Selection Problem in Direct Mail Advertising," Management Science, INFORMS, vol. 27(6), pages 658-667, June.
    4. Rajan Batta & June M. Dolan & Nirup N. Krishnamurthy, 1989. "The Maximal Expected Covering Location Problem: Revisited," Transportation Science, INFORMS, vol. 23(4), pages 277-287, November.
    5. Robert G. Haight & Charles S. Revelle & Stephanie A. Snyder, 2000. "An Integer Optimization Approach to a Probabilistic Reserve Site Selection Problem," Operations Research, INFORMS, vol. 48(5), pages 697-708, October.
    6. Gerard Cornuejols & Marshall L. Fisher & George L. Nemhauser, 1977. "Exceptional Paper--Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms," Management Science, INFORMS, vol. 23(8), pages 789-810, April.
    7. CORNUEJOLS, Gérard & FISHER, Marshall L. & NEMHAUSER, George L., 1977. "Location of bank accounts to optimize float: An analytic study of exact and approximate algorithms," LIDAM Reprints CORE 292, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    8. Nemhauser, G.L. & Wolsey, L.A., 1981. "Maximizing submodular set functions: formulations and analysis of algorithms," LIDAM Reprints CORE 455, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Robert Aboolian & Tingting Cui & Zuo-Jun Max Shen, 2013. "An Efficient Approach for Solving Reliable Facility Location Models," INFORMS Journal on Computing, INFORMS, vol. 25(4), pages 720-729, November.
    2. Ansari, Sina & Başdere, Mehmet & Li, Xiaopeng & Ouyang, Yanfeng & Smilowitz, Karen, 2018. "Advancements in continuous approximation models for logistics and transportation systems: 1996–2016," Transportation Research Part B: Methodological, Elsevier, vol. 107(C), pages 229-252.
    3. O’Hanley, Jesse R. & Scaparra, M. Paola & García, Sergio, 2013. "Probability chains: A general linearization technique for modeling reliability in facility location and related problems," European Journal of Operational Research, Elsevier, vol. 230(1), pages 63-75.
    4. Ramesh Bollapragada & Yanjun Li & Uday S. Rao, 2006. "Budget-Constrained, Capacitated Hub Location to Maximize Expected Demand Coverage in Fixed-Wireless Telecommunication Networks," INFORMS Journal on Computing, INFORMS, vol. 18(4), pages 422-432, November.
    5. Bertsimas, Dimitris & Ng, Yeesian, 2019. "Robust and stochastic formulations for ambulance deployment and dispatch," European Journal of Operational Research, Elsevier, vol. 279(2), pages 557-571.
    6. P. Daniel Wright & Matthew J. Liberatore & Robert L. Nydick, 2006. "A Survey of Operations Research Models and Applications in Homeland Security," Interfaces, INFORMS, vol. 36(6), pages 514-529, December.
    7. Caio Vitor Beojone & Regiane Máximo de Souza & Ana Paula Iannoni, 2021. "An Efficient Exact Hypercube Model with Fully Dedicated Servers," Transportation Science, INFORMS, vol. 55(1), pages 222-237, 1-2.
    8. Sorensen, Paul & Church, Richard, 2010. "Integrating expected coverage and local reliability for emergency medical services location problems," Socio-Economic Planning Sciences, Elsevier, vol. 44(1), pages 8-18, March.
    9. Li, Xiaopeng, 2013. "An integrated modeling framework for design of logistics networks with expedited shipment services," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 56(C), pages 46-63.
    10. Li, Xiaopeng & Ouyang, Yanfeng & Peng, Fan, 2013. "A supporting station model for reliable infrastructure location design under interdependent disruptions," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 60(C), pages 80-93.
    11. Hao Shen & Yong Liang & Zuo-Jun Max Shen, 2021. "Reliable Hub Location Model for Air Transportation Networks Under Random Disruptions," Manufacturing & Service Operations Management, INFORMS, vol. 23(2), pages 388-406, March.
    12. Pal, Raktim & Bose, Indranil, 2009. "An optimization based approach for deployment of roadway incident response vehicles with reliability constraints," European Journal of Operational Research, Elsevier, vol. 198(2), pages 452-463, October.
    13. Su, Qiang & Luo, Qinyi & Huang, Samuel H., 2015. "Cost-effective analyses for emergency medical services deployment: A case study in Shanghai," International Journal of Production Economics, Elsevier, vol. 163(C), pages 112-123.
    14. José A. Santiváñez & Emanuel Melachrinoudis, 2020. "Reliable maximin–maxisum locations for maximum service availability on tree networks vulnerable to disruptions," Annals of Operations Research, Springer, vol. 286(1), pages 669-701, March.
    15. Rajagopalan, Hari K. & Saydam, Cem, 2009. "A minimum expected response model: Formulation, heuristic solution, and application," Socio-Economic Planning Sciences, Elsevier, vol. 43(4), pages 253-262, December.
    16. Kurt Jörnsten & Andreas Klose, 2016. "An improved Lagrangian relaxation and dual ascent approach to facility location problems," Computational Management Science, Springer, vol. 13(3), pages 317-348, July.
    17. Shariat-Mohaymany, Afshin & Babaei, Mohsen & Moadi, Saeed & Amiripour, Sayyed Mahdi, 2012. "Linear upper-bound unavailability set covering models for locating ambulances: Application to Tehran rural roads," European Journal of Operational Research, Elsevier, vol. 221(1), pages 263-272.
    18. O'Hanley, Jesse R. & Church, Richard L., 2011. "Designing robust coverage networks to hedge against worst-case facility losses," European Journal of Operational Research, Elsevier, vol. 209(1), pages 23-36, February.
    19. Camilo Ortiz-Astorquiza & Ivan Contreras & Gilbert Laporte, 2017. "Formulations and Approximation Algorithms for Multilevel Uncapacitated Facility Location," INFORMS Journal on Computing, INFORMS, vol. 29(4), pages 767-779, November.
    20. Li, Xiaopeng & Ouyang, Yanfeng, 2011. "Reliable sensor deployment for network traffic surveillance," Transportation Research Part B: Methodological, Elsevier, vol. 45(1), pages 218-231, January.

    More about this item

    Keywords

    ;
    ;

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:inm:oropre:v:50:y:2002:i:6:p:946-955. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.