IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v219y2014i1p317-33110.1007-s10479-012-1154-x.html
   My bibliography  Save this article

Optimal post-stratification for the study of the sustainability: An application to the monitoring of diversity in Sierra de Guerrero

Author

Listed:
  • Sira Allende
  • Carlos Bouza
  • Dante Covarubias

Abstract

The need of designing a monitoring network in Sierra de Guerrero motivated this paper. The study of the effect of deforestation of the forest needs of monitoring in the diversity. A quantitative evaluation of diversity is measured by estimating an index. Commonly the monitoring of biodiversity is based on the periodical selection of samples for evaluating the diversity. We propose to use sample information for determining post strata. They must constitute homogeneous zones in the forest. A stochastic program is developed for determining the post strata to be used for sampling. The procedure seems to be a good alternative with respect to the use of a heuristic procedure. The results presented are based on the data obtained in a research developed at one of the most important forest diversity reservoirs of Mexico Copyright Springer Science+Business Media, LLC 2014

Suggested Citation

  • Sira Allende & Carlos Bouza & Dante Covarubias, 2014. "Optimal post-stratification for the study of the sustainability: An application to the monitoring of diversity in Sierra de Guerrero," Annals of Operations Research, Springer, vol. 219(1), pages 317-331, August.
    • Handle: RePEc:spr:annopr:v:219:y:2014:i:1:p:317-331:10.1007/s10479-012-1154-x
    DOI: 10.1007/s10479-012-1154-x
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s10479-012-1154-x
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s10479-012-1154-x?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. Willem Klein Haneveld & Maarten van der Vlerk, 1999. "Stochastic integer programming:General models and algorithms," Annals of Operations Research, Springer, vol. 85(0), pages 39-57, January.
    2. Maria Albareda-Sambola & Elena Fernández, 2000. "The stochastic generalised assignment problem with Bernoulli demands," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 8(2), pages 165-190, December.
    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. Vassiliki Kazana & Angelos Kazaklis & Dimitrios Raptis & Christos Stamatiou, 2020. "A combined multi-criteria approach to assess forest management sustainability: an application to the forests of Eastern Macedonia & Thrace Region in Greece," Annals of Operations Research, Springer, vol. 294(1), pages 321-343, November.

    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. Lars M. Hvattum & Arne Løkketangen & Gilbert Laporte, 2006. "Solving a Dynamic and Stochastic Vehicle Routing Problem with a Sample Scenario Hedging Heuristic," Transportation Science, INFORMS, vol. 40(4), pages 421-438, November.
    2. repec:dgr:rugsom:00a52 is not listed on IDEAS
    3. repec:dgr:rugsom:02a21 is not listed on IDEAS
    4. Hannes Schwarz & Valentin Bertsch & Wolf Fichtner, 2018. "Two-stage stochastic, large-scale optimization of a decentralized energy system: a case study focusing on solar PV, heat pumps and storage in a residential quarter," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 40(1), pages 265-310, January.
    5. Klein Haneveld, W.K. & Vlerk, M.H. van der, 2000. "Optimizing electricity distribution using two-stage integer recourse models," Research Report 00A26, University of Groningen, Research Institute SOM (Systems, Organisations and Management).
    6. Albareda-Sambola, Maria & Fernandez, Elena & Laporte, Gilbert, 2007. "Heuristic and lower bound for a stochastic location-routing problem," European Journal of Operational Research, Elsevier, vol. 179(3), pages 940-955, June.
    7. Bjorn P. Berg & Brian T. Denton, 2017. "Fast Approximation Methods for Online Scheduling of Outpatient Procedure Centers," INFORMS Journal on Computing, INFORMS, vol. 29(4), pages 631-644, November.
    8. Anupam Gupta & R. Ravi & Amitabh Sinha, 2007. "LP Rounding Approximation Algorithms for Stochastic Network Design," Mathematics of Operations Research, INFORMS, vol. 32(2), pages 345-364, May.
    9. Lewis Ntaimo, 2010. "Disjunctive Decomposition for Two-Stage Stochastic Mixed-Binary Programs with Random Recourse," Operations Research, INFORMS, vol. 58(1), pages 229-243, February.
    10. Klein Haneveld, W.K.. & Streutker, M.H. & Vlerk, M.H. van der, 2005. "An ALM Model for Pension Funds using Integrated Chance Constraints," Research Report 05A03, University of Groningen, Research Institute SOM (Systems, Organisations and Management).
    11. Ward Romeijnders & David P. Morton & Maarten H. van der Vlerk, 2017. "Assessing the Quality of Convex Approximations for Two-Stage Totally Unimodular Integer Recourse Models," INFORMS Journal on Computing, INFORMS, vol. 29(2), pages 211-231, May.
    12. repec:dgr:rugsom:03a14 is not listed on IDEAS
    13. repec:dgr:rugsom:03a21 is not listed on IDEAS
    14. Aakil M. Caunhye & Xiaofeng Nie, 2018. "A Stochastic Programming Model for Casualty Response Planning During Catastrophic Health Events," Transportation Science, INFORMS, vol. 52(2), pages 437-453, March.
    15. repec:dgr:rugsom:04a28 is not listed on IDEAS
    16. Escudero Bueno, Laureano F. & Garín Martín, María Araceli & Merino Maestre, María & Pérez Sainz de Rozas, Gloria, 2011. "A parallelizable algorithmic framework for solving large scale multi-stage stochastic mixed 0-1 problems under uncertainty," BILTOKI 1134-8984, Universidad del País Vasco - Departamento de Economía Aplicada III (Econometría y Estadística).
    17. Subhash C. Sarin & Hanif D. Sherali & Seon Ki Kim, 2014. "A branch‐and‐price approach for the stochastic generalized assignment problem," Naval Research Logistics (NRL), John Wiley & Sons, vol. 61(2), pages 131-143, March.
    18. Castro, Jordi, 2009. "A stochastic programming approach to cash management in banking," European Journal of Operational Research, Elsevier, vol. 192(3), pages 963-974, February.
    19. Nesbitt, Peter & Blake, Lewis R. & Lamas, Patricio & Goycoolea, Marcos & Pagnoncelli, Bernardo K. & Newman, Alexandra & Brickey, Andrea, 2021. "Underground mine scheduling under uncertainty," European Journal of Operational Research, Elsevier, vol. 294(1), pages 340-352.
    20. Drijver, Sibrand J. & Klein Haneveld, Willem K. & Vlerk, Maarten H. van der, 2002. "ALM model for pension funds : numerical results for a prototype model," Research Report 02A44, University of Groningen, Research Institute SOM (Systems, Organisations and Management).
    21. repec:dgr:rugsom:02a44 is not listed on IDEAS
    22. repec:dgr:rugsom:00a26 is not listed on IDEAS
    23. repec:dgr:rugsom:05a03 is not listed on IDEAS
    24. Francesca Maggioni & Elisabetta Allevi & Marida Bertocchi, 2016. "Monotonic bounds in multistage mixed-integer stochastic programming," Computational Management Science, Springer, vol. 13(3), pages 423-457, July.
    25. Côté, Jean-François & Alves de Queiroz, Thiago & Gallesi, Francesco & Iori, Manuel, 2023. "A branch-and-regret algorithm for the same-day delivery problem," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 177(C).
    26. Steven Thompson & Manuel Nunez & Robert Garfinkel & Matthew D. Dean, 2009. "OR Practice---Efficient Short-Term Allocation and Reallocation of Patients to Floors of a Hospital During Demand Surges," Operations Research, INFORMS, vol. 57(2), pages 261-273, April.
    27. W. A. Rijpkema & E. M. T. Hendrix & R. Rossi & J. G. A. J. Vorst, 2016. "Application of stochastic programming to reduce uncertainty in quality-based supply planning of slaughterhouses," Annals of Operations Research, Springer, vol. 239(2), pages 613-624, April.
    28. Vlerk, Maarten H. van der, 2003. "Simplification of recourse models by modification of recourse data," Research Report 03A01, University of Groningen, Research Institute SOM (Systems, Organisations and Management).

    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:spr:annopr:v:219:y:2014:i:1:p:317-331:10.1007/s10479-012-1154-x. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.