Harvest scheduling subject to maximum area restrictions: Exploring exact approaches
成果类型：
Article
署名作者：
Goycoolea, M; Murray, AT; Barahona, F; Epstein, R; Weintraub, A
署名单位：
University System of Georgia; Georgia Institute of Technology; University System of Ohio; Ohio State University; International Business Machines (IBM); IBM USA; Universidad de Chile
刊物名称：
OPERATIONS RESEARCH
ISSN/ISSBN：
0030-364X
DOI：
10.1287/opre.1040.0169
发表日期：
2005
页码：
490-500
关键词：
摘要：
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.