Incorporating average and maximum area restrictions in harvest scheduling models
نویسندگان
چکیده
A major goal in natural resource management has long been balancing the multiple uses of forest lands. Timber harvesting remains an important component of natural resource utilization, but must be approached in such a way that recreational use, ecosystem dynamics, species survivability, and other considerations are not sacrificed. One way in which production impacts are mitigated in forest management is by restricting the spatial extent of harvesting activities in developed plans. Through the use of harvest scheduling optimization models, constraints can be structured and imposed to limit local area disturbance associated with harvesting to a stipulated maximum. This represents an approach for regulating impacts in an economically driven management setting. Harvest scheduling research has recognized the challenges in appropriately structuring maximum area restrictions in optimization models, but regulating average disturbance area size may also be desired. This paper develops a model formulation for imposing average and maximum area limits on local impacts in harvest scheduling that can be solved using exact techniques. Application results are presented that highlight the feasibility of this approach. Further, the associated tradeoffs that exist in modeling both average and maximum area restrictions simultaneously are illustrated. Résumé : Depuis longtemps, un des principaux buts de la gestion des ressources naturelles est de maintenir l’équilibre entre les différentes utilisations de la forêt. Bien que la récolte des arbres demeure une composante importante de l’utilisation des ressources naturelles, elle doit être envisagée de façon telle que les activités récréatives, la dynamique des écosystèmes, la survie des espèces et bien d’autres aspects ne soient pas compromis. Une façon d’atténuer les impacts de la coupe consiste à limiter l’étendue spatiale des activités de récolte lors de la planification. À l’aide de modèles d’optimisation permettant l’ordonnancement des opérations de récolte, des contraintes peuvent être structurées et imposées, afin de limiter la superficie locale des perturbations dues à la récolte à une valeur maximale déterminée. Cette approche représente une façon de contrôler les impacts dans un environnement soumis à des prérogatives de nature économique. La recherche dans le domaine de la planification des opérations forestières reconnaît la difficulté de structurer adéquatement les contraintes de superficies dans les modèles d’optimisation. Mais il peut également être souhaitable de contrôler la superficie moyenne des perturbations. Cet article développe un modèle de planification des opérations pour imposer des valeurs limites moyennes et maximales des impacts locaux et pouvant être résolu par une approche exacte. Les résultats d’une mise à l’essai démontrent la faisabilité de l’approche. De plus, les compromis associés à la modélisation simultanée de contraintes de superficie maximale et moyenne sont illustrés. [Traduit par la Rédaction] Murray et al. 464
منابع مشابه
A cutting plane method for solving harvest scheduling models with area restrictions
0377-2217/$ see front matter 2013 Elsevier B.V. A http://dx.doi.org/10.1016/j.ejor.2013.01.020 ⇑ Corresponding author. Tel.: +1 206 616 2738. E-mail addresses: [email protected] (N. K Tóth). We describe a cutting plane algorithm for an integer programming problem that arises in forest harvest scheduling. Spatial harvest scheduling models optimize the binary decisions of cutting or not cuttin...
متن کاملA Strengthening Procedure for the Path Formulation of the Area-Based Adjacency Problem in Harvest Scheduling Models
Spatially-explicit harvest scheduling models optimize the spatiotemporal layout of forest management actions to best meet management objectives such as profit maximization, even flow of products, or wildlife habitat preservation while satisfying a variety of constraints. This investigation focuses on modeling maximum harvest opening size restrictions whose role is to limit the size of contiguou...
متن کاملTesting the Use of Lazy Constraints in Solving Area-Based Adjacency Formulations of Harvest Scheduling Models
Spatially explicit harvest scheduling models to enforce maximum harvest opening size restrictions often lead to combinatorial problems that are hard to solve. This article shows that the inequalities required by one of the three existing formulations, the Path model are typically lazy. In other words, these constraints are rarely binding during optimization, especially if the maximum opening si...
متن کاملImproving computational capabilities for addressing volume constraints in forest harvest scheduling problems
Forest Harvest Scheduling problems incorporating area-based restrictions have been of great practical interest for several years, but only recently have advances been made that allow them to be efficiently solved. One significant development has made use of formulation strengthening using the Cluster Packing Problem. This improved formulation has allowed medium sized problems to be easily solve...
متن کاملTime Efficiency of Selected Types of Adjacency Constraints in Solving Unit Restriction Models
Abstract: Spatial restrictions of harvesting have been extensively studied due to a number of environmental, social and legal regulations. Many spatial restrictions are defined by adjacency constraints, for which a number of algorithms have been developed. Research into the unit restriction model (URM) using a branch and bound algorithm focused on decreasing the number of adjacency constraints ...
متن کامل