Finding Efficient Harvest Schedules under Three Conflicting Objectives

• Published in: Forest science Vol. 55; no. 2; pp. 117 - 131
• Main Authors: Toth, Sandor F, McDill, Marc E
• Format: Journal Article
• Language: English
• Published: Bethesda Oxford University Press 01.04.2009
• Subjects: Algorithms; case studies; equations; forest management; forest-wildlife relations; integer programming; logging; methodology; multiobjective forest planning; Operations research; planning; problem solving; spatial data; Studies; tradeoffs; wildlife habitats
• ISSN: 0015-749X; 1938-3738
• DOI: 10.1093/forestscience/55.2.117

Public forests have many conflicting uses. Designing forest management schemes that provide the public with an optimal bundle of benefits is therefore a major challenge. Although a capability to quantify and visualize the tradeoffs between the competing objectives can be very useful for decisionmakers, developing this capability presents unique difficulties if three or more conflicting objectives are present and the solution alternatives are discrete. This study extends four multiobjective programming methods to generate spatially explicit forest management alternatives that are efficient (nondominated) with respect to three or more competing objectives. The algorithms were applied to a hypothetical forest planning problem with three timber- and wildlife-related objectives. Whereas the (epsilon)-Constraining and the proposed Alpha-Delta methods found a larger number of efficient alternatives, the Modified Weighted Objective Function and the Tchebycheff methods provided better overall estimation of the timber and nontimber tradeoffs associated with the test problem. In addition, the former two methods allowed a greater degree of user control and are easier to generalize to n-objective problems.