IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v190y2011i1p75-9210.1007-s10479-009-0525-4.html
   My bibliography  Save this article

A multiobjective model for forest planning with adjacency constraints

Author

Listed:
  • T. Gómez
  • M. Hernández
  • J. Molina
  • M. León
  • E. Aldana
  • R. Caballero

Abstract

This work presents a nonlinear goal programming model with binary variables used to plan the management of a tree plantation, taking economic and environmental objectives into account. The aims are to stay within the limits of a given harvesting volume, limit the age of basic units targeted for clearcutting, obtain a forest with a balanced age distribution, and surpass the minimum net present value set at each planning period. This has to be achieved bearing in mind technical restrictions regarding treatments, and spatial adjacency constraints that limit the maximum adjacent surface area to which clearcutting can be applied. The outcome is a highly complex problem that is solved by applying a metaheuristic method based on Scatter Search. The proposed model has been validated by applying it to a Cuban plantation located in the region of Pinar del Río. Copyright Springer Science+Business Media, LLC 2011

Suggested Citation

  • 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.
    • Handle: RePEc:spr:annopr:v:190:y:2011:i:1:p:75-92:10.1007/s10479-009-0525-4
    DOI: 10.1007/s10479-009-0525-4
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s10479-009-0525-4
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s10479-009-0525-4?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. Julian Molina & Manuel Laguna & Rafael Martí & Rafael Caballero, 2007. "SSPMO: A Scatter Tabu Search Procedure for Non-Linear Multiobjective Optimization," INFORMS Journal on Computing, INFORMS, vol. 19(1), pages 91-100, February.
    2. Luis Diaz-Balteiro & Carlos Romero, 2007. "Multiple Criteria Decision-Making in Forest Planning: Recent Results and Current Challenges," International Series in Operations Research & Management Science, in: Andres Weintraub & Carlos Romero & Trond Bjørndal & Rafael Epstein & Jaime Miranda (ed.), Handbook Of Operations Research In Natural Resources, chapter 0, pages 473-488, Springer.
    3. 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.
    4. Caballero, Rafael & Rey, Lourdes & Ruiz, Francisco, 1998. "Lexicographic improvement of the target values in convex goal programming," European Journal of Operational Research, Elsevier, vol. 107(3), pages 644-655, June.
    5. Matthias Ehrgott & Xavier Gandibleux, 2004. "Approximative solution methods for multiobjective combinatorial optimization," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 12(1), pages 1-63, June.
    6. Jones, D. F. & Mirrazavi, S. K. & Tamiz, M., 2002. "Multi-objective meta-heuristics: An overview of the current state-of-the-art," European Journal of Operational Research, Elsevier, vol. 137(1), pages 1-9, February.
    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. 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.
    2. Amelia Bilbao-Terol & Mariano Jiménez & Mar Arenas-Parra, 2016. "A group decision making model based on goal programming with fuzzy hierarchy: an application to regional forest planning," Annals of Operations Research, Springer, vol. 245(1), pages 137-162, October.
    3. 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.
    4. Vassiliki Kazana & Angelos Kazaklis & Dimitrios Raptis & Christos Stamatiou, 2020. "A combined multi-criteria approach to assess forest management sustainability: an application to the forests of Eastern Macedonia & Thrace Region in Greece," Annals of Operations Research, Springer, vol. 294(1), pages 321-343, November.
    5. Helenice de Oliveira Florentino & Chandra Irawan & Angelo Filho Aliano & Dylan F. Jones & Daniela Renata Cantane & Jonis Jecks Nervis, 2018. "A multiple objective methodology for sugarcane harvest management with varying maturation periods," Annals of Operations Research, Springer, vol. 267(1), pages 153-177, August.

    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. 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.
    2. Schweiger, Katharina & Sahamie, Ramin, 2013. "A hybrid Tabu Search approach for the design of a paper recycling network," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 50(C), pages 98-119.
    3. 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.
    4. Ran Wei & Alan Murray, 2015. "Spatial uncertainty in harvest scheduling," Annals of Operations Research, Springer, vol. 232(1), pages 275-289, September.
    5. Surafel Luleseged Tilahun & Mohamed A. Tawhid, 2019. "Swarm hyperheuristic framework," Journal of Heuristics, Springer, vol. 25(4), pages 809-836, October.
    6. 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.
    7. Tobias Kuhn & Stefan Ruzika, 2017. "A coverage-based Box-Algorithm to compute a representation for optimization problems with three objective functions," Journal of Global Optimization, Springer, vol. 67(3), pages 581-600, March.
    8. Delorme, Xavier & Gandibleux, Xavier & Degoutin, Fabien, 2010. "Evolutionary, constructive and hybrid procedures for the bi-objective set packing problem," European Journal of Operational Research, Elsevier, vol. 204(2), pages 206-217, July.
    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. Joaquín Pacheco & Rafael Caballero & Manuel Laguna & Julián Molina, 2013. "Bi-Objective Bus Routing: An Application to School Buses in Rural Areas," Transportation Science, INFORMS, vol. 47(3), pages 397-411, August.
    11. Herbert Dawid & Reinhold Decker & Thomas Hermann & Hermann Jahnke & Wilhelm Klat & Rolf König & Christian Stummer, 2017. "Management science in the era of smart consumer products: challenges and research perspectives," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 25(1), pages 203-230, March.
    12. Frota Neto, J. Quariguasi & Bloemhof-Ruwaard, J.M. & van Nunen, J.A.E.E. & van Heck, E., 2008. "Designing and evaluating sustainable logistics networks," International Journal of Production Economics, Elsevier, vol. 111(2), pages 195-208, February.
    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. Hanne, Thomas, 2007. "A multiobjective evolutionary algorithm for approximating the efficient set," European Journal of Operational Research, Elsevier, vol. 176(3), pages 1723-1734, February.
    15. Juan Villegas & Fernando Palacios & Andrés Medaglia, 2006. "Solution methods for the bi-objective (cost-coverage) unconstrained facility location problem with an illustrative example," Annals of Operations Research, Springer, vol. 147(1), pages 109-141, October.
    16. Selçuklu, Saltuk Buğra & Coit, David W. & Felder, Frank A., 2020. "Pareto uncertainty index for evaluating and comparing solutions for stochastic multiple objective problems," European Journal of Operational Research, Elsevier, vol. 284(2), pages 644-659.
    17. Francis Sourd & Olivier Spanjaard, 2008. "A Multiobjective Branch-and-Bound Framework: Application to the Biobjective Spanning Tree Problem," INFORMS Journal on Computing, INFORMS, vol. 20(3), pages 472-484, August.
    18. Dubois-Lacoste, Jérémie & López-Ibáñez, Manuel & Stützle, Thomas, 2015. "Anytime Pareto local search," European Journal of Operational Research, Elsevier, vol. 243(2), pages 369-385.
    19. Xiaofeng Lv & Deyun Zhou & Yongchuan Tang & Ling Ma, 2018. "An Improved Test Selection Optimization Model Based on Fault Ambiguity Group Isolation and Chaotic Discrete PSO," Complexity, Hindawi, vol. 2018, pages 1-10, January.
    20. N. A. Arellano-Arriaga & J. Molina & S. E. Schaeffer & A. M. Álvarez-Socarrás & I. A. Martínez-Salazar, 2019. "A bi-objective study of the minimum latency problem," Journal of Heuristics, Springer, vol. 25(3), pages 431-454, June.

    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:annopr:v:190:y:2011:i:1:p:75-92:10.1007/s10479-009-0525-4. 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.