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

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 a...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:International transactions in operational research Ročník 20; číslo 5; s. 689 - 709
Hlavní autoři: Neto, Teresa, Constantino, Miguel, Martins, Isabel, Pedroso, João Pedro
Médium: Journal Article
Jazyk:angličtina
Vydáno: Oxford Blackwell Publishing Ltd 01.09.2013
Témata:
Availability
branch and bound
Forest management
forestry
Habitats
integer programming
Operations research
Owls
Scheduling
Studies
tree algorithms
ISSN:0969-6016, 1475-3995
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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.
Bibliografie:ark:/67375/WNG-22TQR1G3-S
istex:42532A1FC933327472DD15D815ED9AC93E034D70
ArticleID:ITOR12003
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-2
content type line 23
ISSN:0969-6016
1475-3995
DOI:10.1111/itor.12003