IDEAS home Printed from https://ideas.repec.org/a/eee/forpol/v191y2026ics1389934126002091.html

A hybrid simulated annealing and tabu search metaheuristic for the spatial forest harvest scheduling problem

Author

Listed:
  • Gonçalves, Juliana Casellas
  • Scarpin, Cassius Tadeu
  • Arce, Julio Eduardo

Abstract

Effective forest management requires decision-making that balances financial, operational and environmental objectives. A key challenge is spatial harvest scheduling, especially under adjacency constraints, commonly modeled using the Unit Restriction Model (URM) or the Area Restriction Model (ARM). These constraints limit simultaneous harvesting of neighboring stands, increasing problem complexity and computational demands. This study proposes a hybrid metaheuristic combining Simulated Annealing (SA) and Tabu Search (TS) to address this problem efficiently. The algorithm integrates SA's explorative search with TS's memory-based intensification, generating high-quality solutions that satisfy both economic and spatial constraints. Computational experiments with URM and ARM scenarios show that, in general, the hybrid approach outperforms individual SA and TS methods across most evaluated scenarios. Although the hybrid approach exhibits slower initial convergence than SA and TS, it achieves higher Net Present Value (NPV), maintains harvest balance and enhances spatial stand configuration. Results indicate that hybrid metaheuristics are a practical tool for tactical forest management, supporting decision-making that reconciles economic, operational, and spatial constraints.

Suggested Citation

  • Gonçalves, Juliana Casellas & Scarpin, Cassius Tadeu & Arce, Julio Eduardo, 2026. "A hybrid simulated annealing and tabu search metaheuristic for the spatial forest harvest scheduling problem," Forest Policy and Economics, Elsevier, vol. 191(C).
  • Handle: RePEc:eee:forpol:v:191:y:2026:i:c:s1389934126002091
    DOI: 10.1016/j.forpol.2026.103903
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S1389934126002091
    Download Restriction: Full text for ScienceDirect subscribers only

    File URL: https://libkey.io/10.1016/j.forpol.2026.103903?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

    for a different version of it.

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    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:191:y:2026:i:c:s1389934126002091. 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.

    We have no bibliographic references for this item. You can help adding them by using 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.