A mixed-integer formulation of the minimum patch size problem

Stephanie Rebain, Marc Eric McDill

Research output: Contribution to journalArticle

43 Citations (Scopus)

Abstract

Forest harvest scheduling models have addressed wildlife habitat concerns in a variety of ways. One way is through minimum patch size constraints specifying that a certain amount of the forest must consist of patches meeting both minimum size and minimum age requirements. Patch size requirements may be necessary because a forest with only small patches of mature habitat may not be able to support populations of some wildlife species. Maximum harvest opening size constraints, which are often imposed for legal or policy reasons, tend to divide forest habitat into small patches. Minimum patch size constraints may be able to help mitigate the negative impact of maximum harvest opening size restrictions. Patch size requirements have been considered elsewhere, but a mixed-integer linear programming (MILP) formulation has never been presented. This article presents such a formulation, which allows minimum patch size problems to be solved using the branch and bound algorithm available through commercial solver packages. An example problem is formulated, solved, and discussed.

Original languageEnglish (US)
Pages (from-to)608-618
Number of pages11
JournalForest Science
Volume49
Issue number4
StatePublished - Aug 1 2003

Fingerprint

patch size
wildlife habitats
linear programming
forest habitats
wildlife
linear programing
habitat
habitats
harvest

All Science Journal Classification (ASJC) codes

  • Forestry
  • Ecology
  • Ecological Modeling

Cite this

Rebain, Stephanie ; McDill, Marc Eric. / A mixed-integer formulation of the minimum patch size problem. In: Forest Science. 2003 ; Vol. 49, No. 4. pp. 608-618.
@article{2b84d6cd72834575b77daa4c18e3a175,
title = "A mixed-integer formulation of the minimum patch size problem",
abstract = "Forest harvest scheduling models have addressed wildlife habitat concerns in a variety of ways. One way is through minimum patch size constraints specifying that a certain amount of the forest must consist of patches meeting both minimum size and minimum age requirements. Patch size requirements may be necessary because a forest with only small patches of mature habitat may not be able to support populations of some wildlife species. Maximum harvest opening size constraints, which are often imposed for legal or policy reasons, tend to divide forest habitat into small patches. Minimum patch size constraints may be able to help mitigate the negative impact of maximum harvest opening size restrictions. Patch size requirements have been considered elsewhere, but a mixed-integer linear programming (MILP) formulation has never been presented. This article presents such a formulation, which allows minimum patch size problems to be solved using the branch and bound algorithm available through commercial solver packages. An example problem is formulated, solved, and discussed.",
author = "Stephanie Rebain and McDill, {Marc Eric}",
year = "2003",
month = "8",
day = "1",
language = "English (US)",
volume = "49",
pages = "608--618",
journal = "Forest Science",
issn = "0015-749X",
publisher = "Society of American Foresters",
number = "4",

}

A mixed-integer formulation of the minimum patch size problem. / Rebain, Stephanie; McDill, Marc Eric.

In: Forest Science, Vol. 49, No. 4, 01.08.2003, p. 608-618.

Research output: Contribution to journalArticle

TY - JOUR

T1 - A mixed-integer formulation of the minimum patch size problem

AU - Rebain, Stephanie

AU - McDill, Marc Eric

PY - 2003/8/1

Y1 - 2003/8/1

N2 - Forest harvest scheduling models have addressed wildlife habitat concerns in a variety of ways. One way is through minimum patch size constraints specifying that a certain amount of the forest must consist of patches meeting both minimum size and minimum age requirements. Patch size requirements may be necessary because a forest with only small patches of mature habitat may not be able to support populations of some wildlife species. Maximum harvest opening size constraints, which are often imposed for legal or policy reasons, tend to divide forest habitat into small patches. Minimum patch size constraints may be able to help mitigate the negative impact of maximum harvest opening size restrictions. Patch size requirements have been considered elsewhere, but a mixed-integer linear programming (MILP) formulation has never been presented. This article presents such a formulation, which allows minimum patch size problems to be solved using the branch and bound algorithm available through commercial solver packages. An example problem is formulated, solved, and discussed.

AB - Forest harvest scheduling models have addressed wildlife habitat concerns in a variety of ways. One way is through minimum patch size constraints specifying that a certain amount of the forest must consist of patches meeting both minimum size and minimum age requirements. Patch size requirements may be necessary because a forest with only small patches of mature habitat may not be able to support populations of some wildlife species. Maximum harvest opening size constraints, which are often imposed for legal or policy reasons, tend to divide forest habitat into small patches. Minimum patch size constraints may be able to help mitigate the negative impact of maximum harvest opening size restrictions. Patch size requirements have been considered elsewhere, but a mixed-integer linear programming (MILP) formulation has never been presented. This article presents such a formulation, which allows minimum patch size problems to be solved using the branch and bound algorithm available through commercial solver packages. An example problem is formulated, solved, and discussed.

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

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

M3 - Article

VL - 49

SP - 608

EP - 618

JO - Forest Science

JF - Forest Science

SN - 0015-749X

IS - 4

ER -