IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v231y2013i1p202-209.html
   My bibliography  Save this article

A new method to solve the fully connected Reserve Network Design Problem

Author

Listed:
  • Jafari, Nahid
  • Hearne, John

Abstract

In selecting sites for conservation purposes connectivity of habitat is important for allowing species to move freely within a protected area. The aim of the Reserve Network Design Problem is to choose a network of contiguous sites which maximises some conservation objective subject to various constraints. The problem has been solved using both heuristic and exact methods. Heuristic methods can handle much larger problems than exact methods but cannot guarantee an optimal solution. Improvements in both computer power and optimisation algorithms have increased the attractiveness of exact methods. The aim of this work is to formulate an improved algorithm for solving the Reserve Network Design Problem.

Suggested Citation

  • Jafari, Nahid & Hearne, John, 2013. "A new method to solve the fully connected Reserve Network Design Problem," European Journal of Operational Research, Elsevier, vol. 231(1), pages 202-209.
    • Handle: RePEc:eee:ejores:v:231:y:2013:i:1:p:202-209
    DOI: 10.1016/j.ejor.2013.05.015
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221713004141
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ejor.2013.05.015?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
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. ,, 2003. "Problems And Solutions," Econometric Theory, Cambridge University Press, vol. 19(4), pages 691-705, August.
    2. ,, 2003. "Problems And Solutions," Econometric Theory, Cambridge University Press, vol. 19(1), pages 225-228, February.
    3. Memtsas, Dimitris P., 2003. "Multiobjective programming methods in the reserve selection problem," European Journal of Operational Research, Elsevier, vol. 150(3), pages 640-652, November.
    4. J. Orestes Cerdeira & Leonor S. Pinto, 2005. "Requiring Connectivity in the Set Covering Problem," Journal of Combinatorial Optimization, Springer, vol. 9(1), pages 35-47, February.
    5. ,, 2003. "Problems And Solutions," Econometric Theory, Cambridge University Press, vol. 19(5), pages 879-883, October.
    6. 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.
    7. Conrad, Jon M. & Gomes, Carla P. & van Hoeve, Willem-Jan & Sabharwal, Ashish & Suter, Jordan F., 2012. "Wildlife corridors as a connected subgraph problem," Journal of Environmental Economics and Management, Elsevier, vol. 63(1), pages 1-18.
    8. ,, 2003. "Problems And Solutions," Econometric Theory, Cambridge University Press, vol. 19(2), pages 411-413, April.
    9. ,, 2003. "Problems And Solutions," Econometric Theory, Cambridge University Press, vol. 19(6), pages 1195-1198, December.
    10. Stephen Polasky & Jeffrey D. Camm & Brian Garber-Yonts, 2001. "Selecting Biological Reserves Cost-Effectively: An Application to Terrestrial Vertebrate Conservation in Oregon," Land Economics, University of Wisconsin Press, vol. 77(1), pages 68-78.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Gerling, Charlotte & Schöttker, Oliver & Hearne, John, 2022. "Keep it or Leave it - the Role of Reversible Conservation Investments in Optimal Reserve Design under Climate Change," VfS Annual Conference 2022 (Basel): Big Data in Economics 264058, Verein für Socialpolitik / German Economic Association.
    2. Gerling, Charlotte & Schöttker, Oliver & Hearne, John, 2022. "Optimal time series in the reserve design problem under climate change," MPRA Paper 114691, University Library of Munich, Germany.
    3. Álvarez-Miranda, Eduardo & Goycoolea, Marcos & Ljubić, Ivana & Sinnl, Markus, 2021. "The Generalized Reserve Set Covering Problem with Connectivity and Buffer Requirements," European Journal of Operational Research, Elsevier, vol. 289(3), pages 1013-1029.
    4. Chih-Wei Lin & Yu Hong & Weihao Tu & Jinfu Liu, 2022. "Multiperiod Dynamic Programming Algorithm for Optimizing a Nature Reserve," Sustainability, MDPI, vol. 14(6), pages 1-17, March.
    5. Önal, Hayri & Wang, Yicheng & Dissanayake, Sahan T.M. & Westervelt, James D., 2016. "Optimal design of compact and functionally contiguous conservation management areas," European Journal of Operational Research, Elsevier, vol. 251(3), pages 957-968.
    6. Haider, Zulqarnain & Charkhgard, Hadi & Kwon, Changhyun, 2018. "A robust optimization approach for solving problems in conservation planning," Ecological Modelling, Elsevier, vol. 368(C), pages 288-297.
    7. Gerling, Charlotte & Schöttker, Oliver & Hearne, John, 2022. "Irreversible and partly reversible investments in the optimal reserve design problem: the role of flexibility under climate change," MPRA Paper 112089, University Library of Munich, Germany.

    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. Billionnet, Alain, 2011. "Solving the probabilistic reserve selection problem," Ecological Modelling, Elsevier, vol. 222(3), pages 546-554.
    2. Gerling, Charlotte & Schöttker, Oliver & Hearne, John, 2022. "Irreversible and partly reversible investments in the optimal reserve design problem: the role of flexibility under climate change," MPRA Paper 112089, University Library of Munich, Germany.
    3. Yakut, Oguz, 2021. "Implementation of hydraulically driven barrel shooting control by utilizing artificial neural networks," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 190(C), pages 1206-1223.
    4. X. Qin & G. Huang, 2009. "An Inexact Chance-constrained Quadratic Programming Model for Stream Water Quality Management," Water Resources Management: An International Journal, Published for the European Water Resources Association (EWRA), Springer;European Water Resources Association (EWRA), vol. 23(4), pages 661-695, March.
    5. Md. Yousuf Gazi & Khandakar Tahmida Tafhim, 2019. "Investigation of Heavy-mineral Deposits Using Multispectral Satellite Imagery in the Eastern Coastal Margin of Bangladesh," Earth Sciences Malaysia (ESMY), Zibeline International Publishing, vol. 3(2), pages 16-22, October.
    6. Minghe Sun, 2005. "Warm-Start Routines for Solving Augmented Weighted Tchebycheff Network Programs in Multiple-Objective Network Programming," INFORMS Journal on Computing, INFORMS, vol. 17(4), pages 422-437, November.
    7. François Clautiaux & Cláudio Alves & José Valério de Carvalho & Jürgen Rietz, 2011. "New Stabilization Procedures for the Cutting Stock Problem," INFORMS Journal on Computing, INFORMS, vol. 23(4), pages 530-545, November.
    8. Tansel, Aysit & Karao?lan, Deniz, 2016. "The Causal Effect of Education on Health Behaviors: Evidence from Turkey," IZA Discussion Papers 10020, Institute of Labor Economics (IZA).
    9. Timothy K.M. Beatty & Erling Røed Larsen & Dag Einar Sommervoll, 2005. "Measuring the Price of Housing Consumption for Owners in the CPI," Discussion Papers 427, Statistics Norway, Research Department.
    10. Melega, Gislaine Mara & de Araujo, Silvio Alexandre & Jans, Raf, 2018. "Classification and literature review of integrated lot-sizing and cutting stock problems," European Journal of Operational Research, Elsevier, vol. 271(1), pages 1-19.
    11. Roth, Alvin E. & Sonmez, Tayfun & Utku Unver, M., 2005. "Pairwise kidney exchange," Journal of Economic Theory, Elsevier, vol. 125(2), pages 151-188, December.
    12. repec:dau:papers:123456789/5389 is not listed on IDEAS
    13. Wong, Patricia J.Y., 2015. "Eigenvalues of a general class of boundary value problem with derivative-dependent nonlinearity," Applied Mathematics and Computation, Elsevier, vol. 259(C), pages 908-930.
    14. A. Bensoussan & K. Sung & S. Yam, 2013. "Linear–Quadratic Time-Inconsistent Mean Field Games," Dynamic Games and Applications, Springer, vol. 3(4), pages 537-552, December.
    15. Kojima, Fuhito, 2013. "Efficient resource allocation under multi-unit demand," Games and Economic Behavior, Elsevier, vol. 82(C), pages 1-14.
    16. Chein-Shan Liu & Zhuojia Fu & Chung-Lun Kuo, 2017. "Directional Method of Fundamental Solutions for Three-dimensional Laplace Equation," Journal of Mathematics Research, Canadian Center of Science and Education, vol. 9(6), pages 112-123, December.
    17. Alberto Cabada & Om Kalthoum Wanassi, 2020. "Existence Results for Nonlinear Fractional Problems with Non-Homogeneous Integral Boundary Conditions," Mathematics, MDPI, vol. 8(2), pages 1-13, February.
    18. Odysseas Kosmas & Pieter Boom & Andrey P. Jivkov, 2021. "On the Geometric Description of Nonlinear Elasticity via an Energy Approach Using Barycentric Coordinates," Mathematics, MDPI, vol. 9(14), pages 1-16, July.
    19. Hossein Karshenas & Concha Bielza & Pedro Larrañaga, 2015. "Interval-based ranking in noisy evolutionary multi-objective optimization," Computational Optimization and Applications, Springer, vol. 61(2), pages 517-555, June.
    20. B. S. C. Campello & C. T. L. S. Ghidini & A. O. C. Ayres & W. A. Oliveira, 2022. "A residual recombination heuristic for one-dimensional cutting stock problems," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 30(1), pages 194-220, April.
    21. Beddoe, Gareth R. & Petrovic, Sanja, 2006. "Selecting and weighting features using a genetic algorithm in a case-based reasoning approach to personnel rostering," European Journal of Operational Research, Elsevier, vol. 175(2), pages 649-671, December.

    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:eee:ejores:v:231:y:2013:i:1:p:202-209. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    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.