IDEAS home Printed from https://ideas.repec.org/a/eee/forpol/v75y2017icp49-57.html
   My bibliography  Save this article

Optimal harvest cluster size with increasing opening costs for harvest sites

Author

Listed:
  • Borges, Paulo
  • Kangas, Annika
  • Bergseng, Even

Abstract

In strategic level planning, the harvest levels are often obtained by maximizing NPV of the forest area. The resulting harvests within each planning period are then typically scattered over the area. In practical forestry, clustering harvests is seen as important, but tools for planning harvest clustering applicable for practical level planning are largely missing. In previous studies, clustering harvests has been seen as an objective in itself rather than means to save costs. It has thus not been possible to define an optimal level for clustering in order to maximize the NPV. In this study, clustering is carried out by minimizing the total opening costs (TOCs) for harvest sites. TOC is defined as a fixed cost for one contiguous harvest cluster. It consists of e.g. transferring the machines to the harvest site, waiting time for the machinery and workers due to the transfer, delineation of the harvest site and administrative work required for each harvest site. Our results show that with small opening cost, it is optimal to follow the strategic level plan, while as the opening cost increases it is optimal to make larger and larger harvest clusters. The clustering also affects the treatments carried out: with high opening costs the harvests in some stands will be postponed for 10years or more, or the treatment may change from the strategic level optimum.

Suggested Citation

  • Borges, Paulo & Kangas, Annika & Bergseng, Even, 2017. "Optimal harvest cluster size with increasing opening costs for harvest sites," Forest Policy and Economics, Elsevier, vol. 75(C), pages 49-57.
    • Handle: RePEc:eee:forpol:v:75:y:2017:i:c:p:49-57
    DOI: 10.1016/j.forpol.2016.11.012
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S1389934116304312
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.forpol.2016.11.012?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. Gianni Codato & Matteo Fischetti, 2006. "Combinatorial Benders' Cuts for Mixed-Integer Linear Programming," Operations Research, INFORMS, vol. 54(4), pages 756-766, August.
    2. Hoen, Hans Fredrik & Eid, Tron & Okseter, Petter, 2006. "Efficiency gains of cooperation between properties under varying target levels of old forest area coverage," Forest Policy and Economics, Elsevier, vol. 8(2), pages 135-148, March.
    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. Augustynczik, Andrey Lessa Derci & Yousefpour, Rasoul & Rodriguez, Luiz Carlos Estraviz & Hanewinkel, Marc, 2018. "Conservation Costs of Retention Forestry and Optimal Habitat Network Selection in Southwestern Germany," Ecological Economics, Elsevier, vol. 148(C), pages 92-102.

    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. Elisangela Martins de Sá & Ivan Contreras & Jean-François Cordeau & Ricardo Saraiva de Camargo & Gilberto de Miranda, 2015. "The Hub Line Location Problem," Transportation Science, INFORMS, vol. 49(3), pages 500-518, August.
    2. Yossiri Adulyasak & Jean-François Cordeau & Raf Jans, 2015. "Benders Decomposition for Production Routing Under Demand Uncertainty," Operations Research, INFORMS, vol. 63(4), pages 851-867, August.
    3. Jérémy Omer & Michael Poss, 2021. "Identifying relatively irreducible infeasible subsystems of linear inequalities," Annals of Operations Research, Springer, vol. 304(1), pages 361-379, September.
    4. Maher, Stephen J., 2021. "Implementing the branch-and-cut approach for a general purpose Benders’ decomposition framework," European Journal of Operational Research, Elsevier, vol. 290(2), pages 479-498.
    5. William B. Haskell & Wenjie Huang & Huifu Xu, 2018. "Preference Elicitation and Robust Optimization with Multi-Attribute Quasi-Concave Choice Functions," Papers 1805.06632, arXiv.org.
    6. Clavijo López, Christian & Crama, Yves & Pironet, Thierry & Semet, Frédéric, 2024. "Multi-period distribution networks with purchase commitment contracts," European Journal of Operational Research, Elsevier, vol. 312(2), pages 556-572.
    7. David Bergman & Carlos H. Cardonha & Andre A. Cire & Arvind U. Raghunathan, 2019. "On the Minimum Chordal Completion Polytope," Operations Research, INFORMS, vol. 67(2), pages 532-547, March.
    8. Dell’Amico, Mauro & Delorme, Maxence & Iori, Manuel & Martello, Silvano, 2019. "Mathematical models and decomposition methods for the multiple knapsack problem," European Journal of Operational Research, Elsevier, vol. 274(3), pages 886-899.
    9. Belieres, Simon & Hewitt, Mike & Jozefowiez, Nicolas & Semet, Frédéric & Van Woensel, Tom, 2020. "A Benders decomposition-based approach for logistics service network design," European Journal of Operational Research, Elsevier, vol. 286(2), pages 523-537.
    10. Mancini, Simona & Ciavotta, Michele & Meloni, Carlo, 2021. "The Multiple Multidimensional Knapsack with Family-Split Penalties," European Journal of Operational Research, Elsevier, vol. 289(3), pages 987-998.
    11. Dursun, Pınar & Taşkın, Z. Caner & Altınel, İ. Kuban, 2019. "The determination of optimal treatment plans for Volumetric Modulated Arc Therapy (VMAT)," European Journal of Operational Research, Elsevier, vol. 272(1), pages 372-388.
    12. Schulz, Arne & Pfeiffer, Christian, 2024. "Using fixed paths to improve branch-and-cut algorithms for precedence-constrained routing problems," European Journal of Operational Research, Elsevier, vol. 312(2), pages 456-472.
    13. Rahmaniani, Ragheb & Crainic, Teodor Gabriel & Gendreau, Michel & Rei, Walter, 2017. "The Benders decomposition algorithm: A literature review," European Journal of Operational Research, Elsevier, vol. 259(3), pages 801-817.
    14. Michels, Adalberto Sato & Lopes, Thiago Cantos & Magatão, Leandro, 2020. "An exact method with decomposition techniques and combinatorial Benders’ cuts for the type-2 multi-manned assembly line balancing problem," Operations Research Perspectives, Elsevier, vol. 7(C).
    15. Moira MacNeil & Merve Bodur, 2022. "Integer Programming, Constraint Programming, and Hybrid Decomposition Approaches to Discretizable Distance Geometry Problems," INFORMS Journal on Computing, INFORMS, vol. 34(1), pages 297-314, January.
    16. Matteo Fischetti & Domenico Salvagnin, 2010. "Pruning Moves," INFORMS Journal on Computing, INFORMS, vol. 22(1), pages 108-119, February.
    17. Rodríguez, Jesús A. & Anjos, Miguel F. & Côté, Pascal & Desaulniers, Guy, 2021. "Accelerating Benders decomposition for short-term hydropower maintenance scheduling," European Journal of Operational Research, Elsevier, vol. 289(1), pages 240-253.
    18. Wakui, Tetsuya & Hashiguchi, Moe & Yokoyama, Ryohei, 2021. "Structural design of distributed energy networks by a hierarchical combination of variable- and constraint-based decomposition methods," Energy, Elsevier, vol. 224(C).
    19. Kıbış, Eyyüb Y. & Büyüktahtakın, İ. Esra, 2017. "Optimizing invasive species management: A mixed-integer linear programming approach," European Journal of Operational Research, Elsevier, vol. 259(1), pages 308-321.
    20. Guo, Penghui & Zhu, Jianjun, 2023. "Capacity reservation for humanitarian relief: A logic-based Benders decomposition method with subgradient cut," European Journal of Operational Research, Elsevier, vol. 311(3), pages 942-970.

    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:forpol:v:75:y:2017:i:c:p:49-57. 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/forpol .

    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.