Operations Research
HOME HELP FEEDBACK SUBSCRIPTIONS ARCHIVE SEARCH TABLE OF CONTENTS
 QUICK SEARCH:   [advanced]


     


OPERATIONS RESEARCH
Vol. 56, No. 3, May-June 2008, pp. 542-551
DOI: 10.1287/opre.1070.0472
This Article
Right arrow Full Text (PDF)
Right arrow References
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Download to citation manager
Right arrow reprints & permissions
Citing Articles
Right arrow Citing Articles via Google Scholar
Google Scholar
Right arrow Articles by Constantino, M.
Right arrow Articles by Borges, J. G.
Right arrow Search for Related Content

A New Mixed-Integer Programming Model for Harvest Scheduling Subject to Maximum Area Restrictions

Miguel Constantino, Isabel Martins, José G. Borges

Universidade de Lisboa, Faculdade de Ciências, DEIO/Centro de Investigação Operacional, Bloco C6, piso 4, Cidade Universitária,1749-016 Lisboa, Portugal
Universidade Técnica de Lisboa, Instituto Superior de Agronomia/Centro de Investigação Operacional, Tapada da Ajuda, 1349-017 Lisboa, Portugal
Universidade Técnica de Lisboa, Instituto Superior de Agronomia/Centro de Estudos Florestais, Tapada da Ajuda, 1349-017 Lisboa, Portugal

miguel.constantino{at}fc.ul.pt
isabelinha{at}isa.utl.pt
joseborges{at}isa.utl.pt

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.

Subject classifications: forest management; harvest scheduling; spatial modeling; integer programming.
History: Received February 2006; revision received May 2007; accepted May 2007.







HOME HELP FEEDBACK SUBSCRIPTIONS ARCHIVE SEARCH TABLE OF CONTENTS
Copyright © 2008 by INFORMS.