IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v232y2015i1p275-28910.1007-s10479-012-1178-2.html
   My bibliography  Save this article

Spatial uncertainty in harvest scheduling

Author

Listed:
  • Ran Wei
  • Alan Murray

Abstract

Forest harvest scheduling is a complicated management exercise because of the diverse and competing uses of forest resources, such as economic productivity, recreation and flora and fauna sustainability. In an effort to ensure the long-term viability of forest resources, restrictions are typically placed on the size of harvest areas, green-up intervals and proximity between disturbed areas in the United States. In order to satisfy consumer demands and maintain spatial and temporal restrictions, forest planners rely widely on optimization models to develop harvest schedules. A problematic element of work to date, however, is that spatial information relied upon in such analysis is typically uncertain in many ways, particularly spatial location and harvest unit boundaries. This paper develops new optimization models that explicitly account for spatial uncertainty in harvest scheduling. Application results demonstrate the effectiveness of this new perspective, enabling potential spatial uncertainty impacts to be better understood in management planning. Copyright Springer Science+Business Media, LLC 2015

Suggested Citation

  • Ran Wei & Alan Murray, 2015. "Spatial uncertainty in harvest scheduling," Annals of Operations Research, Springer, vol. 232(1), pages 275-289, September.
    • Handle: RePEc:spr:annopr:v:232:y:2015:i:1:p:275-289:10.1007/s10479-012-1178-2
    DOI: 10.1007/s10479-012-1178-2
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s10479-012-1178-2
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s10479-012-1178-2?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. Tammy Drezner & Zvi Drezner, 1997. "Replacing continuous demand with discrete demand in a competitive location model," Naval Research Logistics (NRL), John Wiley & Sons, vol. 44(1), pages 81-95, February.
    2. Miguel Constantino & Isabel Martins & José G. Borges, 2008. "A New Mixed-Integer Programming Model for Harvest Scheduling Subject to Maximum Area Restrictions," Operations Research, INFORMS, vol. 56(3), pages 542-551, June.
    3. Laurence Reeves & Robert Haight, 2000. "Timber harvest scheduling with price uncertainty using Markowitz portfolio optimization," Annals of Operations Research, Springer, vol. 95(1), pages 229-250, January.
    4. Andrés Weintraub & Jorge Vera, 1991. "A Cutting Plane Approach for Chance Constrained Linear Programs," Operations Research, INFORMS, vol. 39(5), pages 776-785, October.
    5. Nicklas Forsell & Peder Wikström & Frédérick Garcia & Régis Sabbadin & Kristina Blennow & Ljusk Eriksson, 2011. "Management of the risk of wind damage in forestry: a graph-based Markov decision process approach," Annals of Operations Research, Springer, vol. 190(1), pages 57-74, October.
    6. Marcos Goycoolea & Alan T. Murray & Francisco Barahona & Rafael Epstein & Andrés Weintraub, 2005. "Harvest Scheduling Subject to Maximum Area Restrictions: Exploring Exact Approaches," Operations Research, INFORMS, vol. 53(3), pages 490-500, June.
    7. Bohle, Carlos & Maturana, Sergio & Vera, Jorge, 2010. "A robust optimization approach to wine grape harvesting scheduling," European Journal of Operational Research, Elsevier, vol. 200(1), pages 245-252, January.
    8. AltInel, I. Kuban & Durmaz, Engin & Aras, Necati & ÖzkIsacIk, Kerem Can, 2009. "A location-allocation heuristic for the capacitated multi-facility Weber problem with probabilistic customer locations," European Journal of Operational Research, Elsevier, vol. 198(3), pages 790-799, November.
    9. Andres Weintraub & Richard Church & Alan Murray & Monique Guignard, 2000. "Forest management models and combinatorial algorithms: analysis of state of the art," Annals of Operations Research, Springer, vol. 96(1), pages 271-285, November.
    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. Alan T. Murray & Ran Wei & Richard L. Church & Matthew R. Niblett, 2019. "Addressing risks and uncertainty in forest land use modeling," Journal of Geographical Systems, Springer, vol. 21(3), pages 319-338, September.
    2. Correa, Renata Naoko & Scarpin, Cassius Tadeu & Ferrari, Linamara Smaniotto & Arce, Julio Eduardo, 2020. "Application of relax-and-fix heuristic in the aggregation of stands for tactical forest scheduling," Forest Policy and Economics, Elsevier, vol. 119(C).
    3. 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. Fernando Veliz & Jean-Paul Watson & Andres Weintraub & Roger Wets & David Woodruff, 2015. "Stochastic optimization models in forest planning: a progressive hedging solution approach," Annals of Operations Research, Springer, vol. 232(1), pages 259-274, September.
    2. Sinha, Ankur & Rämö, Janne & Malo, Pekka & Kallio, Markku & Tahvonen, Olli, 2017. "Optimal management of naturally regenerating uneven-aged forests," European Journal of Operational Research, Elsevier, vol. 256(3), pages 886-900.
    3. Isabel Martins & Mujing Ye & Miguel Constantino & Maria Conceição Fonseca & Jorge Cadima, 2014. "Modeling target volume flows in forest harvest scheduling subject to maximum area restrictions," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 22(1), pages 343-362, April.
    4. Teresa Neto & Miguel Constantino & Isabel Martins & João Pedro Pedroso, 2017. "Forest harvest scheduling with clearcut and core area constraints," Annals of Operations Research, Springer, vol. 258(2), pages 453-478, November.
    5. Couture, Stéphane & Cros, Marie-Josée & Sabbadin, Régis, 2016. "Risk aversion and optimal management of an uneven-aged forest under risk of windthrow: A Markov decision process approach," Journal of Forest Economics, Elsevier, vol. 25(C), pages 94-114.
    6. Könnyű, Nóra & Tóth, Sándor F., 2013. "A cutting plane method for solving harvest scheduling models with area restrictions," European Journal of Operational Research, Elsevier, vol. 228(1), pages 236-248.
    7. Mafakheri, Fereshteh & Nasiri, Fuzhan, 2014. "Modeling of biomass-to-energy supply chain operations: Applications, challenges and research directions," Energy Policy, Elsevier, vol. 67(C), pages 116-126.
    8. Isabel Martins & Filipe Alvelos & Miguel Constantino, 2012. "A branch-and-price approach for harvest scheduling subject to maximum area restrictions," Computational Optimization and Applications, Springer, vol. 51(1), pages 363-385, January.
    9. Rachel St. John & Sándor Tóth, 2015. "Spatially explicit forest harvest scheduling with difference equations," Annals of Operations Research, Springer, vol. 232(1), pages 235-257, September.
    10. Oğuzhan Ahmet Arık, 2021. "Long-term Plantation and Harvesting Planning for Industrial Plantation Forest Areas," SN Operations Research Forum, Springer, vol. 2(2), pages 1-23, June.
    11. Rodolfo Carvajal & Miguel Constantino & Marcos Goycoolea & Juan Pablo Vielma & Andrés Weintraub, 2013. "Imposing Connectivity Constraints in Forest Planning Models," Operations Research, INFORMS, vol. 61(4), pages 824-836, August.
    12. Miguel A. Lejeune & Janne Kettunen, 2017. "Managing Reliability and Stability Risks in Forest Harvesting," Manufacturing & Service Operations Management, INFORMS, vol. 19(4), pages 620-638, October.
    13. Pamela Alvarez & Jorge Vera, 2014. "Application of Robust Optimization to the Sawmill Planning Problem," Annals of Operations Research, Springer, vol. 219(1), pages 457-475, August.
    14. Constantino, Miguel & Martins, Isabel, 2018. "Branch-and-cut for the forest harvest scheduling subject to clearcut and core area constraints," European Journal of Operational Research, Elsevier, vol. 265(2), pages 723-734.
    15. Álvarez-Miranda, Eduardo & Garcia-Gonzalo, Jordi & Pais, Cristobal & Weintraub, Andrés, 2019. "A multicriteria stochastic optimization framework for sustainable forest decision making under uncertainty," Forest Policy and Economics, Elsevier, vol. 103(C), pages 112-122.
    16. Ramos, Francisco López & Batres, Rafael & De-la-Cruz-Márquez, Cynthia Griselle & Anzures, Melina López, 2023. "Optimization models for nopal crop planning with land usage expansion and government subsidy," Socio-Economic Planning Sciences, Elsevier, vol. 89(C).
    17. T. Gómez & M. Hernández & J. Molina & M. León & E. Aldana & R. Caballero, 2011. "A multiobjective model for forest planning with adjacency constraints," Annals of Operations Research, Springer, vol. 190(1), pages 75-92, October.
    18. Rakotoarison, Hanitra & Loisel, Patrice, 2016. "The Faustmann model under storm risk and price uncertainty: A case study of European beech in Northwestern France," MPRA Paper 85114, University Library of Munich, Germany.
    19. Augustynczik, A.L.D. & Arce, J.E. & Silva, A.C.L., 2016. "Aggregating forest harvesting activities in forest plantations through Integer Linear Programming and Goal Programming," Journal of Forest Economics, Elsevier, vol. 24(C), pages 72-81.
    20. Zare M., Yahia & Daneshmand, Ahmad, 1995. "A linear approximation method for solving a special class of the chance constrained programming problem," European Journal of Operational Research, Elsevier, vol. 80(1), pages 213-225, January.

    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:232:y:2015:i:1:p:275-289:10.1007/s10479-012-1178-2. 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.