IDEAS home Printed from https://ideas.repec.org/a/spr/snopef/v2y2021i2d10.1007_s43069-021-00069-w.html
   My bibliography  Save this article

Long-term Plantation and Harvesting Planning for Industrial Plantation Forest Areas

Author

Listed:
  • Oğuzhan Ahmet Arık

    (Nuh Naci Yazgan University)

Abstract

This paper integrates forest harvesting and plantation operations considering the industry’s long-term demand. Forest harvesting problem has been still one of the open problems in operational research, and the problem is interesting because forests are nonrenewable natural resources in short term. Each harvested tree must be replanted within a plantation plan in order to protect the ecosystem and future generation’s needs for forestry goods. A dynamic mixed integer programming approach is proposed for the problem. Furthermore, three hypothetical examples of different sizes are presented for the problem.

Suggested Citation

  • 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.
    • Handle: RePEc:spr:snopef:v:2:y:2021:i:2:d:10.1007_s43069-021-00069-w
    DOI: 10.1007/s43069-021-00069-w
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s43069-021-00069-w
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s43069-021-00069-w?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. 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.
    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. 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.
    4. Hernandez, M. & Gómez, T. & Molina, J. & León, M.A. & Caballero, R., 2014. "Efficiency in forest management: A multiobjective harvest scheduling model," Journal of Forest Economics, Elsevier, vol. 20(3), pages 236-251.
    5. 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.
    6. Zhai, Wenyuan & Zhao, Yingzi & Lian, Xiangru & Yang, Mingming & Lu, Fadian, 2014. "Management planning of fast-growing plantations based on a bi-level programming model," Forest Policy and Economics, Elsevier, vol. 38(C), pages 173-177.
    7. 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.
    8. 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.
    9. 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.
    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. 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.
    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. 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).
    4. Ran Wei & Alan Murray, 2015. "Spatial uncertainty in harvest scheduling," Annals of Operations Research, Springer, vol. 232(1), pages 275-289, September.
    5. 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.
    6. 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.
    7. 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.
    8. Augustynczik, Andrey Lessa Derci & Arce, Julio Eduardo & Yousefpour, Rasoul & da Silva, Arinei Carlos Lindbeck, 2016. "Promoting harvesting stands connectivity and its economic implications in Brazilian forest plantations applying integer linear programming and simulated annealing," Forest Policy and Economics, Elsevier, vol. 73(C), pages 120-129.
    9. Belavenutti, Pedro & Ager, Alan A. & Day, Michelle A. & Chung, Woodam, 2022. "Designing forest restoration projects to optimize the application of broadcast burning," Ecological Economics, Elsevier, vol. 201(C).
    10. Neto, Teresa & Constantino, Miguel & Martins, Isabel & Pedroso, João Pedro, 2020. "A multi-objective Monte Carlo tree search for forest harvest scheduling," European Journal of Operational Research, Elsevier, vol. 282(3), pages 1115-1126.
    11. 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.
    12. 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.
    13. 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.
    14. Sushil Gupta & Hossein Rikhtehgar Berenji & Manish Shukla & Nagesh N. Murthy, 2023. "Opportunities in farming research from an operations management perspective," Production and Operations Management, Production and Operations Management Society, vol. 32(6), pages 1577-1596, June.
    15. 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.
    16. 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.
    17. 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.
    18. Á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.
    19. 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.
    20. Roland Oliver Hales & Sergio García, 2019. "Congress seat allocation using mathematical optimization," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 27(3), pages 426-455, October.

    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:snopef:v:2:y:2021:i:2:d:10.1007_s43069-021-00069-w. 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.