Modeling target volume flows in forest harvest scheduling subject to maximum area restrictions

Abstract

In forest harvest scheduling problems, one must decide which stands to harvest in each period during a planning horizon. A typical requirement in these problems is a steady flow of harvested timber, mainly to ensure that the industry is able to continue operating with similar levels of machine and labor utilizations. The integer programming approaches described use the so-called volume constraints to impose such a steady yield. These constraints do not directly impose a limit on the global deviation of the volume harvested over the planning horizon or use pre-defined target harvest levels. Addressing volume constraints generally increases the difficulty of solving the integer programming formulations, in particular those proposed for the area restriction model approach. In this paper, we present a new type of volume constraint as well as a multi-objective programming approach to achieve an even flow of timber. We compare the main basic approaches from a computational perspective. The new volume constraints seem to more explicitly control the global deviation of the harvested volume, while the multi-objective approach tends to provide the best profits for a given dispersion of the timber flow. Neither approach substantially changed the computational times involved.