IDEAS home Printed from https://ideas.repec.org/a/eee/foreco/v24y2016icp72-81.html
   My bibliography  Save this article

Aggregating forest harvesting activities in forest plantations through Integer Linear Programming and Goal Programming

Author

Listed:
  • Augustynczik, A.L.D.
  • Arce, J.E.
  • Silva, A.C.L.

Abstract

The inclusion of criteria related to the spatial patterns resulting from forest harvesting activities is an important component of forest planning. Harvesting operations are more efficient when the harvesting areas are clustered. Therewith, it is possible to reduce the displacement of machinery and costs related to construction and maintenance of the road network. In this context, the objective of this study was to evaluate different strategies for aggregating harvesting stands in a forest plantation. We applied two Goal Programming approaches aiming at aggregating harvesting stands and an Integer Linear Programming model for including road investments into strategic forest planning.

Suggested Citation

  • 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.
    • Handle: RePEc:eee:foreco:v:24:y:2016:i:c:p:72-81
    DOI: 10.1016/j.jfe.2016.06.002
    as

    Download full text from publisher

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

    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. 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.
    2. 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.
    3. 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.
    4. Á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.
    5. 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.
    6. 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.
    7. Ran Wei & Alan Murray, 2015. "Spatial uncertainty in harvest scheduling," Annals of Operations Research, Springer, vol. 232(1), pages 275-289, September.
    8. 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.
    9. 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.
    10. Andres Weintraub P., 2007. "Integer programming in forestry," Annals of Operations Research, Springer, vol. 149(1), pages 209-216, February.
    11. Baghersad, Milad & Emadikhiav, Mohsen & Huang, C. Derrick & Behara, Ravi S., 2023. "Modularity maximization to design contiguous policy zones for pandemic response," European Journal of Operational Research, Elsevier, vol. 304(1), pages 99-112.
    12. Á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.
    13. 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.
    14. 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.
    15. 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.
    16. 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.
    17. 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.
    18. Maher, Stephen J. & Murray, John M., 2016. "The unrooted set covering connected subgraph problem differentiating between HIV envelope sequences," European Journal of Operational Research, Elsevier, vol. 248(2), pages 668-680.
    19. Giménez, J.C. & Diaz-Balteiro, L. & Bertomeu, M., 2019. "The effective hydrological neighborhood: A new concept to formulate harvest area constraints," Ecological Modelling, Elsevier, vol. 404(C), pages 83-90.
    20. 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).

    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:foreco:v:24:y:2016:i:c:p:72-81. 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/wps/find/journaldescription.cws_home/701775/description#description .

    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.