Harvest Scheduling Subject to Maximum Area Restrictions: Exploring Exact Approaches
Marcos Goycoolea (),
Alan T. Murray (),
Francisco Barahona (),
Rafael Epstein () and
Andrés Weintraub ()
Additional contact information
Marcos Goycoolea: School of Industrial and Systems Engineering, Georgia Institute of Technology, 755 Ferst Drive, Atlanta, Georgia 30332-0205
Alan T. Murray: Department of Geography, Ohio State University, Columbus, Ohio 43210
Francisco Barahona: IBM Watson Research Center, Yorktown Heights, New York 10598
Rafael Epstein: Departamento de Ingeniería Industrial, Universidad de Chile, República 701, Santiago, Chile
Andrés Weintraub: Departamento de Ingeniería Industrial, Universidad de Chile, República 701, Santiago, Chile
Operations Research, 2005, vol. 53, issue 3, 490-500
Abstract:
We consider a spatial problem arising in forest harvesting. For regulatory reasons, blocks harvested should not exceed a certain total area, typically 49 hectares. Traditionally, this problem, called the adjacency problem, has been approached by forming a priori blocks from basic cells of 5 to 25 hectares and solving the resulting mixed-integer program. Superior solutions can be obtained by including the construction of blocks in the decision process. The resulting problem is far more complex combinatorially. We present an exact algorithmic approach that has yielded good results in computational tests. This solution approach is based on determining a strong formulation of the linear programming problem through a clique representation of a projected problem.
Keywords: integer programming; cutting planes; environment (search for similar items in EconPapers)
Date: 2005
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (28)
Downloads: (external link)
http://dx.doi.org/10.1287/opre.1040.0169 (application/pdf)
Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:53:y:2005:i:3:p:490-500
Access Statistics for this article
More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().