A branch-and-bound procedure for forest harvest scheduling problems addressing aspects of habitat availability

dc.contributor.author Neto,T en
dc.contributor.author Constantino,M en
dc.contributor.author Martins,I en
dc.contributor.author João Pedro Pedroso en
dc.date.accessioned 2018-01-06T09:43:30Z
dc.date.available 2018-01-06T09:43:30Z
dc.date.issued 2013 en
dc.description.abstract In the literature, the most widely referred approaches regarding forest harvesting scheduling problems involving environmental concerns have typically addressed constraints on the maximum clear-cut area. Nevertheless, the solutions arising from those approaches in general display a loss of habitat availability. Such loss endangers the survival of many wild species. This study presents a branch-and-bound procedure designed to find good feasible solutions, in a reasonable time, to forest harvest scheduling problems with constraints on the clear-cut area and habitat availability. Two measures are applied for the habitat availability constraints: the area of all habitats and the connectivity between them. 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 harvesting a given stand in a given period. Pruning is based on constraint violations or unreachable objective values. Computational results are reported. en
dc.identifier.uri http://repositorio.inesctec.pt/handle/123456789/5622
dc.identifier.uri http://dx.doi.org/10.1111/itor.12003 en
dc.language eng en
dc.relation 4747 en
dc.rights info:eu-repo/semantics/embargoedAccess en
dc.title A branch-and-bound procedure for forest harvest scheduling problems addressing aspects of habitat availability en
dc.type article en
dc.type Publication en
Files
Original bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
P-006-7YB.pdf
Size:
643.53 KB
Format:
Adobe Portable Document Format
Description: