### Abstract

This article evaluates the performance of five traditional methods and one new method of generating the efficient frontier for a bi-criteria, spatially explicit harvest scheduling problem. The problem is to find all possible efficient solutions, thus defining the trade-offs between two objectives: (1) maximizing the net present value of the forest and (2) maximizing the minimum area over the planning horizon in large, mature forest patches. The methods for generating the efficient frontier were tested using a hypothetical forest consisting of 50 stands. The methods were compared based on the number of efficient solutions each method can identify and on how quickly the solutions were identified. The potential to generalize these algorithms to 3- or n-criteria cases is also assessed. Three of the traditional approaches, the ∈- constraining; the triangles method, the decomposition algorithm based on the Tchebycheff metric; and the new, proposed method are capable of generating all or most of the efficient solutions. However, the triangles and the new method far outperformed the other approaches in terms of solution time. The new method, called alpha-delta, appears to be the simplest to generalize to the tri-criteria case.

Original language | English (US) |
---|---|

Pages (from-to) | 93-107 |

Number of pages | 15 |

Journal | Forest Science |

Volume | 52 |

Issue number | 1 |

State | Published - Feb 1 2006 |

### Fingerprint

### All Science Journal Classification (ASJC) codes

- Forestry
- Ecology
- Ecological Modeling

### Cite this

*Forest Science*,

*52*(1), 93-107.

}

*Forest Science*, vol. 52, no. 1, pp. 93-107.

**Finding the efficient frontier of a bi-criteria, spatially explicit, harvest scheduling problem.** / Tóth, Sándor F.; McDill, Marc Eric; Rebain, Stephanie.

Research output: Contribution to journal › Article

TY - JOUR

T1 - Finding the efficient frontier of a bi-criteria, spatially explicit, harvest scheduling problem

AU - Tóth, Sándor F.

AU - McDill, Marc Eric

AU - Rebain, Stephanie

PY - 2006/2/1

Y1 - 2006/2/1

N2 - This article evaluates the performance of five traditional methods and one new method of generating the efficient frontier for a bi-criteria, spatially explicit harvest scheduling problem. The problem is to find all possible efficient solutions, thus defining the trade-offs between two objectives: (1) maximizing the net present value of the forest and (2) maximizing the minimum area over the planning horizon in large, mature forest patches. The methods for generating the efficient frontier were tested using a hypothetical forest consisting of 50 stands. The methods were compared based on the number of efficient solutions each method can identify and on how quickly the solutions were identified. The potential to generalize these algorithms to 3- or n-criteria cases is also assessed. Three of the traditional approaches, the ∈- constraining; the triangles method, the decomposition algorithm based on the Tchebycheff metric; and the new, proposed method are capable of generating all or most of the efficient solutions. However, the triangles and the new method far outperformed the other approaches in terms of solution time. The new method, called alpha-delta, appears to be the simplest to generalize to the tri-criteria case.

AB - This article evaluates the performance of five traditional methods and one new method of generating the efficient frontier for a bi-criteria, spatially explicit harvest scheduling problem. The problem is to find all possible efficient solutions, thus defining the trade-offs between two objectives: (1) maximizing the net present value of the forest and (2) maximizing the minimum area over the planning horizon in large, mature forest patches. The methods for generating the efficient frontier were tested using a hypothetical forest consisting of 50 stands. The methods were compared based on the number of efficient solutions each method can identify and on how quickly the solutions were identified. The potential to generalize these algorithms to 3- or n-criteria cases is also assessed. Three of the traditional approaches, the ∈- constraining; the triangles method, the decomposition algorithm based on the Tchebycheff metric; and the new, proposed method are capable of generating all or most of the efficient solutions. However, the triangles and the new method far outperformed the other approaches in terms of solution time. The new method, called alpha-delta, appears to be the simplest to generalize to the tri-criteria case.

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

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

M3 - Article

AN - SCOPUS:33644557779

VL - 52

SP - 93

EP - 107

JO - Forest Science

JF - Forest Science

SN - 0015-749X

IS - 1

ER -