Please use this identifier to cite or link to this item: http://repositorio.inesctec.pt/handle/123456789/5614
Title: Forest harvest scheduling with clearcut and core area constraints
Authors: Neto,T
Constantino,M
Martins,I
João Pedro Pedroso
Issue Date: 2017
Abstract: Many studies regarding environmental concerns in forest harvest scheduling problems deal with constraints on the maximum clearcut size. However, these constraints tend to disperse harvests across the forest and thus to generate a more fragmented landscape. When a forest is fragmented, the amount of edge increases at the expense of the core area. Highly fragmented forests can neither provide the food, cover, nor the reproduction needs of core-dependent species. This study presents a branch-and-bound procedure designed to find good feasible solutions, in a reasonable time, for forest harvest scheduling problems with constraints on maximum clearcut size and minimum core habitat area. The core area is measured by applying the concept of subregions. In each branch of the branch-and-bound tree, a partial solution leads to two children nodes, corresponding to the cases of harvesting or not a given stand in a given period. Pruning is based on constraint violations or unreachable objective values. The approach was tested with forests ranging from some dozens to more than a thousand stands. In general, branch-and-bound was able to quickly find optimal or good solutions, even for medium/large instances.
URI: http://repositorio.inesctec.pt/handle/123456789/5614
http://dx.doi.org/10.1007/s10479-016-2313-2
metadata.dc.type: article
Publication
Appears in Collections:CEGI - Articles in International Journals

Files in This Item:
File Description SizeFormat 
P-00K-VDK.pdf
  Restricted Access
1.52 MBAdobe PDFView/Open Request a copy


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.