Utilize este identificador para referenciar este registo: http://hdl.handle.net/10400.5/4860
Título: A new mixed-integer programming model for harvest scheduling subject to maximum area restrictions
Autor: Constantino, Miguel
Martins, Isabel
Borges, J.G.
Palavras-chave: forest management
harvest scheduling
spatial modeling
integer programming
Data: 2008
Editora: Informs
Citação: "Operations Research". ISSN: 0030-364X. 56(3) (2008) 542-551
Resumo: Forest ecosystem management often requires spatially explicit planning because the spatial arrangement of harvests has become a critical economic and environmental concern. Recent research on exact methods has addressed both the design and the solution of forest management problems with constraints on the clearcut size, but where simultaneously harvesting two adjacent stands in the same period does not necessarily exceed the maximum opening size. Two main integer programming approaches have been proposed for this area restriction model. However, both encompass an exponential number of variables or constraints. In this work, we present a new integer programming model with a polynomial number of variables and constraints. Branch and bound is used to solve it. The model was tested with both real and hypothetical forests ranging from 45 to 1,363 polygons. Results show that the proposed model’s solutions were within or slightly above 1% of the optimal solution and were obtained in a short computation time.
Peer review: yes
URI: http://hdl.handle.net/10400.5/4860
ISSN: 0030-364X
Versão do Editor: DOI 10.1287/opre.1070.0472
Aparece nas colecções:CEF - Artigos de Revistas

Ficheiros deste registo:
Ficheiro Descrição TamanhoFormato 
REP-2008-3.pdf201,61 kBAdobe PDFVer/Abrir

FacebookTwitterDeliciousLinkedInDiggGoogle BookmarksMySpace
Formato BibTex MendeleyEndnote 

Todos os registos no repositório estão protegidos por leis de copyright, com todos os direitos reservados.