Optimal parameter settings for solving harvest scheduling models with adjacency constraints

Phillip J. Manning, Marc Eric McDill

Research output: Contribution to journalArticle

4 Citations (Scopus)

Abstract

Optimal parameter settings to improve the efficiency of solving harvest scheduling models with adjacency constraints were examined using Ilog's Cplex ® 11.2 optimizer tuning tool. A total of 160 randomly generated hypothetical forests were created with either 50 or 100 stands and four age-class distributions. Mixed integer programming problems were formulated in Model I form with four different adjacency constraint types, two Unit Restriction Model (URM) adjacency constraints (Pairwise and Maximal Clique) and two Area Restriction Model (ARM) formulations (Path and Generalized Management Unit). A total of 640 problem sets-where a set is a common forest size, age-class distribution, and adjacency constraint type-were tuned to determine optimal parameter settings and then were solved at both the default and optimal settings. In general, mean solution time was less for a given problem set using the optimal parameters compared to the default parameters. The results discussed provide a simple approach to decrease the solution time of solving mixed integer forest planning problems with adjacency constraints.

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

Fingerprint

Adjacency
Optimal Parameter
Scheduling
age class
age structure
Restriction
Integer programming
Maximal Clique
mixed forest
Unit
Model
Mixed Integer Programming
Tuning
planning
Pairwise
Planning
harvest
parameter
Decrease
Path

All Science Journal Classification (ASJC) codes

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

Cite this

@article{5a4eada5e9da408591619bd055eb842d,
title = "Optimal parameter settings for solving harvest scheduling models with adjacency constraints",
abstract = "Optimal parameter settings to improve the efficiency of solving harvest scheduling models with adjacency constraints were examined using Ilog's Cplex {\circledR} 11.2 optimizer tuning tool. A total of 160 randomly generated hypothetical forests were created with either 50 or 100 stands and four age-class distributions. Mixed integer programming problems were formulated in Model I form with four different adjacency constraint types, two Unit Restriction Model (URM) adjacency constraints (Pairwise and Maximal Clique) and two Area Restriction Model (ARM) formulations (Path and Generalized Management Unit). A total of 640 problem sets-where a set is a common forest size, age-class distribution, and adjacency constraint type-were tuned to determine optimal parameter settings and then were solved at both the default and optimal settings. In general, mean solution time was less for a given problem set using the optimal parameters compared to the default parameters. The results discussed provide a simple approach to decrease the solution time of solving mixed integer forest planning problems with adjacency constraints.",
author = "Manning, {Phillip J.} and McDill, {Marc Eric}",
year = "2012",
month = "2",
day = "28",
language = "English (US)",
volume = "4",
pages = "16--26",
journal = "Mathematical and Computational Forestry and Natural-Resource Sciences",
issn = "1946-7664",
publisher = "Contemporary Journal Concept Press",
number = "1",

}

TY - JOUR

T1 - Optimal parameter settings for solving harvest scheduling models with adjacency constraints

AU - Manning, Phillip J.

AU - McDill, Marc Eric

PY - 2012/2/28

Y1 - 2012/2/28

N2 - Optimal parameter settings to improve the efficiency of solving harvest scheduling models with adjacency constraints were examined using Ilog's Cplex ® 11.2 optimizer tuning tool. A total of 160 randomly generated hypothetical forests were created with either 50 or 100 stands and four age-class distributions. Mixed integer programming problems were formulated in Model I form with four different adjacency constraint types, two Unit Restriction Model (URM) adjacency constraints (Pairwise and Maximal Clique) and two Area Restriction Model (ARM) formulations (Path and Generalized Management Unit). A total of 640 problem sets-where a set is a common forest size, age-class distribution, and adjacency constraint type-were tuned to determine optimal parameter settings and then were solved at both the default and optimal settings. In general, mean solution time was less for a given problem set using the optimal parameters compared to the default parameters. The results discussed provide a simple approach to decrease the solution time of solving mixed integer forest planning problems with adjacency constraints.

AB - Optimal parameter settings to improve the efficiency of solving harvest scheduling models with adjacency constraints were examined using Ilog's Cplex ® 11.2 optimizer tuning tool. A total of 160 randomly generated hypothetical forests were created with either 50 or 100 stands and four age-class distributions. Mixed integer programming problems were formulated in Model I form with four different adjacency constraint types, two Unit Restriction Model (URM) adjacency constraints (Pairwise and Maximal Clique) and two Area Restriction Model (ARM) formulations (Path and Generalized Management Unit). A total of 640 problem sets-where a set is a common forest size, age-class distribution, and adjacency constraint type-were tuned to determine optimal parameter settings and then were solved at both the default and optimal settings. In general, mean solution time was less for a given problem set using the optimal parameters compared to the default parameters. The results discussed provide a simple approach to decrease the solution time of solving mixed integer forest planning problems with adjacency constraints.

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

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

M3 - Article

VL - 4

SP - 16

EP - 26

JO - Mathematical and Computational Forestry and Natural-Resource Sciences

JF - Mathematical and Computational Forestry and Natural-Resource Sciences

SN - 1946-7664

IS - 1

ER -