A strengthening procedure for the path formulation of the area-based adjacency problem in harvest scheduling models

Sándor F. Tóth, Marc Eric McDill, Nóra Könnyu, Sonney George

Research output: Contribution to journalArticle

19 Citations (Scopus)

Abstract

Spatially-explicit harvest scheduling models optimize the spatiotemporal layout of forest management actions to best meet management objectives such as profit maximization, even flow of products, or wildlife habitat preservation while satisfying a variety of constraints. This investigation focuses on modeling maximum harvest opening size restrictions whose role is to limit the size of contiguous clear cuts on a forested landscape. These restrictions, a.k.a. green-up constraints, allow adjacent forest stands to be cut within a pre-specified timeframe, called green-up period, only if their combined area does not exceed a limit. We present a strengthening procedure for one of the existing integer programming formulations of this so-called Area Restriction Model and test the computational performance of the new model on sixty hypothetical and seven real forest planning applications. The results suggest that the strengthened model can often outperform the other three existing formulations. We also find that the original Path Model is still competitive in terms of solution times.

Original languageEnglish (US)
Pages (from-to)27-49
Number of pages23
JournalMathematical and Computational Forestry and Natural-Resource Sciences
Volume4
Issue number1
StatePublished - Feb 28 2012

Fingerprint

Adjacency
Strengthening
Scheduling
Path
Formulation
Restriction
Forest Management
product flow
profit maximization
Model
Forestry
Integer programming
Integer Programming
wildlife habitats
Preservation
habitat conservation
forest management
Profit
Layout
Profitability

All Science Journal Classification (ASJC) codes

  • Forestry
  • Environmental Engineering
  • Computer Science Applications
  • Applied Mathematics

Cite this

@article{cb0e5682d45646dd9a5e6bd32ff55cf7,
title = "A strengthening procedure for the path formulation of the area-based adjacency problem in harvest scheduling models",
abstract = "Spatially-explicit harvest scheduling models optimize the spatiotemporal layout of forest management actions to best meet management objectives such as profit maximization, even flow of products, or wildlife habitat preservation while satisfying a variety of constraints. This investigation focuses on modeling maximum harvest opening size restrictions whose role is to limit the size of contiguous clear cuts on a forested landscape. These restrictions, a.k.a. green-up constraints, allow adjacent forest stands to be cut within a pre-specified timeframe, called green-up period, only if their combined area does not exceed a limit. We present a strengthening procedure for one of the existing integer programming formulations of this so-called Area Restriction Model and test the computational performance of the new model on sixty hypothetical and seven real forest planning applications. The results suggest that the strengthened model can often outperform the other three existing formulations. We also find that the original Path Model is still competitive in terms of solution times.",
author = "T{\'o}th, {S{\'a}ndor F.} and McDill, {Marc Eric} and N{\'o}ra K{\"o}nnyu and Sonney George",
year = "2012",
month = "2",
day = "28",
language = "English (US)",
volume = "4",
pages = "27--49",
journal = "Mathematical and Computational Forestry and Natural-Resource Sciences",
issn = "1946-7664",
publisher = "Contemporary Journal Concept Press",
number = "1",

}

A strengthening procedure for the path formulation of the area-based adjacency problem in harvest scheduling models. / Tóth, Sándor F.; McDill, Marc Eric; Könnyu, Nóra; George, Sonney.

In: Mathematical and Computational Forestry and Natural-Resource Sciences, Vol. 4, No. 1, 28.02.2012, p. 27-49.

Research output: Contribution to journalArticle

TY - JOUR

T1 - A strengthening procedure for the path formulation of the area-based adjacency problem in harvest scheduling models

AU - Tóth, Sándor F.

AU - McDill, Marc Eric

AU - Könnyu, Nóra

AU - George, Sonney

PY - 2012/2/28

Y1 - 2012/2/28

N2 - Spatially-explicit harvest scheduling models optimize the spatiotemporal layout of forest management actions to best meet management objectives such as profit maximization, even flow of products, or wildlife habitat preservation while satisfying a variety of constraints. This investigation focuses on modeling maximum harvest opening size restrictions whose role is to limit the size of contiguous clear cuts on a forested landscape. These restrictions, a.k.a. green-up constraints, allow adjacent forest stands to be cut within a pre-specified timeframe, called green-up period, only if their combined area does not exceed a limit. We present a strengthening procedure for one of the existing integer programming formulations of this so-called Area Restriction Model and test the computational performance of the new model on sixty hypothetical and seven real forest planning applications. The results suggest that the strengthened model can often outperform the other three existing formulations. We also find that the original Path Model is still competitive in terms of solution times.

AB - Spatially-explicit harvest scheduling models optimize the spatiotemporal layout of forest management actions to best meet management objectives such as profit maximization, even flow of products, or wildlife habitat preservation while satisfying a variety of constraints. This investigation focuses on modeling maximum harvest opening size restrictions whose role is to limit the size of contiguous clear cuts on a forested landscape. These restrictions, a.k.a. green-up constraints, allow adjacent forest stands to be cut within a pre-specified timeframe, called green-up period, only if their combined area does not exceed a limit. We present a strengthening procedure for one of the existing integer programming formulations of this so-called Area Restriction Model and test the computational performance of the new model on sixty hypothetical and seven real forest planning applications. The results suggest that the strengthened model can often outperform the other three existing formulations. We also find that the original Path Model is still competitive in terms of solution times.

UR - http://www.scopus.com/inward/record.url?scp=84860314388&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84860314388&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:84860314388

VL - 4

SP - 27

EP - 49

JO - Mathematical and Computational Forestry and Natural-Resource Sciences

JF - Mathematical and Computational Forestry and Natural-Resource Sciences

SN - 1946-7664

IS - 1

ER -