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

Application of relax-and-fix heuristic in the aggregation of stands for tactical forest scheduling

Author

Listed:
  • Correa, Renata Naoko
  • Scarpin, Cassius Tadeu
  • Ferrari, Linamara Smaniotto
  • Arce, Julio Eduardo

Abstract

Tactical harvest scheduling is related to forest unit selection and spatial sequencing. Mixed Integer Linear Programming (MILP) is traditionally implemented in this type of planning, associating each forest unit with one or more binary and/or integer variables. However, the higher number of binary/integer variables used in a model, the higher complexity and processing time to find an optimal solution. Given the need for improvements in computational performance, heuristic methods may present computational advantages to determine a feasible solution. In this context, the objective of this study was to solve a harvesting plan that aggregates adjacent stands to create blocks through the application of MILP and three different strategies of the Relax-and-Fix (R&F) heuristic. For that purpose, we used a hypothetical 1153-ha forest, subdivided into 100 stands of Pinus taeda L., as a database. The application of R&F, in general, proved to be efficient, especially when the R&F Backward solution was applied as an initial solution of the exact model. This scenario produced the best result of the study: a 28% decrease in computational time and the same spatial sequencing of stands as the MILP model.

Suggested Citation

  • 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).
    • Handle: RePEc:eee:forpol:v:119:y:2020:i:c:s1389934120302136
    DOI: 10.1016/j.forpol.2020.102284
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S1389934120302136
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.forpol.2020.102284?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. 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.
    2. 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.
    3. Fotakis, Dimitris G. & Sidiropoulos, Epameinondas & Myronidis, Dimitriοs & Ioannou, Kostas, 2012. "Spatial genetic algorithm for multi-objective forest planning," Forest Policy and Economics, Elsevier, vol. 21(C), pages 12-19.
    4. 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.
    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. Ran Wei & Alan Murray, 2015. "Spatial uncertainty in harvest scheduling," Annals of Operations Research, Springer, vol. 232(1), pages 275-289, September.
    7. Mathey, Anne-Hélène & Krcmar, Emina & Dragicevic, Suzana & Vertinsky, Ilan, 2008. "An object-oriented cellular automata model for forest planning problems," Ecological Modelling, Elsevier, vol. 212(3), pages 359-371.
    8. Mikael Rönnqvist & Sophie D’Amours & Andres Weintraub & Alejandro Jofre & Eldon Gunn & Robert Haight & David Martell & Alan Murray & Carlos Romero, 2015. "Operations Research challenges in forestry: 33 open problems," Annals of Operations Research, Springer, vol. 232(1), pages 11-40, September.
    9. Wei, Mingyuan & Qi, Mingyao & Wu, Tao & Zhang, Canrong, 2019. "Distance and matching-induced search algorithm for the multi-level lot-sizing problem with substitutable bill of materials," European Journal of Operational Research, Elsevier, vol. 277(2), pages 521-541.
    10. Stadtler, Hartmut, 2003. "Multilevel lot sizing with setup times and multiple constrained resources: Internally rolling schedules with lot-sizing windows," Publications of Darmstadt Technical University, Institute for Business Studies (BWL) 20204, Darmstadt Technical University, Department of Business Administration, Economics and Law, Institute for Business Studies (BWL).
    11. Helber, Stefan & Sahling, Florian, 2010. "A fix-and-optimize approach for the multi-level capacitated lot sizing problem," International Journal of Production Economics, Elsevier, vol. 123(2), pages 247-256, February.
    12. Hartmut Stadtler, 2003. "Multilevel Lot Sizing with Setup Times and Multiple Constrained Resources: Internally Rolling Schedules with Lot-Sizing Windows," Operations Research, INFORMS, vol. 51(3), pages 487-502, June.
    13. AkartunalI, Kerem & Miller, Andrew J., 2009. "A heuristic approach for big bucket multi-level production planning problems," European Journal of Operational Research, Elsevier, vol. 193(2), pages 396-411, March.
    14. Dems, A. & Rousseau, L.M. & Frayret, J.M., 2017. "Annual timber procurement planning with bucking decisions," European Journal of Operational Research, Elsevier, vol. 259(2), pages 713-720.
    15. Laureano Escudero & Javier Salmeron, 2005. "On a Fix-and-Relax Framework for a Class of Project Scheduling Problems," Annals of Operations Research, Springer, vol. 140(1), pages 163-188, November.
    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. Wei, Mingyuan & Qi, Mingyao & Wu, Tao & Zhang, Canrong, 2019. "Distance and matching-induced search algorithm for the multi-level lot-sizing problem with substitutable bill of materials," European Journal of Operational Research, Elsevier, vol. 277(2), pages 521-541.
    2. Sereshti, Narges & Adulyasak, Yossiri & Jans, Raf, 2024. "Managing flexibility in stochastic multi-level lot sizing problem with service level constraints," Omega, Elsevier, vol. 122(C).
    3. 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.
    4. Marcos Mansano Furlan & Maristela Oliveira Santos, 2017. "BFO: a hybrid bees algorithm for the multi-level capacitated lot-sizing problem," Journal of Intelligent Manufacturing, Springer, vol. 28(4), pages 929-944, April.
    5. Ahmed Senoussi & Youcef Boutarfa & Nadjib Brahimi & Tarik Aouam, 2024. "Sustainable Hybrid Manufacturing and Refurbishing Systems with Substitution," Sustainability, MDPI, vol. 16(17), pages 1-33, August.
    6. Lang, Jan Christian & Shen, Zuo-Jun Max, 2011. "Fix-and-optimize heuristics for capacitated lot-sizing with sequence-dependent setups and substitutions," European Journal of Operational Research, Elsevier, vol. 214(3), pages 595-605, November.
    7. Gislaine Mara Melega & Silvio Alexandre de Araujo & Reinaldo Morabito, 2020. "Mathematical model and solution approaches for integrated lot-sizing, scheduling and cutting stock problems," Annals of Operations Research, Springer, vol. 295(2), pages 695-736, December.
    8. Absi, Nabil & van den Heuvel, Wilco, 2019. "Worst case analysis of Relax and Fix heuristics for lot-sizing problems," European Journal of Operational Research, Elsevier, vol. 279(2), pages 449-458.
    9. Tao Wu & Leyuan Shi & Joseph Geunes & Kerem Akartunalı, 2012. "On the equivalence of strong formulations for capacitated multi-level lot sizing problems with setup times," Journal of Global Optimization, Springer, vol. 53(4), pages 615-639, August.
    10. Almeder, Christian, 2010. "A hybrid optimization approach for multi-level capacitated lot-sizing problems," European Journal of Operational Research, Elsevier, vol. 200(2), pages 599-606, January.
    11. Guido, Rosita & Groccia, Maria Carmela & Conforti, Domenico, 2018. "An efficient matheuristic for offline patient-to-bed assignment problems," European Journal of Operational Research, Elsevier, vol. 268(2), pages 486-503.
    12. Kerem Akartunalı & Ioannis Fragkos & Andrew J. Miller & Tao Wu, 2016. "Local Cuts and Two-Period Convex Hull Closures for Big-Bucket Lot-Sizing Problems," INFORMS Journal on Computing, INFORMS, vol. 28(4), pages 766-780, November.
    13. Tao Wu & Kerem Akartunal? & Raf Jans & Zhe Liang, 2017. "Progressive Selection Method for the Coupled Lot-Sizing and Cutting-Stock Problem," INFORMS Journal on Computing, INFORMS, vol. 29(3), pages 523-543, August.
    14. Stadtler, Hartmut, 2011. "Multi-level single machine lot-sizing and scheduling with zero lead times," European Journal of Operational Research, Elsevier, vol. 209(3), pages 241-252, March.
    15. Wu, Tao & Shi, Leyuan & Geunes, Joseph & AkartunalI, Kerem, 2011. "An optimization framework for solving capacitated multi-level lot-sizing problems with backlogging," European Journal of Operational Research, Elsevier, vol. 214(2), pages 428-441, October.
    16. Silvio Alexandre de Araujo & Bert De Reyck & Zeger Degraeve & Ioannis Fragkos & Raf Jans, 2015. "Period Decompositions for the Capacitated Lot Sizing Problem with Setup Times," INFORMS Journal on Computing, INFORMS, vol. 27(3), pages 431-448, August.
    17. Chen, Haoxun, 2015. "Fix-and-optimize and variable neighborhood search approaches for multi-level capacitated lot sizing problems," Omega, Elsevier, vol. 56(C), pages 25-36.
    18. Tao Wu & Leyuan Shi & Jie Song, 2012. "An MIP-based interval heuristic for the capacitated multi-level lot-sizing problem with setup times," Annals of Operations Research, Springer, vol. 196(1), pages 635-650, July.
    19. Sahling, Florian & Buschkühl, Lisbeth & Tempelmeier, Horst & Helber, Stefan, 2008. "Solving a Multi-Level Capacitated Lot Sizing Problem with Multi-Period Setup Carry-Over via a Fix-and-Optimize Heuristic," Hannover Economic Papers (HEP) dp-400, Leibniz Universität Hannover, Wirtschaftswissenschaftliche Fakultät.
    20. Markus Mickein & Matthes Koch & Knut Haase, 2022. "A Decision Support System for Brewery Production Planning at Feldschlösschen," Interfaces, INFORMS, vol. 52(2), pages 158-172, March.

    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:119:y:2020:i:c:s1389934120302136. 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.